Hyperarithmetical relations in expansions of recursive structures
From MaRDI portal
Publication:1315834
DOI10.1016/0168-0072(94)90065-5zbMath0793.03039OpenAlexW2066233455WikidataQ126648915 ScholiaQ126648915MaRDI QIDQ1315834
Publication date: 17 April 1994
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)90065-5
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Labelling systems and r.e. structures
- Addendum to ``Countable algebra and set existence axioms
- Stability of recursive structures in arithmetical degrees
- Categoricity in hyperarithmetical degrees
- Effective procedures in field theory
- The first order properties of products of algebraic systems
- Definable Sets in Ordered Structures. III
- Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
- Definable Sets in Ordered Structures. I
- Definable Sets in Ordered Structures. II
- Effective content of field theory
- Relatively recursive expansions
- Mixed systems
- Computable Algebra, General Theory and Theory of Computable Fields