Switch to: Citations

Add references

You must login to add references.
  1. 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.
  • A relative consistency proof.Joseph R. Shoenfield - 1954 - Journal of Symbolic Logic 19 (1):21-28.
    LetCbe an axiom system formalized within the first order functional calculus, and letC′ be related toCas the Bernays-Gödel set theory is related to the Zermelo-Fraenkel set theory. Ilse Novak [5] and Mostowski [8] have shown that, ifCis consistent, thenC′ is consistent. Mostowski has also proved the stronger result that any theorem ofC′ which can be formalized inCis a theorem ofC.The proofs of Novak and Mostowski do not provide a direct method for obtaining a contradiction inCfrom a contradiction inC′. We could, (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   12 citations  
  • Solomon Feferman. Systems of predicative analysis. The journal of symbolic logic, Bd. 29 Heft 1 , S. 1–30.Kurt Schütte - 1966 - Journal of Symbolic Logic 31 (4):660.
  • Grundgesetze der Arithmetik I §§29‒32.Richard G. Heck - 1997 - Notre Dame Journal of Formal Logic 38 (3):437-474.
    Frege's intention in section 31 of Grundgesetze is to show that every well-formed expression in his formal system denotes. But it has been obscure why he wants to do this and how he intends to do it. It is argued here that, in large part, Frege's purpose is to show that the smooth breathing, from which names of value-ranges are formed, denotes; that his proof that his other primitive expressions denote is sound and anticipates Tarski's theory of truth; and that (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  • A minimal predicative set theory.Franco Montagna & Antonella Mancini - 1994 - Notre Dame Journal of Formal Logic 35 (2):186-203.
  • Systems of predicative analysis.Solomon Feferman - 1964 - Journal of Symbolic Logic 29 (1):1-30.
    This paper is divided into two parts. Part I provides a resumé of the evolution of the notion of predicativity. Part II describes our own work on the subject.Part I§1. Conceptions of sets.Statements about sets lie at the heart of most modern attempts to systematize all (or, at least, all known) mathematics. Technical and philosophical discussions concerning such systematizations and the underlying conceptions have thus occupied a considerable portion of the literature on the foundations of mathematics.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   114 citations  
  • Predicative foundations of arithmetic.Solomon Feferman & Geoffrey Hellman - 1995 - Journal of Philosophical Logic 24 (1):1 - 17.
  • Gödel's Second incompleteness theorem for Q.A. Bezboruah & J. C. Shepherdson - 1976 - Journal of Symbolic Logic 41 (2):503-512.
  • Interpretability of Robinson arithmetic in the ramified second-order theory of dense linear order.A. P. Hazen - 1991 - Notre Dame Journal of Formal Logic 33 (1):101-111.
  • Abstraction and computational complexity.D. Leivant - 1990 - Journal of Symbolic Logic 55:379-80.
  • On Unsolvable Mathematical Problems.L. Kalmár - 1949 - Proceedings of the Tenth International Congress of Philosophy 2:756-758.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   2 citations