Switch to: Citations

Add references

You must login to add references.
  1. A Course in Mathematical Logic.I͡U. I. Manin, Jurij I. Manin, Yu I. Manin, ︠I︡U. I. Manin, Ûrij Ivanovič Manin, I︠U︡riĭ Ivanovich Manin & ëIìU. I. Manin - 1977 - Springer Verlag.
    Offers a text of mathematical logic on a sophisticated level, presenting the reader with several of the most significant discoveries, including the independence of the continuum hypothesis, the Diophantine nature of enumerable sets and the impossibility of finding an algorithmic solution for certain problems.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • Diophantine Induction.Richard Kaye - 1990 - Annals of Pure and Applied Logic 46 (1):1-40.
    We show that Matijasevič's Theorem on the diophantine representation of r.e. predicates is provable in the subsystem I ∃ - 1 of Peano Arithmetic formed by restricting the induction scheme to diophantine formulas with no parameters. More specifically, I ∃ - 1 ⊢ IE - 1 + E ⊢ Matijasevič's Theorem where IE - 1 is the scheme of parameter-free bounded existential induction and E is an ∀∃ axiom expressing the existence of a function of exponential growth. We conclude by (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Provability of the pigeonhole principle and the existence of infinitely many primes.J. B. Paris, A. J. Wilkie & A. R. Woods - 1988 - Journal of Symbolic Logic 53 (4):1235-1244.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
    Download  
     
    Export citation  
     
    Bookmark   90 citations  
  • A Non-Standard Model for a Free Variable Fragment of Number Theory.J. C. Shepherdson - 1965 - Journal of Symbolic Logic 30 (3):389-390.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Local behaviour of the chebyshev theorem in models of iδ.Paola D'Aquino - 1992 - Journal of Symbolic Logic 57 (1):12 - 27.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Existential Definability in Arithmetic.Julia Robinson - 1955 - Journal of Symbolic Logic 20 (2):182-183.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Bounded existential induction.George Wilmers - 1985 - Journal of Symbolic Logic 50 (1):72-90.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.
    Download  
     
    Export citation  
     
    Bookmark   96 citations