Definable sets and expansions of models of Peano arithmetic
type: Item
instance of: scholarly article
title: Definable sets and expansions of models of Peano arithmetic
zbMATH Open document ID: 0645.03031
DOI: 10.1007/BF01625830
published in: Archive for Mathematical Logic
publication date: 1988-01-01T00:00:00Z
review text: Let T denote the fragment of the second order arithmetic \(A_ 2\) consisting of the \(\Delta^ 1_ 1\)-comprehension scheme and the \(\Sigma^ 1_ 1\)-axiom of choice (together with the induction and extensionality axioms). By a classical result of Barwise and Schlipf a nonstandard model M of PA is expandable to a model of T iff M is recursively saturated. The expansion of a recursively saturated model M in the above result is given by the family of subsets of M which are definable over M with parameters. Murawski generalizes this using a notion of nonstandard definability for nonstandard countable models of PA which have full inductive satisfaction classes (such models must be recursively saturated, but not every countable recursively saturated model has such a class). It is shown that if I is an nonstandard initial segment (satisfying a certain closure property) of a countable model M and S is a full inductive satisfaction class of M, then the family of subsets of M which are definable in M (in the sense of S) by formulas from I from an expansion of M to a model of T. Satisfaction classes which differ on formulas from I provide incompatible expansions, and since every countable model with a full inductive satisfaction class has an elementary extension with continuum many such classes which do not agree on formulas from I it follows that there are countable models with rich families of noncompatible expansions to models of T. Other constructions using nonstandard definability are also considered. There seems to be a gap in the proof of theorem 12 (in which existence of extensions with many satisfaction classes is proven), namely it is not quite clear why the constructed model \(M_ 1\) should be countable.
Mathematics Subject Classification ID: 03C62
Mathematics Subject Classification ID: 03H15
zbMATH DE Number: 4051586
zbMATH Keywords: Peano arithmetic
zbMATH Keywords: expandability
zbMATH Keywords: nonstandard model
zbMATH Keywords: recursively saturated model
zbMATH Keywords: nonstandard definability
zbMATH Keywords: countable models
zbMATH Keywords: satisfaction classes
author: Roman Murawski
reviewed by: Roman Kossak
MaRDI profile type: Publication
cites work: Second order arithmetic and related topics
cites work: Q4110995
cites work: Mutually generic classes and incompatible expansions
cites work: Q4138726
cites work: Indicators, recursive saturation and expandability
cites work: On elementary cuts in recursively saturated models of Peano Arithmetic
cites work: Q4105670
cites work: On expandability of models of Peano arithmetic. I
cites work: Some Remarks on the Structure of Expansions
cites work: Q3679181
cites work: Pointwise definable substructures of models of Peano arithmetic
cites work: Toward model theory through recursive saturation
full work available at URL: https://doi.org/10.1007/bf01625830
OpenAlex ID: W2059930981
Recommended article: Appendix to the paper ``Definable sets and expansions of models of Peano arithmetic''
Recommended article: On expandability of models of Peano arithmetic to models of the alternative set theory
Recommended article: Q3757918
Recommended article: Pointwise definable substructures of models of Peano arithmetic
Recommended article: Nonstandard models that are definable in models of Peano Arithmetic
Recommended article: Submodels and definable points in models of Peano arithmetic
Recommended article: Model-theoretic properties characterizing Peano arithmetic
Recommended article: On expandability of models of Peano arithmetic. III
Recommended article: Pointwise definable models of set theory
Recommended article: Q3342542
description: scientific article; zbMATH DE number 4051586