Abstract
| Original language | English |
|---|---|
| Pages (from-to) | 207-235 |
| Number of pages | 29 |
| Journal | Review of Symbolic Logic |
| Volume | 8 |
| Issue number | 2 |
| Early online date | 8 Apr 2015 |
| DOIs | |
| Publication status | Published - Jun 2015 |
Fingerprint
Keywords
- Semantic Theories of Truth
Cite this
Infinitary Tableau for Semantic Truth. / Meadows, Toby.
In: Review of Symbolic Logic, Vol. 8, No. 2, 06.2015, p. 207-235.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Infinitary Tableau for Semantic Truth
AU - Meadows, Toby
N1 - Acknowledgements I would like to thank Philip Welch for his assistance and acknowledge the late Greg Hjorth for the time he spent in helping me learn how to use the tools used in the paper. I would also like to thank Hannes Leitgeb for giving me the opportunity to present this material and for providing me with valuable feedback. And I would like to thank Benedict Eastaugh and Marcus Holland for helping make the final sections of this paper more accessible in the way it was intended.
PY - 2015/6
Y1 - 2015/6
N2 - We provide infinitary proof theories for three common semantic theories of truth: strong Kleene, van Fraassen supervaluation and Cantinisupervaluation. The value of these systems is that they provide an easy method of proving simple facts about semantic theories. Moreover we shall show that they also give us a simpler understanding of the computational complexity of these definitions and provide a direct proof that the closure ordinal for Kripke’s definition is ωCK1. This work can be understood as an effort to provide a proof-theoretic counterpart to Welch’s game theoretic (Welch, 2009).
AB - We provide infinitary proof theories for three common semantic theories of truth: strong Kleene, van Fraassen supervaluation and Cantinisupervaluation. The value of these systems is that they provide an easy method of proving simple facts about semantic theories. Moreover we shall show that they also give us a simpler understanding of the computational complexity of these definitions and provide a direct proof that the closure ordinal for Kripke’s definition is ωCK1. This work can be understood as an effort to provide a proof-theoretic counterpart to Welch’s game theoretic (Welch, 2009).
KW - Semantic Theories of Truth
U2 - 10.1017/S175502031500012X
DO - 10.1017/S175502031500012X
M3 - Article
VL - 8
SP - 207
EP - 235
JO - Review of Symbolic Logic
JF - Review of Symbolic Logic
SN - 1755-0203
IS - 2
ER -