The property “arithmetic-is-recursive” on a cone

DOI10.1142/S0219061321500215zbMath1497.03051OpenAlexW3109295781MaRDI QIDQ5163171

Noah Schweber, Uri Andrews, Matthew Harrison-Trainor

Publication date: 3 November 2021

Published in: Journal of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219061321500215

zbMATH Keywords

Vaught's conjecturecomputable structure theoryback-and-forth types

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Model theory of denumerable and separable structures (03C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Measuring complexities of classes of structures
• Labelling systems and r.e. structures
• Stability of recursive structures in arithmetical degrees
• Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures
• Computable structures and the hyperarithmetical hierarchy
• A computability theoretic equivalent to Vaught's conjecture
• Counting the back-and-forth types
• Lectures on Infinitary Model Theory
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees
• Degrees of categoricity above limit ordinals

This page was built for publication: The property “arithmetic-is-recursive” on a cone