Four problems concerning recursively saturated models of arithmetic

DOI10.1305/NDJFL/1040136913MaRDI QIDQ1913627zbMATH OpenOpenAlexFDO

Authors Roman Kossak

Publication date 22 May 1996

Published in Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1305/ndjfl/1040136913

zbMATH Keywords

extendability of automorphismsinductive satisfaction classesopen problemsPeano arithmeticrecursive saturationrecursively saturated models of PA

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Models of arithmetic and set theory (03C62)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 1222926
• GAME APPROXIMATIONS OF SATISFACTION CLASSES MODELS
• scientific article; zbMATH DE number 32280
• Recursively saturated \(\omega _ 1\)-like models of arithmetic

Cites work

• A certain class of models of Peano arithmetic
• A note on initial segment constructions in recursively saturated models of arithmetic
• Automorphisms of recursively saturated models of arithmetic
• Elementary extensions of recursively saturated models of arithmetic
• Full satisfaction classes: A survey
• Hanf numbers for omitting types over particular theories
• scientific article; zbMATH DE number 4010521 (Why is no real title available?)
• scientific article; zbMATH DE number 51556 (Why is no real title available?)
• scientific article; zbMATH DE number 3566838 (Why is no real title available?)
• Minimal satisfaction classes with an application to rigid models of Peano arithmetic
• Models and types of Peano's arithmetic
• On maximal subgroups of the automorphism group of a countable recursively saturated model of PA
• Results on automorphisms of recursively saturated models of PA

Cited in

(8)

• The complexity of classification problems for models of arithmetic
• Recursively saturated nonstandard models of arithmetic; addendum
• scientific article; zbMATH DE number 1222926 (Why is no real title available?)
• GAME APPROXIMATIONS OF SATISFACTION CLASSES MODELS
• scientific article; zbMATH DE number 1415871 (Why is no real title available?)
• Undefinability of truth and nonstandard models
• Truth in generic cuts
• Recursively saturated \(\omega _ 1\)-like models of arithmetic

This page was built for publication: Four problems concerning recursively saturated models of arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1913627)