Results for '03B15'

8 found
Order:
  1. The Concept Horse is a Concept.Ansten Klev - 2018 - Review of Symbolic Logic 11 (3):547-572.
    I offer an analysis of the sentence "the concept horse is a concept". It will be argued that the grammatical subject of this sentence, "the concept horse", indeed refers to a concept, and not to an object, as Frege once held. The argument is based on a criterion of proper-namehood according to which an expression is a proper name if it is so rendered in Frege's ideography. The predicate "is a concept", on the other hand, should not be thought of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  2.  59
    Hilbert’s varepsilon -operator in intuitionistic type theories.John L. Bell - 1993 - Mathematical Logic Quarterly 39 (1):323--337.
    We investigate Hilbert’s varepsilon -calculus in the context of intuitionistic type theories, that is, within certain systems of intuitionistic higher-order logic. We determine the additional deductive strength conferred on an intuitionistic type theory by the adjunction of closed varepsilon -terms. We extend the usual topos semantics for type theories to the varepsilon -operator and prove a completeness theorem. The paper also contains a discussion of the concept of “partially defined‘ varepsilon -term. MSC: 03B15, 03B20, 03G30.
    Direct download  
     
    Export citation  
     
    Bookmark   7 citations  
  3.  95
    Carnap’s Defense of Impredicative Definitions.Vera Flocke - 2019 - Review of Symbolic Logic 12 (2):372-404.
    A definition of a property P is impredicative if it quantifies over a domain to which P belongs. Due to influential arguments by Ramsey and Gödel, impredicative mathematics is often thought to possess special metaphysical commitments. It seems that an impredicative definition of a property P does not have the intended meaning unless P already exists, suggesting that the existence of P cannot depend on its explicit definition. Carnap (1937 [1934], p. 164) argues, however, that accepting impredicative definitions amounts to (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  57
    A Contingent Russell's Paradox.Francesco Orilia - 1996 - Notre Dame Journal of Formal Logic 37 (1):105-111.
    It is shown that two formally consistent type-free second-order systems, due to Cocchiarella, and based on the notion of homogeneous stratification, are subject to a contingent version of Russell's paradox.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  5.  38
    Typical ambiguity and elementary equivalence.Daniel Dzierzgowski - 1993 - Mathematical Logic Quarterly 39 (1):436-446.
    A sentence of the usual language of set theory is said to be stratified if it is obtained by “erasing” type indices in a sentence of the language of Russell's Simple Theory of Types. In this paper we give an alternative presentation of a proof the ambiguity theorem stating that any provable stratified sentence has a stratified proof. To this end, we introduce a new set of ambiguity axioms, inspired by Fraïssé's characterization of elementary equivalence; these axioms can be naturally (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  6.  35
    A proof of the normal form theorem for the closed terms of Girard's system F by means of computability.Silvio Valentini - 1993 - Mathematical Logic Quarterly 39 (1):539-544.
    In this paper a proof of the normal form theorem for the closed terms of Girard's system F is given by using a computability method à la Tait. It is worth noting that most of the standard consequences of the normal form theorem can be obtained using this version of the theorem as well. From the proof-theoretical point of view the interest of the proof is that the definition of computable derivation here used does not seem to be well founded. (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  7.  64
    The Development of Gödel’s Ontological Proof.Annika Kanckos & Tim Lethen - 2021 - Review of Symbolic Logic 14 (4):1011-1029.
    Gödel’s ontological proof is by now well known based on the 1970 version, written in Gödel’s own hand, and Scott’s version of the proof. In this article new manuscript sources found in Gödel’s Nachlass are presented. Three versions of Gödel’s ontological proof have been transcribed, and completed from context as true to Gödel’s notes as possible. The discussion in this article is based on these new sources and reveals Gödel’s early intentions of a liberal comprehension principle for the higher order (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  8.  27
    Subsystems of Quine's "New Foundations" with Predicativity Restrictions.M. Randall Holmes - 1999 - Notre Dame Journal of Formal Logic 40 (2):183-196.
    This paper presents an exposition of subsystems and of Quine's , originally defined and shown to be consistent by Crabbé, along with related systems and of type theory. A proof that (and so ) interpret the ramified theory of types is presented (this is a simplified exposition of a result of Crabbé). The new result that the consistency strength of is the same as that of is demonstrated. It will also be shown that cannot be finitely axiomatized (as can and (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations