Inseparability in recursive copies (Q1326768): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0168-0072(94)90046-9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1970423298 / rank | |||
Normal rank |
Revision as of 23:41, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Inseparability in recursive copies |
scientific article |
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