✦ LIBER ✦

Reflection Principles in Fragments of Peano Arithmetic

✍ Scribed by Hiroakira Ono

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 952 KB
Volume: 33
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.19870330407

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subrecursive degrees and fragments of Pe

Subrecursive degrees and fragments of Peano Arithmetic

✍ Lars Kristiansen 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 243 KB

The Pigeonhole Principle and Fragments o

The Pigeonhole Principle and Fragments of Arithmetic

✍ C. Dimitracopoulos; J. Paris 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 380 KB 👁 1 views

Interstitial and pseudo gaps in models o

Interstitial and pseudo gaps in models of Peano Arithmetic

✍ Ermek S. Nurkhaidarov 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB 👁 1 views

In this paper we study the automorphism groups of models of Peano Arithmetic. Kossak, Kotlarski, and Schmerl [9] shows that the stabilizer of an unbounded element a of a countable recursively saturated model of Peano Arithmetic M is a maximal subgroup of Aut(M ) if and only if the type of a is selec

The shortest definition of a number in P

The shortest definition of a number in Peano arithmetic

✍ Dev K. Roy 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 89 KB 👁 2 views

## Abstract The shortest definition of a number by a first order formula with one free variable, where the notion of a formula defining a number extends a notion used by Boolos in a proof of the Incompleteness Theorem, is shown to be non computable. This is followed by an examination of the complex

Nonstandard models that are definable in

Nonstandard models that are definable in models of Peano Arithmetic

✍ Kazuma Ikeda; Akito Tsuboi 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 183 KB

## Abstract In this paper, we investigate definable models of Peano Arithmetic PA in a model of PA. For any definable model __N__ without parameters in a model __M__, we show that __N__ is isomorphic to __M__ if __M__ is elementary extension of the standard model and __N__ is elementarily equivalen

Relatively Recursively Enumerable Versus

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

✍ Grzegorz Michalski 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB

## 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__.