Coding and definability in computable structures

DOI10.1215/00294527-2017-0032zbMath1455.03056OpenAlexW2800744666WikidataQ129898768 ScholiaQ129898768MaRDI QIDQ1782235

Antonio Montalbán

Publication date: 19 September 2018

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1525140052

zbMATH Keywords

computable structure theoryback-and-forth relations

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (1)

Measuring complexities of classes of structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The jump operation for structure degrees
• Descriptive set theory
• Computable structures and the hyperarithmetical hierarchy
• Computable Boolean algebras
• Counting the back-and-forth types
• On the $n$-back-and-forth types of Boolean algebras
• Notes on the Jump of a Structure
• A Jump Inversion Theorem for the Degree Spectra
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• Degrees coded in jumps of orderings
• Every Low Boolean Algebra is Isomorphic to a Recursive One
• Boolean algebras, Stone spaces, and the iterated Turing jump
• Degrees of Structures
• Every Low 2 Boolean Algebra has a Recursive Copy
• Δ 2 0 -copies of linear orderings
• Arithmetical Reducibilities I

This page was built for publication: Coding and definability in computable structures