Switch to: Citations

Add references

You must login to add references.
  1. The Consistency of predicative fragments of frege’s grundgesetze der arithmetik.Richard G. Heck - 1996 - History and Philosophy of Logic 17 (1-2):209-220.
    As is well-known, the formal system in which Frege works in his Grundgesetze der Arithmetik is formally inconsistent, Russell’s Paradox being derivable in it.This system is, except for minor differ...
    Download  
     
    Export citation  
     
    Bookmark   60 citations  
  • Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.
    An introduction to the developments of nonstandard models. Beginning with Godel's incompleteness theorem, it covers the prime models, cofinal extensions, and extensions, Gaifman's construction of a definable type, Tennenbaum's theorem and Friedman's theorem on indicators, ending with a chapter on recursive saturation and resplendency.
    Download  
     
    Export citation  
     
    Bookmark   95 citations  
  • First-order Frege theory is undecidable.Warren Goldfarb - 2001 - Journal of Philosophical Logic 30 (6):613-616.
    The system whose only predicate is identity, whose only nonlogical vocabulary is the abstraction operator, and whose axioms are all first-order instances of Frege's Axiom V is shown to be undecidable.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Grundgesetze Der Arithmetik Vol. (Band 2).Friedrich Ludwig Gottlob Frege - 1903 - Jena: Verlag Hermann Pohle.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Grundgesetze Der Arithmetik Vol. (Band 1).Friedrich Ludwig Gottlob Frege - 1893 - Verlag Hermann Pohle.
    Download  
     
    Export citation  
     
    Bookmark   45 citations  
  • On the consistency of the first-order portion of Frege's logical system.Terence Parsons - 1987 - Notre Dame Journal of Formal Logic 28 (1):161-168.
    Download  
     
    Export citation  
     
    Bookmark   36 citations  
  • On a Consistent Subsystem of Frege's Grundgesetze.John P. Burgess - 1998 - Notre Dame Journal of Formal Logic 39 (2):274-278.
    Parsons has given a (nonconstructive) proof that the first-order fragment of the system of Frege's Grundgesetze is consistent. Here a constructive proof of the same result is presented.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • The Consistency of predicative fragments of frege's grundgesetze der arithmetik.Richard Heck Jnr - 1996 - History and Philosophy of Logic 17 (1 & 2):209-220.
    As is well-known, the formal system in which Frege works in his Grundgesetze der Arithmetik is formally inconsistent, Russell's Paradox being derivable in it.This system is, except for minor differences, full second-order logic, augmented by a single non-logical axiom, Frege's Axiom V. It has been known for some time now that the first-order fragment of the theory is consistent. The present paper establishes that both the simple and the ramified predicative second-order fragments are consistent, and that Robinson arithmetic, Q, is (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Consistent fragments of grundgesetze and the existence of non-logical objects.Kai F. Wehmeier - 1999 - Synthese 121 (3):309-328.
    In this paper, I consider two curious subsystems ofFrege's Grundgesetze der Arithmetik: Richard Heck's predicative fragment H, consisting of schema V together with predicative second-order comprehension (in a language containing a syntactical abstraction operator), and a theory T in monadic second-order logic, consisting of axiom V and 1 1-comprehension (in a language containing anabstraction function). I provide a consistency proof for the latter theory, thereby refuting a version of a conjecture by Heck. It is shown that both Heck and T (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations