Four problems concerning recursively saturated models of arithmetic

DOI10.1305/ndjfl/1040136913zbMath0848.03016OpenAlexW2090746463MaRDI QIDQ1913627

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

Peano arithmeticopen problemsrecursive saturationrecursively saturated models of PAextendability of automorphismsinductive satisfaction classes

Mathematics Subject Classification ID

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

Related Items (2)

Undefinability of truth and nonstandard models ⋮ Truth in generic cuts

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on initial segment constructions in recursively saturated models of arithmetic
• Elementary extensions of recursively saturated models of arithmetic
• Automorphisms of recursively saturated models of arithmetic
• Full satisfaction classes: A survey
• Minimal satisfaction classes with an application to rigid models of Peano arithmetic
• On maximal subgroups of the automorphism group of a countable recursively saturated model of PA
• A certain class of models of Peano arithmetic
• Results on automorphisms of recursively saturated models of PA
• Models and types of Peano's arithmetic
• Hanf numbers for omitting types over particular theories

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