Switch to: References

Add citations

You must login to add citations.
  1. Generalized Quantification in an Axiomatic Truth Theory.Ian Rumfitt - 2024 - Australasian Journal of Philosophy 102 (3):756-776.
    Bruno Whittle (2019) has recently extended Kripke’s semantical theory of truth to languages containing generalized quantifiers. There are reasons for axiomatizing semantical theories, and for regarding Halbach and Horsten’s PKF as a good axiomatization of Kripke’s. PKF is a theory in Partial Logic. The present paper complements Whittle’s by showing how Partial Logic, and then PKF, may be extended to cover binary quantifiers meaning ‘every’, ‘some’, and ‘most’.
    Download  
     
    Export citation  
     
    Bookmark  
  • Axiomatizing Kripke’s Theory of Truth.Volker Halbach & Leon Horsten - 2006 - Journal of Symbolic Logic 71 (2):677 - 712.
    We investigate axiomatizations of Kripke's theory of truth based on the Strong Kleene evaluation scheme for treating sentences lacking a truth value. Feferman's axiomatization KF formulated in classical logic is an indirect approach, because it is not sound with respect to Kripke's semantics in the straightforward sense: only the sentences that can be proved to be true in KF are valid in Kripke's partial models. Reinhardt proposed to focus just on the sentences that can be proved to be true in (...)
    Download  
     
    Export citation  
     
    Bookmark   76 citations  
  • Notes on Models of (Partial) Kripke–Feferman Truth.Luca Castaldo - 2023 - Studia Logica 111 (1):83-111.
    This article investigates models of axiomatizations related to the semantic conception of truth presented by Kripke (J Philos 72(19):690–716, 1975), the so-called _fixed-point semantics_. Among the various proof systems devised as a proof-theoretic characterization of the fixed-point semantics, in recent years two alternatives have received particular attention: _classical systems_ (i.e., systems based on classical logic) and _nonclassical systems_ (i.e., systems based on some nonclassical logic). The present article, building on Halbach and Nicolai (J Philos Log 47(2):227–257, 2018), shows that there (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A three-valued quantified argument calculus: Domain-free model-theory, completeness, and embedding of fol.Ran Lanzet - 2017 - Review of Symbolic Logic 10 (3):549-582.
    This paper presents an extended version of the Quantified Argument Calculus (Quarc). Quarc is a logic comparable to the first-order predicate calculus. It employs several nonstandard syntactic and semantic devices, which bring it closer to natural language in several respects. Most notably, quantifiers in this logic are attached to one-place predicates; the resulting quantified constructions are then allowed to occupy the argument places of predicates. The version presented here is capable of straightforwardly translating natural-language sentences involving defining clauses. A three-valued, (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations