Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic

Mathematical Logic Quarterly 41 (4):515-522 (1995)
  Copy   BIBTEX

Abstract

We show that that every countable model of PA has a conservative extension M with a subset Y such that a certain Σ1(Y)-formula defines in M a subset which is not r. e. relative to Y.

Categories

Keywords

Reprint years

DOI

10.1002/malq.19950410408

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,672

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Four Problems Concerning Recursively Saturated Models of Arithmetic.Roman Kossak - 1995 - Notre Dame Journal of Formal Logic 36 (4):519-530.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic.Albert Visser - 1984 - Journal of Philosophical Logic 13 (1):97 - 113.
Nonstandard models that are definable in models of Peano Arithmetic.Kazuma Ikeda & Akito Tsuboi - 2007 - Mathematical Logic Quarterly 53 (1):27-37.
Definable sets and expansions of models of Peano arithmetic.Roman Murawski - 1988 - Archive for Mathematical Logic 27 (1):21-33.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
Automorphisms of Countable Short Recursively Saturated Models of PA.Erez Shochat - 2008 - Notre Dame Journal of Formal Logic 49 (4):345-360.
Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of peano arithmetic.Robert A. di Paola & Franco Montagna - 1991 - Journal of Symbolic Logic 56 (2):643-660.
Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of peano arithmetic.Robert A. Di Paola & Franco Montagna - 1991 - Journal of Symbolic Logic 56 (2):643 - 660.
Complete, Recursively Enumerable Relations in Arithmetic.Giovanna D'Agostino & Mario Magnago - 1995 - Mathematical Logic Quarterly 41 (1):65-72.
Some remarks on initial segments in models of peano arithmetic.Henryk Kotlarski - 1984 - Journal of Symbolic Logic 49 (3):955-960.
The complexity of classification problems for models of arithmetic.Samuel Coskey & Roman Kossak - 2010 - Bulletin of Symbolic Logic 16 (3):345-358.
Torre models in the isols.Joseph Barback - 1994 - Journal of Symbolic Logic 59 (1):140-150.
On the orbits of hyperhypersimple sets.Wolfgang Maass - 1984 - Journal of Symbolic Logic 49 (1):51-62.

Analytics

Added to PP
2014-01-16

Downloads
16 (#902,419)

6 months
3 (#962,988)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Models and types of Peano's arithmetic.Haim Gaifman - 1976 - Annals of Mathematical Logic 9 (3):223-306.
Models of Peano Arithmetic.Richard Kaye - 1991 - Clarendon Press.
Finite injury and Σ1-induction.Michael Mytilinaios - 1989 - Journal of Symbolic Logic 54 (1):38 - 49.

View all 8 references / Add more references