Switch to: Citations

Add references

You must login to add references.
  1. 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   17 citations  
  • Local Behaviour of the Chebyshev Theorem in Models of $I\Delta_0$.Paola D'Aquino - 1992 - Journal of Symbolic Logic 57 (1):12-27.
    Download  
     
    Export citation  
     
    Bookmark   10 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   11 citations  
  • Bounded existential induction.George Wilmers - 1985 - Journal of Symbolic Logic 50 (1):72-90.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
    Let P 0 be the subsystem of Peano arithmetic obtained by restricting induction to bounded quantifier formulas. Let M be a countable, nonstandard model of P 0 whose domain we suppose to be the standard integers. Let T be a recursively enumerable extension of Peano arithmetic all of whose existential consequences are satisfied in the standard model. Then there is an initial segment M ' of M which is a model of T such that the complete diagram of M ' (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations