𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Discernible Elements in Models for Peano Arithmetic

✍ Scribed by Andrzej Ehrenfeucht


Book ID
124972371
Publisher
Association for Symbolic Logic
Year
1973
Tongue
English
Weight
96 KB
Volume
38
Category
Article
ISSN
0022-4812

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Nonstandard models that are definable in
✍ 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

Interstitial and pseudo gaps in models o
✍ 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

Relatively Recursively Enumerable Versus
✍ 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__.