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.

Other Versions

reprint Michalski, Grzegorz (2006) "Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic". Mathematical Logic Quarterly 41(4):515-522

Links

PhilArchive

External links

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

Through your library

Similar books and articles

Analytics

Added to PP
2014-01-16

Downloads
67 (#890,822)

6 months
19 (#603,192)

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

View all 7 references / Add more references