Inseparability in recursive copies (Q1326768)
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: Inseparability in recursive copies |
scientific article; zbMATH DE number 584675
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Inseparability in recursive copies |
scientific article; zbMATH DE number 584675 |
Statements
Inseparability in recursive copies (English)
0 references
24 January 1995
0 references
The author continues the Ash programme of analysing (hyper)arithmetical properties of recursive models with respect to isomorphism types [e.g. \textit{C. J. Ash}, Trans. Am. Math. Soc. 298, 497-514 (1986; Zbl 0631.03017)]. The author looks at constructions which, subject to the usual sort of infinitary decidability conditions, allow one to find a copy of a recursive structure in which two given disjoint relations are \(\Delta^ 0_ \alpha\) separable. He applies the model-theoretical results to Boolean algebras, vector spaces and orderings.
0 references
arithmetical properties
0 references
hyperarithmetical properties
0 references
recursive models
0 references
isomorphism types
0 references
infinitary decidability conditions
0 references
Boolean algebras
0 references
vector spaces
0 references
orderings
0 references
0 references
0 references
0.7599367499351501
0 references
0.7599367499351501
0 references
0.7467042207717896
0 references
