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  
  • Generalized Quantifiers in Dependence Logic.Fredrik Engström - 2012 - Journal of Logic, Language and Information 21 (3):299-324.
    We introduce generalized quantifiers, as defined in Tarskian semantics by Mostowski and Lindström, in logics whose semantics is based on teams instead of assignments, e.g., IF-logic and Dependence logic. Both the monotone and the non-monotone case is considered. It is argued that to handle quantifier scope dependencies of generalized quantifiers in a satisfying way the dependence atom in Dependence logic is not well suited and that the multivalued dependence atom is a better choice. This atom is in fact definably equivalent (...)
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Independence friendly logic.Tero Tulenheimo - 2010 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Partially ordered connectives and monadic monotone strict np.Lauri Hella, Merlijn Sevenster & Tero Tulenheimo - 2008 - Journal of Logic, Language and Information 17 (3):323-344.
    Motivated by constraint satisfaction problems, Feder and Vardi (SIAM Journal of Computing, 28, 57–104, 1998) set out to search for fragments of satisfying the dichotomy property: every problem definable in is either in P or else NP-complete. Feder and Vardi considered in this connection two logics, strict NP (or SNP) and monadic, monotone, strict NP without inequalities (or MMSNP). The former consists of formulas of the form , where is a quantifier-free formula in a relational vocabulary; and the latter is (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • Independence-friendly logic without Henkin quantification.Fausto Barbero, Lauri Hella & Raine Rönnholm - 2021 - Archive for Mathematical Logic 60 (5):547-597.
    We analyze the expressive resources of \ logic that do not stem from Henkin quantification. When one restricts attention to regular \ sentences, this amounts to the study of the fragment of \ logic which is individuated by the game-theoretical property of action recall. We prove that the fragment of prenex AR sentences can express all existential second-order properties. We then show that the same can be achieved in the non-prenex fragment of AR, by using “signalling by disjunction” instead of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Generalized quantifiers.Dag Westerståhl - 2008 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Truth and definite truth.Tapani Hyttinen & Gabriel Sandu - 2004 - Annals of Pure and Applied Logic 126 (1-3):49-55.
    In this paper we consider truth as a vague predicate and inquire into the relation between truth and definite truth. We use some tools from modal logic to clarify this distinction, as done in McGee . Finally, we consider the question whether some of the results given by McGee can be transferred to the case in which the underlying logic is stronger than first-order logic. The result will be seen to be negative.
    Download  
     
    Export citation  
     
    Bookmark