Inseparability in recursive copies
From MaRDI portal
Publication:1326768
DOI10.1016/0168-0072(94)90046-9zbMath0804.03022OpenAlexW1970423298MaRDI QIDQ1326768
Publication date: 24 January 1995
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(94)90046-9
Boolean algebrasorderingsisomorphism typesvector spacesarithmetical propertiesrecursive modelshyperarithmetical propertiesinfinitary decidability conditions
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Unnamed Item
- Unnamed Item
- Pairs of recursive structures
- Labelling systems and r.e. structures
- Stability of recursive structures in arithmetical degrees
- Intrinsically \(\Sigma ^ 0_{\alpha}\) relations
- Strong and weak constructivization and computable families
- Categoricity in hyperarithmetical degrees
- Model theory for infinitary logic. Logic with countable conjunctions and finite quantifiers
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- A construction for recursive linear orderings