Four problems concerning recursively saturated models of arithmetic (Q1913627)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Four problems concerning recursively saturated models of arithmetic |
scientific article; zbMATH DE number 881254
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Four problems concerning recursively saturated models of arithmetic |
scientific article; zbMATH DE number 881254 |
Statements
Four problems concerning recursively saturated models of arithmetic (English)
0 references
22 May 1996
0 references
The paper presents four open problems. One concerns a possible converse to Tarski's undefinability of truth theorem, and is of general character. The other three are more specific. The questions are about some special \(\omega_1\)-like models, initial segments of countable recursively saturated models of PA, and about extendability of automorphisms. In each case a partial answer is given. All partial solutions are based on applications of inductive satisfaction classes.
0 references
Peano arithmetic
0 references
recursive saturation
0 references
open problems
0 references
recursively saturated models of PA
0 references
extendability of automorphisms
0 references
inductive satisfaction classes
0 references
0 references
