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   16 citations  
  • On diophantine equations solvable in models of open induction.Margarita Otero - 1990 - Journal of Symbolic Logic 55 (2):779-786.
    We consider IOpen, the subsystem of PA (Peano Arithmetic) with the induction scheme restricted to quantifier-free formulas. We prove that each model of IOpen can be embedded in a model where the equation x 2 1 + x 2 2 + x 2 3 + x 2 4 = a has a solution. The main lemma states that there is no polynomial f(x,y) with coefficients in a (nonstandard) DOR M such that $|f(x,y)| for every (x,y) ∈ C, where C is (...)
    Download  
     
    Export citation  
     
    Bookmark   3 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  
  • 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  
  • Parameter-Free Universal Induction.Richard Kaye - 1989 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 35 (5):443-456.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Bounded existential induction.George Wilmers - 1985 - Journal of Symbolic Logic 50 (1):72-90.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Parameter‐Free Universal Induction.Richard Kaye - 1989 - Mathematical Logic Quarterly 35 (5):443-456.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Models of Open Induction.Margarita Otero - 1991
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Review: Ju. V. Matijasevic, A. Doohovskoy, Enumerable Sets are Diophantine. [REVIEW]Julia Robinson - 1972 - Journal of Symbolic Logic 37 (3):605-606.
    Download  
     
    Export citation  
     
    Bookmark   9 citations