Pages that link to "Item:Q1941142"
From MaRDI portal
The following pages link to A computability theoretic equivalent to Vaught's conjecture (Q1941142):
Displayed 16 items.
- Scott ranks of models of a theory (Q1644961) (← links)
- Eliminating unbounded search in computable algebra (Q2011637) (← links)
- Punctual definability on structures (Q2033006) (← links)
- Using computability to measure complexity of algebraic structures and classes of structures (Q2263109) (← links)
- Categorical linearly ordered structures (Q2311213) (← links)
- CLASSES OF STRUCTURES WITH NO INTERMEDIATE ISOMORPHISM PROBLEMS (Q2805027) (← links)
- Degree-invariant, analytic equivalence relations without perfectly many classes (Q2832838) (← links)
- On a question of Kalimullin (Q4563668) (← links)
- A recursion theoretic property of $\mathbf {\Sigma ^1_1}$ equivalence relations (Q4683538) (← links)
- AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS (Q5067872) (← links)
- A recursion theoretic characterization of the Topological Vaught Conjecture in the Zermelo‐Fraenkel set theory (Q5108130) (← links)
- The property “arithmetic-is-recursive” on a cone (Q5163171) (← links)
- Decompositions of decidable abelian groups (Q5216188) (← links)
- ANALYTIC EQUIVALENCE RELATIONS SATISFYING HYPERARITHMETIC-IS-RECURSIVE (Q5250130) (← links)
- Point Degree Spectra of Represented Spaces (Q5864311) (← links)
- The 𝜔-Vaught’s conjecture (Q6135821) (← links)