2013
DOI: 10.1017/s1755020313000282
|View full text |Cite
|
Sign up to set email alerts
|

Axioms for Grounded Truth

Abstract: We axiomatize Leitgeb’s (2005) theory of truth and show that this theory proves all arithmetical sentences of the system of ramified analysis up to ε0. We also give alternative axiomatizations of Kripke’s (1975) theory of truth (Strong Kleene and supervaluational version) and show that they are at least as strong as the Kripke-Feferman system KF and Cantini’s VF, respectively.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
6
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
7
1

Relationship

2
6

Authors

Journals

citations
Cited by 8 publications
(6 citation statements)
references
References 14 publications
(13 reference statements)
0
6
0
Order By: Relevance
“…Schindler [40] defined a group of systems that resemble ours. They differ from in restricting the compositional principles – to grounded sentences.…”
Section: Comparison With Other Axiomatizations Of Truthmentioning
confidence: 99%
“…Schindler [40] defined a group of systems that resemble ours. They differ from in restricting the compositional principles – to grounded sentences.…”
Section: Comparison With Other Axiomatizations Of Truthmentioning
confidence: 99%
“…12 It is no coincidence that the theories of truth proposed by the authors, e.g. Picollo (2019) or Schindler (2014), have gone in that direction. In this respect, non-classical theories might be at an advantage, insofar as they might have all instances of disquotation at their disposal, though this requires some further investigation.…”
Section: _ _mentioning
confidence: 99%
“…the class of purely truth-theoretic principles the theory entails is not recursively axiomatizable. 10 Schindler [30] provides a nice axiomatic system, but it is naturally far from capturing the original semantic construction.…”
Section: Formal Truth Theoriesmentioning
confidence: 99%
“…The cases for the other connectives and the quantifiers are similar. 30 Let t • denote ϑ ζ (s), for some ζ < β. By the last line of (10), ϑ β (t • ) d-refers to ϑ ζ (s) which, by our main i.h.…”
mentioning
confidence: 99%