Citations of work:

John P. Burgess (1986). The Truth is Never Simple.

28 found
Order:
Are we missing citations?

PhilPapers citations & references are currently in beta testing. We expect to add many more in the future.

Meanwhile, you can use our bibliography tool to import references for this or another work.

Or you can directly add citations for the above work:

Search for work by author name and title
Add directly by record ID

  1.  6
    Guest Editors’ Introduction.Riccardo Bruni & Shawn Standefer - forthcoming - Journal of Philosophical Logic:1-9.
  2.  5
    Revision Without Revision Sequences: Self-Referential Truth.Edoardo Rivello - forthcoming - Journal of Philosophical Logic:1-29.
    The model of self-referential truth presented in this paper, named Revision-theoretic supervaluation, aims to incorporate the philosophical insights of Gupta and Belnap’s Revision Theory of Truth into the formal framework of Kripkean fixed-point semantics. In Kripke-style theories the final set of grounded true sentences can be reached from below along a strictly increasing sequence of sets of grounded true sentences: in this sense, each stage of the construction can be viewed as an improvement on the previous ones. I want to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  3.  26
    How to Find an Attractive Solution to the Liar Paradox.Mark Pinder - 2018 - Philosophical Studies 175 (7):1661-1680.
    The general thesis of this paper is that metasemantic theories can play a central role in determining the correct solution to the liar paradox. I argue for the thesis by providing a specific example. I show how Lewis’s reference-magnetic metasemantic theory may decide between two of the most influential solutions to the liar paradox: Kripke’s minimal fixed point theory of truth and Gupta and Belnap’s revision theory of truth. In particular, I suggest that Lewis’s metasemantic theory favours Kripke’s solution to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  4.  15
    Some Notes on Truths and Comprehension.Thomas Schindler - 2018 - Journal of Philosophical Logic 47 (3):449-479.
    In this paper we study several translations that map models and formulae of the language of second-order arithmetic to models and formulae of the language of truth. These translations are useful because they allow us to exploit results from the extensive literature on arithmetic to study the notion of truth. Our purpose is to present these connections in a systematic way, generalize some well-known results in this area, and to provide a number of new results. Sections 3 and 4 contain (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  5.  13
    Supervaluation-Style Truth Without Supervaluations.Johannes Stern - 2018 - Journal of Philosophical Logic 47 (5):817-850.
    Kripke’s theory of truth is arguably the most influential approach to self-referential truth and the semantic paradoxes. The use of a partial evaluation scheme is crucial to the theory and the most prominent schemes that are adopted are the strong Kleene and the supervaluation scheme. The strong Kleene scheme is attractive because it ensures the compositionality of the notion of truth. But under the strong Kleene scheme classical tautologies do not, in general, turn out to be true and, as a (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  6.  6
    Truth, Partial Logic and Infinitary Proof Systems.Fischer Martin & Gratzl Norbert - 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 (3 more)  
     
    Export citation  
     
    Bookmark  
  7. Conditionals in Theories of Truth.Anil Gupta & Shawn Standefer - 2017 - Journal of Philosophical Logic 46 (1):27-63.
    We argue that distinct conditionals—conditionals that are governed by different logics—are needed to formalize the rules of Truth Introduction and Truth Elimination. We show that revision theory, when enriched with the new conditionals, yields an attractive theory of truth. We go on to compare this theory with one recently proposed by Hartry Field.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  8.  14
    Notes on the Computational Aspects of Kripke’s Theory of Truth.Stanislav O. Speranski - 2017 - Studia Logica 105 (2):407-429.
    The paper contains a survey on the complexity of various truth hierarchies arising in Kripke’s theory. I present some new arguments, and use them to obtain a number of interesting generalisations of known results. These arguments are both relatively simple, involving only the basic machinery of constructive ordinals, and very general.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  9.  65
    Axiomatizing Semantic Theories of Truth?Martin Fischer, Volker Halbach, Jönne Kriener & Johannes Stern - 2015 - Review of Symbolic Logic 8 (2):257-278.
    We discuss the interplay between the axiomatic and the semantic approach to truth. Often, semantic constructions have guided the development of axiomatic theories and certain axiomatic theories have been claimed to capture a semantic construction. We ask under which conditions an axiomatic theory captures a semantic construction. After discussing some potential criteria, we focus on the criterion of ℕ-categoricity and discuss its usefulness and limits.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  10.  67
    One Hundred Years of Semantic Paradox.Leon Horsten - 2015 - Journal of Philosophical Logic:1-15.
    This article contains an overview of the main problems, themes and theories relating to the semantic paradoxes in the twentieth century. From this historical overview I tentatively draw some lessons about the way in which the field may evolve in the next decade.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  11.  28
    Infinitary Tableau for Semantic Truth.Toby Meadows - 2015 - Review of Symbolic Logic 8 (2):207-235.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  12.  7
    Cofinally Invariant Sequences and Revision.Edoardo Rivello - 2015 - Studia Logica 103 (3):599-622.
    Revision sequences are a kind of transfinite sequences which were introduced by Herzberger and Gupta in 1982 as the main mathematical tool for developing their respective revision theories of truth. We generalise revision sequences to the notion of cofinally invariant sequences, showing that several known facts about Herzberger’s and Gupta’s theories also hold for this more abstract kind of sequences and providing new and more informative proofs of the old results.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  13.  23
    A Disquotational Theory of Truth as Strong as Z 2 −.Thomas Schindler - 2015 - Journal of Philosophical Logic 44 (4):395-410.
    T-biconditionals have often been regarded as insufficient as axioms for truth. This verdict is based on Tarski’s observation that the typed T-sentences suffer from deductive weakness. As indicated by McGee, the situation might change radically if we consider type-free disquotational theories of truth. However, finding a well-motivated set of untyped T-biconditionals that is consistent and recursively enumerable has proven to be very difficult. Moreover, some authors ) have argued that any solution to the semantic paradoxes necessarily involves ‘inflationary’ means, thus (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  23
    Self-Reference in Arithmetic II.Volker Halbach & Albert Visser - 2014 - Review of Symbolic Logic 7 (4):692-712.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  15.  10
    Some Observations on Truth Hierarchies.P. D. Welch - 2014 - Review of Symbolic Logic 7 (1):1-30.
  16.  59
    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 (8 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  17. More on 'A Liar Paradox'.Richard Heck - 2012 - Thought: A Journal of Philosophy 1 (4):270-280.
    A reply to two responses to an earlier paper, "A Liar Paradox".
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  18.  50
    Revision Revisited.Leon Horsten, Graham E. Leigh, Hannes Leitgeb & Philip Welch - 2012 - Review of Symbolic Logic 5 (4):642-664.
    This article explores ways in which the Revision Theory of Truth can be expressed in the object language. In particular, we investigate the extent to which semantic deficiency, stable truth, and nearly stable truth can be so expressed, and we study different axiomatic systems for the Revision Theory of Truth.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  19.  21
    A Note on Theories for Quasi-Inductive Definitions.Riccardo Bruni - 2009 - Review of Symbolic Logic 2 (4):684-699.
    This paper introduces theories for arithmetical quasi-inductive definitions (Burgess, 1986) as it has been done for first-order monotone and nonmonotone inductive ones. After displaying the basic axiomatic framework, we provide some initial result in the proof theoretic bounds line of research (the upper one being given in terms of a theory of sets extending Kripke–Platek set theory).
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  20.  70
    The Undecidability of Propositional Adaptive Logic.Leon Horsten & Philip Welch - 2007 - Synthese 158 (1):41-60.
    We investigate and classify the notion of final derivability of two basic inconsistency-adaptive logics. Specifically, the maximal complexity of the set of final consequences of decidable sets of premises formulated in the language of propositional logic is described. Our results show that taking the consequences of a decidable propositional theory is a complicated operation. The set of final consequences according to either the Reliability Calculus or the Minimal Abnormality Calculus of a decidable propositional premise set is in general undecidable, and (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  21.  25
    Comparing Inductive and Circular Definitions: Parameters, Complexity and Games.Kai-Uwe Kühnberger, Benedikt Löwe, Michael Möllerfeld & Philip Welch - 2005 - Studia Logica 81 (1):79 - 98.
    Gupta-Belnap-style circular definitions use all real numbers as possible starting points of revision sequences. In that sense they are boldface definitions. We discuss lightface versions of circular definitions and boldface versions of inductive definitions.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  22. A Contextual-Hierarchical Approach to Truth and the Liar Paradox.Michael Glanzberg - 2004 - Journal of Philosophical Logic 33 (1):27-88.
    This paper presents an approach to truth and the Liar paradox which combines elements of context dependence and hierarchy. This approach is developed formally, using the techniques of model theory in admissible sets. Special attention is paid to showing how starting with some ideas about context drawn from linguistics and philosophy of language, we can see the Liar sentence to be context dependent. Once this context dependence is properly understood, it is argued, a hierarchical structure emerges which is neither ad (...)
    Direct download (10 more)  
     
    Export citation  
     
    Bookmark   32 citations  
  23.  97
    Possible-Worlds Semantics for Modal Notions Conceived as Predicates.Volker Halbach, Hannes Leitgeb & Philip Welch - 2003 - Journal of Philosophical Logic 32 (2):179-223.
    If □ is conceived as an operator, i.e., an expression that gives applied to a formula another formula, the expressive power of the language is severely restricted when compared to a language where □ is conceived as a predicate, i.e., an expression that yields a formula if it is applied to a term. This consideration favours the predicate approach. The predicate view, however, is threatened mainly by two problems: Some obvious predicate systems are inconsistent, and possible-worlds semantics for predicates of (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  24.  5
    2002 Spring Meeting of the Association for Symbolic Logic.Paolo Mancosu - 2002 - Bulletin of Symbolic Logic 8 (3):446-451.
  25.  32
    On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and the Next Stable Set.P. D. Welch - 2001 - Bulletin of Symbolic Logic 7 (3):345-360.
    We consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using their theory of circular definitions as those notions universally definable over the next stable set. We give a simplified account of varied revision sequences-as a generalised algorithmic theory of truth. This enables something of a unification with the Kripkean theory of truth using supervaluation schemes.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  26.  87
    Tarskian and Kripkean Truth.Volker Halbach - 1997 - Journal of Philosophical Logic 26 (1):69-80.
    A theory of the transfinite Tarskian hierarchy of languages is outlined and compared to a notion of partial truth by Kripke. It is shown that the hierarchy can be embedded into Kripke's minimal fixed point model. From this results on the expressive power of both approaches are obtained.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  27.  63
    Tarski Hierarchies.Volker Halbach - 1995 - Erkenntnis 43 (3):339 - 367.
    The general notions of object- and metalanguage are discussed and as a special case of this relation an arbitrary first order language with an infinite model is expanded by a predicate symbol T0 which is interpreted as truth predicate for . Then the expanded language is again augmented by a new truth predicate T1 for the whole language plus T0. This process is iterated into the transfinite to obtain the Tarskian hierarchy of languages. It is shown that there are natural (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  28.  11
    A Theory of Truth Based on a Medieval Solution to the Liar Paradox.Richard L. Epstein - 1992 - History and Philosophy of Logic 13 (2):149-177.