Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 58, Number 1 (2017), 97-105.
Strange Structures from Computable Model Theory
Let be a countable language, let be an isomorphism-type of countable -structures, and let . We say that is -strange if it contains a computable-from- structure and its Scott rank is exactly . For all , -strange structures exist. Theorem (AD): If is a collection of isomorphism-types of countable structures, then for a Turing cone of ’s, no member of is -strange.
Notre Dame J. Formal Logic, Volume 58, Number 1 (2017), 97-105.
Received: 21 July 2013
Accepted: 23 March 2014
First available in Project Euclid: 17 November 2016
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 03C57: Effective and recursion-theoretic model theory [See also 03D45]
Secondary: 03D45: Theory of numerations, effectively presented structures [See also 03C57; for intuitionistic and similar approaches see 03F55] 03E60: Determinacy principles
Becker, Howard. Strange Structures from Computable Model Theory. Notre Dame J. Formal Logic 58 (2017), no. 1, 97--105. doi:10.1215/00294527-3767941. https://projecteuclid.org/euclid.ndjfl/1479351686