CLASSES OF STRUCTURES WITH NO INTERMEDIATE ISOMORPHISM PROBLEMS

DOI10.1017/jsl.2014.55zbMath1436.03233arXiv1309.3815OpenAlexW2963890194MaRDI QIDQ2805027

Antonio Montalbán

Publication date: 9 May 2016

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.3815

zbMATH Keywords

equivalence relationsVaught's conjectureeffective reducibility

Mathematics Subject Classification ID

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

Related Items (2)

The 𝜔-Vaught’s conjecture ⋮ Using computability to measure complexity of algebraic structures and classes of structures

Cites Work

• Unnamed Item
• Unnamed Item
• The isomorphism problem for torsion-free abelian groups is analytic complete
• Bounds on weak scattering
• Countable admissible ordinals and hyperdegrees
• Theories of linear order
• Computable structures and the hyperarithmetical hierarchy
• A computability theoretic equivalent to Vaught's conjecture
• Equivalence Relations on Classes of Computable Structures
• On the Equimorphism Types of Linear Orderings
• Counting the number of equivalence classes of Borel and coanalytic equivalence relations
• Scott sentences and admissible sets
• The isomorphism relation on countable torsion free abelian groups

This page was built for publication: CLASSES OF STRUCTURES WITH NO INTERMEDIATE ISOMORPHISM PROBLEMS