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

Grzegorz J. Michalski

Research output: Contribution to journalArticlepeer-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 languageAmerican English
JournalMathematical Logic Quarterly
Volume41
DOIs
StatePublished - 1995

Keywords

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

DC Disciplines

  • Mathematics

Cite this