Numberings and definability in the hereditarily finite superstructure of a model (Q1307172)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Numberings and definability in the hereditarily finite superstructure of a model |
scientific article |
Statements
Numberings and definability in the hereditarily finite superstructure of a model (English)
0 references
28 October 1999
0 references
A model \(M\) is said to be \(\Sigma\)-definable over an admissible set \(A\) provided it is isomorphic to a model whose basic set is a quotient of a \(\Sigma\)-subset of \(A\) modulo a \(\Delta\)-equivalence and all predicates and functions are \(\Sigma\)-definable modulo this quotient along with their complements. If a model possesses a \(\Sigma\)-definable numbering, it is called \(\Sigma\)-enumerable or internally enumerable. The author proves a natural criterion for \(\Sigma\)-definability of a model in the hereditarily finite superstructure over another internally enumerable model. He also proves that, if a countable superatomic Boolean algebra is \(\Sigma\)-definable over a hereditarily finite superstructure of an internally enumerable model, then its ordinal type is also \(\Sigma\)-definable over it. The same result is proven for reduced Abelian groups and their Ulm types. The article under review is a translation of Vychisl. Sist. 156, 44-58 (1996; Zbl 0902.03030).
0 references
relative recursiveness
0 references
numeration
0 references
admissible set
0 references
constructivization
0 references
finitely generated algebra
0 references
\(\Sigma\)-enumerable model
0 references
\(\Sigma\)-enumeration
0 references
\(\Sigma\)-definable numbering
0 references
\(\Sigma\)-definability
0 references
hereditarily finite superstructure
0 references
internally enumerable model
0 references
superatomic Boolean algebra
0 references
ordinal type
0 references
reduced Abelian groups
0 references
Ulm types
0 references