Infinitary Tableau for Semantic Truth

Toby Meadows

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)
9 Downloads (Pure)


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).
Original languageEnglish
Pages (from-to)207-235
Number of pages29
JournalReview of Symbolic Logic
Issue number2
Early online date8 Apr 2015
Publication statusPublished - Jun 2015

Bibliographical note

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.


  • Semantic Theories of Truth


Dive into the research topics of 'Infinitary Tableau for Semantic Truth'. Together they form a unique fingerprint.

Cite this