"Relatively Recursively Enumerable vs. Relatively Σ1 in Models Of Peano Arithmetic" by Grzegorz J. Michalski

Selected Works of Grzegorz J. Michalski

Follow Contact

Article

Relatively Recursively Enumerable vs. Relatively Σ1 in Models Of Peano Arithmetic

Mathematical Logic Quarterly (1995)

Grzegorz J. Michalski, Georgia Southern University

Link Find in your library

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

Recursively enumerable,
Σ1 definable,
Models of Peano Arithmetic,
Forcing

Disciplines

Mathematics

Publication Date

1995

DOI

10.1002/malq.19950410408

Citation Information

Grzegorz J. Michalski. "Relatively Recursively Enumerable vs. Relatively Σ1 in Models Of Peano Arithmetic" Mathematical Logic Quarterly Vol. 41 Iss. 4 (1995) p. 515 - 522 ISSN: 1521-3870
Available at: http://works.bepress.com/grzegorz_michalski/3/