Switch to: References

Add citations

You must login to add citations.
  1. A direct method for simulating partial recursive functions by Diophantine equations.Yuri Matiyasevich - 1994 - Annals of Pure and Applied Logic 67 (1-3):325-348.
    A new proof is given of the celebrated theorem of M. Davis, H. Putnam and J. Robinson concerning exponential Diophantine representation of recursively enumerable predicates. The proof goes by induction on the defining scheme of a partial recursive function.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  • Unifying the model theory of first-order and second-order arithmetic via WKL 0 ⁎.Ali Enayat & Tin Lok Wong - 2017 - Annals of Pure and Applied Logic 168 (6):1247-1283.
  • End Extensions of Models of Weak Arithmetic Theories.Costas Dimitracopoulos & Vasileios S. Paschalis - 2016 - Notre Dame Journal of Formal Logic 57 (2):181-193.
    We give alternative proofs of results due to Paris and Wilkie concerning the existence of end extensions of countable models of $B\Sigma_{1}$, that is, the theory of $\Sigma_{1}$ collection.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  • A contribution to the end-extension problem and the Π1 conservativeness problem.Zofia Adamowicz - 1993 - Annals of Pure and Applied Logic 61 (1-2):3-48.
    We formulate a Π1 sentence τ which is a version of the Tableau consistency of GlΔ0. The sentence τ is true and is provable in GlΔ0 + exp. We construct a model M of GlΔ0+Ω1+τ+BGs1 which has no proper end-extension to a model of GlΔ0+Ω1+τ. Also we prove that GlΔ0+Ω1+τ is not Π1 conservative over GlΔ0+τ.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   4 citations