Hyperarithmetical relations in expansions of recursive structures

DOI10.1016/0168-0072(94)90065-5zbMATH Open0793.03039OpenAlexW2066233455WikidataQ126648915 ScholiaQ126648915MaRDI QIDQ1315834FDOQ1315834

Alan D. Vlach

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

zbMATH Keywords

recursive model theoryeffective mathematics

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Effective content of field theory
• Definable Sets in Ordered Structures. III
• Definable Sets in Ordered Structures. I
• Definable Sets in Ordered Structures. II
• Effective procedures in field theory
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Computable Algebra, General Theory and Theory of Computable Fields
• Addendum to ``Countable algebra and set existence axioms
• The first order properties of products of algebraic systems
• Categoricity in hyperarithmetical degrees
• Labelling systems and r.e. structures
• Stability of recursive structures in arithmetical degrees
• Relatively recursive expansions
• Mixed systems

Cited In (5)

• Recursion relations for double ramification hierarchies
• Transformations of expressions associated with systems of recursion relations
• Pairs of recursive structures
• Recursive expansions
• On a pair of hyperstandard reciprocal relations with applications

This page was built for publication: Hyperarithmetical relations in expansions of recursive structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315834)