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

Grzegorz J. Michalski

doi:10.1002/malq.19950410408

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

Grzegorz J. Michalski

Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	515-522
Number of pages	8
Journal	Mathematical Logic Quarterly
Volume	41
Issue number	4
DOIs	https://doi.org/10.1002/malq.19950410408
State	Published - 1995

Scopus Subject Areas

Logic

Keywords

Forcing
Models of Peano Arithmetic
Recursively enumerable
Σ definable

Access to Document

10.1002/malq.19950410408License: Unspecified

Cite this

@article{fa17c1fbc8dd45189ffd76652cff3ae5,

title = "Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic",

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.",

keywords = "Forcing, Models of Peano Arithmetic, Recursively enumerable, Σ definable",

author = "Michalski, \{Grzegorz J.\}",

note = "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.",

year = "1995",

doi = "10.1002/malq.19950410408",

language = "English",

volume = "41",

pages = "515--522",

journal = "Mathematical Logic Quarterly",

issn = "0942-5616",

publisher = "Wiley-VCH Verlag",

number = "4",

}

TY - JOUR

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

AU - Michalski, Grzegorz J.

N1 - 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.

PY - 1995

Y1 - 1995

N2 - 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.

AB - 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.

KW - Forcing

KW - Models of Peano Arithmetic

KW - Recursively enumerable

KW - Σ definable

UR - http://www.scopus.com/inward/record.url?scp=84981420833&partnerID=8YFLogxK

U2 - 10.1002/malq.19950410408

DO - 10.1002/malq.19950410408

M3 - Article

SN - 0942-5616

VL - 41

SP - 515

EP - 522

JO - Mathematical Logic Quarterly

JF - Mathematical Logic Quarterly

IS - 4

ER -