Infinitary tableau for semantic truth

Meadows, Toby (2015) Infinitary tableau for semantic truth. Review of Symbolic Logic, 8 2: 207-235. doi:10.1017/S175502031500012X

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
UQ390531_OA.pdf Full text (open access) application/pdf 354.91KB 0

Author Meadows, Toby
Title Infinitary tableau for semantic truth
Journal name Review of Symbolic Logic   Check publisher's open access policy
ISSN 1755-0211
Publication date 2015-06
Sub-type Article (original research)
DOI 10.1017/S175502031500012X
Open Access Status File (Publisher version)
Volume 8
Issue 2
Start page 207
End page 235
Total pages 29
Place of publication Cambridge, United Kingdom
Publisher Cambridge University Press
Language eng
Formatted abstract
We provide infinitary proof theories for three common semantic theories of truth: strong Kleene, van Fraassen supervaluation and Cantini supervaluation. 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 ω1CK .This work can be understood as an effort to provide a proof-theoretic counterpart to Welch’s gametheoretic (Welch, 2009).
Q-Index Code C1
Q-Index Status Provisional Code
Institutional Status Non-UQ

Document type: Journal Article
Sub-type: Article (original research)
Collection: School of Historical and Philosophical Inquiry
Version Filter Type
Citation counts: TR Web of Science Citation Count  Cited 0 times in Thomson Reuters Web of Science Article
Scopus Citation Count Cited 0 times in Scopus Article
Google Scholar Search Google Scholar
Created: Thu, 16 Jun 2016, 16:52:26 EST by Anthony Yeates on behalf of Learning and Research Services (UQ Library)