Switch to: References

Citations of:

Games for truth

Bulletin of Symbolic Logic 15 (4):410-427 (2009)

Add citations

You must login to add citations.
  1. Truth, Dependence and Supervaluation: Living with the Ghost.Toby Meadows - 2013 - Journal of Philosophical Logic 42 (2):221-240.
    In J Philos Logic 34:155–192, 2005, Leitgeb provides a theory of truth which is based on a theory of semantic dependence. We argue here that the conceptual thrust of this approach provides us with the best way of dealing with semantic paradoxes in a manner that is acceptable to a classical logician. However, in investigating a problem that was raised at the end of J Philos Logic 34:155–192, 2005, we discover that something is missing from Leitgeb’s original definition. Moreover, we (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  • A note on Horwich’s notion of grounding.Thomas Schindler - 2020 - Synthese 197 (5):2029-2038.
    Horwich proposes a solution to the liar paradox that relies on a particular notion of grounding—one that, unlike Kripke’s notion of grounding, does not invoke any “Tarski-style compositional principles”. In this short note, we will formalize Horwich’s construction and argue that his solution to the liar paradox does not justify certain generalizations about truth that he endorses. We argue that this situation is not resolved even if one appeals to the \-rule. In the final section, we briefly discuss how Horwich (...)
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  • Infinitary Tableau for Semantic Truth.Toby Meadows - 2015 - Review of Symbolic Logic 8 (2):207-235.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Truth, Partial Logic and Infinitary Proof Systems.Martin Fischer & Norbert Gratzl - 2017 - Studia Logica 106 (3):515-540.
    In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect harmoniously the partial version of Kripke–Feferman with its intended semantics. The method we apply is based on infinitary proof systems containing an ω-rule.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  • The Complexity of the Dependence Operator.P. D. Welch - 2015 - Journal of Philosophical Logic 44 (3):337-340.
    We show that Leitgeb’s dependence operator of Leitgeb is a \-operator and that this is best possible.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  • Guest Editors’ Introduction.Riccardo Bruni & Shawn Standefer - 2019 - Journal of Philosophical Logic 48 (1):1-9.
  • A Graph-Theoretic Analysis of the Semantic Paradoxes.Timo Beringer & Thomas Schindler - 2017 - Bulletin of Symbolic Logic 23 (4):442-492.
    We introduce a framework for a graph-theoretic analysis of the semantic paradoxes. Similar frameworks have been recently developed for infinitary propositional languages by Cook and Rabern, Rabern, and Macauley. Our focus, however, will be on the language of first-order arithmetic augmented with a primitive truth predicate. Using Leitgeb’s notion of semantic dependence, we assign reference graphs (rfgs) to the sentences of this language and define a notion of paradoxicality in terms of acceptable decorations of rfgs with truth values. It is (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Non-Classical Circular Definitions.Shawn Standefer - 2017 - Australasian Journal of Logic 14 (1).
    Circular denitions have primarily been studied in revision theory in the classical scheme. I present systems of circular denitions in the Strong Kleene and supervaluation schemes and provide complete proof systems for them. One class of denitions, the intrinsic denitions, naturally arises in both schemes. I survey some of the features of this class of denitions.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Truth, Partial Logic and Infinitary Proof Systems.Martin Fischer & Norbert Gratzl - 2017 - Studia Logica:1-26.
    In this paper we apply proof theoretic methods used for classical systems in order to obtain upper bounds for systems in partial logic. We focus on a truth predicate interpreted in a Kripke style way via strong Kleene; whereas the aim is to connect harmoniously the partial version of Kripke–Feferman with its intended semantics. The method we apply is based on infinitary proof systems containing an \-rule.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  • Truth, Logical Validity and Determinateness: A Commentary on Field’s Saving Truth From Paradox.P. D. Welch - 2011 - Review of Symbolic Logic 4 (3):348-359.
    We consider notions of truth and logical validity defined in various recent constructions of Hartry Field. We try to explicate his notion of determinate truth by clarifying the path-dependent hierarchies of his determinateness operator.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • Field’s Saving Truth From Paradox: Some Things It Doesn’T Do.Donald A. Martin - 2011 - Review of Symbolic Logic 4 (3):339-347.
    I will discuss Fields Outline of a Theory of Truth. I will point out important properties of Kripkeleast fixed points constructions and theory. I do this not to demean Field’s superb work on truth but rather to suggest that there may be no really satisfactory conditional connective for languages containing their own truth predicates.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  • Some Observations on Truth Hierarchies.P. D. Welch - 2014 - Review of Symbolic Logic 7 (1):1-30.
  • Periodicity and Reflexivity in Revision Sequences.Edoardo Rivello - 2015 - Studia Logica 103 (6):1279-1302.
    Revision sequences were introduced in 1982 by Herzberger and Gupta as a mathematical tool in formalising their respective theories of truth. Since then, revision has developed in a method of analysis of theoretical concepts with several applications in other areas of logic and philosophy. Revision sequences are usually formalised as ordinal-length sequences of objects of some sort. A common idea of revision process is shared by all revision theories but specific proposals can differ in the so-called limit rule, namely the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Paradoxes and Contemporary Logic.Andrea Cantini - 2008 - Stanford Encyclopedia of Philosophy.