A computability theoretic equivalent to Vaught's conjecture

DOI10.1016/j.aim.2012.11.012zbMath1345.03055arXiv1206.5682OpenAlexW1970468839WikidataQ123252983 ScholiaQ123252983MaRDI QIDQ1941142

Antonio Montalbán

Publication date: 11 March 2013

Published in: Advances in Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

Vaught's conjecturehyperarithmetic

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Other Turing degree structures (03D28) Model theory of denumerable and separable structures (03C15)

Related Items (16)

Scott ranks of models of a theory ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ On a question of Kalimullin ⋮ A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory ⋮ The 𝜔-Vaught’s conjecture ⋮ The property “arithmetic-is-recursive” on a cone ⋮ Using computability to measure complexity of algebraic structures and classes of structures ⋮ Eliminating unbounded search in computable algebra ⋮ A recursion theoretic property of $\mathbf {\Sigma ^1_1}$ equivalence relations ⋮ Punctual definability on structures ⋮ CLASSES OF STRUCTURES WITH NO INTERMEDIATE ISOMORPHISM PROBLEMS ⋮ Decompositions of decidable abelian groups ⋮ Categorical linearly ordered structures ⋮ Degree-invariant, analytic equivalence relations without perfectly many classes ⋮ ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE ⋮ Point Degree Spectra of Represented Spaces

This page was built for publication: A computability theoretic equivalent to Vaught's conjecture