Switch to: References

Add citations

You must login to add citations.
  1. Unrevisability.Christopher S. Hill - 2019 - Synthese 198 (4):3015-3031.
    Opposing Quine, I defend the view that some of the statements we accept are immune to empirical revision. My examples include instances of Schema and abbreviative definitions. I argue that it serves important cognitive purposes to hold statements of these kinds immune to revision, and that it is epistemically permissible for us to do so. At the end, I briefly consider the question of whether the rationale for these claims might be extended to show that additional statements are unrevisable.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • Intersubstitutivity Principles and the Generalization Function of Truth.Anil Gupta & Shawn Standefer - 2018 - Synthese 195 (3):1065-1075.
    We offer a defense of one aspect of Paul Horwich’s response to the Liar paradox—more specifically, of his move to preserve classical logic. Horwich’s response requires that the full intersubstitutivity of ‘ ‘A’ is true’ and A be abandoned. It is thus open to the objection, due to Hartry Field, that it undermines the generalization function of truth. We defend Horwich’s move by isolating the grade of intersubstitutivity required by the generalization function and by providing a new reading of the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • HYPE: A System of Hyperintensional Logic.Hannes Leitgeb - 2019 - Journal of Philosophical Logic 48 (2):305-405.
    This article introduces, studies, and applies a new system of logic which is called ‘HYPE’. In HYPE, formulas are evaluated at states that may exhibit truth value gaps and truth value gluts. Simple and natural semantic rules for negation and the conditional operator are formulated based on an incompatibility relation and a partial fusion operation on states. The semantics is worked out in formal and philosophical detail, and a sound and complete axiomatization is provided both for the propositional and the (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   13 citations  
  • Truth, Predication and a Family of Contingent Paradoxes.Francesco Orilia & Gregory Landini - 2019 - Journal of Philosophical Logic 48 (1):113-136.
    In truth theory one aims at general formal laws governing the attribution of truth to statements. Gupta’s and Belnap’s revision-theoretic approach provides various well-motivated theories of truth, in particular T* and T#, which tame the Liar and related paradoxes without a Tarskian hierarchy of languages. In property theory, one similarly aims at general formal laws governing the predication of properties. To avoid Russell’s paradox in this area a recourse to type theory is still popular, as testified by recent work in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • Guest Editors’ Introduction.Riccardo Bruni & Shawn Standefer - 2019 - Journal of Philosophical Logic 48 (1):1-9.
  • Proof Theory for Functional Modal Logic.Shawn Standefer - 2018 - Studia Logica 106 (1):49-84.
    We present some proof-theoretic results for the normal modal logic whose characteristic axiom is \. We present a sequent system for this logic and a hypersequent system for its first-order form and show that these are equivalent to Hilbert-style axiomatizations. We show that the question of validity for these logics reduces to that of classical tautologyhood and first-order logical truth, respectively. We close by proving equivalences with a Fitch-style proof system for revision theory.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • Solovay-Type Theorems for Circular Definitions.Shawn Standefer - 2015 - Review of Symbolic Logic 8 (3):467-487.
    We present an extension of the basic revision theory of circular definitions with a unary operator, □. We present a Fitch-style proof system that is sound and complete with respect to the extended semantics. The logic of the box gives rise to a simple modal logic, and we relate provability in the extended proof system to this modal logic via a completeness theorem, using interpretations over circular definitions, analogous to Solovay’s completeness theorem forGLusing arithmetical interpretations. We adapt our proof to (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  • In Praise of a Logic of Definitions That Tolerates Ω‐Inconsistency.Anil Gupta - 2018 - Philosophical Issues 28 (1):176-195.
  • Paradoxes and Contemporary Logic.Andrea Cantini - 2008 - Stanford Encyclopedia of Philosophy.