Journal of Symbolic Logic

Isomorphism of computable structures and Vaught's Conjecture

Howard Becker

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

The following question is open: Does there exist a hyperarithmetic class of computable structures with exactly one non-hyperarithmetic isomorphism-type? Given any oracle $a \in 2^\omega$, we can ask the same question relativized to $a$. A negative answer for every $a$ implies Vaught's Conjecture for $L_{\omega_1 \omega}$.

Article information

Source
J. Symbolic Logic, Volume 78, Issue 4 (2013), 1328-1344.

Dates
First available in Project Euclid: 5 January 2014

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1388954009

Digital Object Identifier
doi:10.2178/jsl.7804180

Mathematical Reviews number (MathSciNet)
MR3156527

Zentralblatt MATH identifier
1349.03035

Subjects
Primary: 03C57: Effective and recursion-theoretic model theory [See also 03D45] 03D45: Theory of numerations, effectively presented structures [See also 03C57; for intuitionistic and similar approaches see 03F55] 03E15: Descriptive set theory [See also 28A05, 54H05]

Citation

Becker, Howard. Isomorphism of computable structures and Vaught's Conjecture. J. Symbolic Logic 78 (2013), no. 4, 1328--1344. doi:10.2178/jsl.7804180. https://projecteuclid.org/euclid.jsl/1388954009


Export citation