Switch to: References

Add citations

You must login to add citations.
  1. Hilbert's Metamathematical Problems and Their Solutions.Besim Karakadilar - 2008 - Dissertation, Boston University
    This dissertation examines several of the problems that Hilbert discovered in the foundations of mathematics, from a metalogical perspective. The problems manifest themselves in four different aspects of Hilbert’s views: (i) Hilbert’s axiomatic approach to the foundations of mathematics; (ii) His response to criticisms of set theory; (iii) His response to intuitionist criticisms of classical mathematics; (iv) Hilbert’s contribution to the specification of the role of logical inference in mathematical reasoning. This dissertation argues that Hilbert’s axiomatic approach was guided primarily (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Independence friendly logic.Tero Tulenheimo - 2010 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Degrees of logics with Henkin quantifiers in poor vocabularies.Marcin Mostowski & Konrad Zdanowski - 2004 - Archive for Mathematical Logic 43 (5):691-702.
    We investigate some logics with Henkin quantifiers. For a given logic L, we consider questions of the form: what is the degree of the set of L–tautologies in a poor vocabulary (monadic or empty)? We prove that the set of tautologies of the logic with all Henkin quantifiers in empty vocabulary L*∅ is of degree 0’. We show that the same holds also for some weaker logics like L ∅(Hω) and L ∅(Eω). We show that each logic of the form (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On the logic of informational independence and its applications.Gabriel Sandu - 1993 - Journal of Philosophical Logic 22 (1):29 - 60.
    We shall introduce in this paper a language whose formulas will be interpreted by games of imperfect information. Such games will be defined in the same way as the games for first-order formulas except that the players do not have complete information of the earlier course of the game. Some simple logical properties of these games will be stated together with the relation of such games of imperfect information to higher-order logic. Finally, a set of applications will be outlined.
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • If-logic and truth-definition.Gabriel Sandu - 1998 - Journal of Philosophical Logic 27 (2):143-164.
    In this paper we show that first-order languages extended with partially ordered connectives and partially ordered quantifiers define, under a certain interpretation, their own truth-predicate. The interpretation in question is in terms of games of imperfect information. This result is compared with those of Kripke and Feferman.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Maximality of Logic Without Identity.Guillermo Badia, Xavier Caicedo & Carles Noguera - 2024 - Journal of Symbolic Logic 89 (1):147-162.
    Lindström’s theorem obviously fails as a characterization of first-order logic without identity ( $\mathcal {L}_{\omega \omega }^{-} $ ). In this note, we provide a fix: we show that $\mathcal {L}_{\omega \omega }^{-} $ is a maximal abstract logic satisfying a weak form of the isomorphism property (suitable for identity-free languages and studied in [11]), the Löwenheim–Skolem property, and compactness. Furthermore, we show that compactness can be replaced by being recursively enumerable for validity under certain conditions. In the proofs, we (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Boolean valued models and generalized quantifiers.Jouko Väänänen - 1980 - Annals of Mathematical Logic 18 (3):193-225.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Decidability problems in languages with Henkin quantifiers.Michał Krynicki & Marcin Mostowski - 1992 - Annals of Pure and Applied Logic 58 (2):149-172.
    Krynicki, M. and M. Mostowski, Decidability problems in languages with Henkin quantifiers, Annals of Pure and Applied Logic 58 149–172.We consider the language L with all Henkin quantifiers Hn defined as follows: Hnx1…xny1…yn φ iff f1…fnx1. ..xn φ, ...,fn). We show that the theory of equality in L is undecidable. The proof of this result goes by interpretation of the word problem for semigroups.Henkin quantifiers are strictly related to the function quantifiers Fn defined as follows: Fnx1…xny1…yn φ iff fx1…xn φ,...,f). (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Henkin and function quantifiers.Michael Krynicki & Jouko Väänänen - 1989 - Annals of Pure and Applied Logic 43 (3):273-292.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • The Henkin Quantifier and Real Closed Fields.John R. Cowles - 1981 - Mathematical Logic Quarterly 27 (31-35):549-555.
    Download  
     
    Export citation  
     
    Bookmark   2 citations