Translator Disclaimer
2017 Strange Structures from Computable Model Theory
Howard Becker
Notre Dame J. Formal Logic 58(1): 97-105 (2017). DOI: 10.1215/00294527-3767941

Abstract

Let L be a countable language, let I be an isomorphism-type of countable L-structures, and let a2ω. We say that I is a-strange if it contains a computable-from-a structure and its Scott rank is exactly ω1a. For all a, a-strange structures exist. Theorem (AD): If C is a collection of 1 isomorphism-types of countable structures, then for a Turing cone of a’s, no member of C is a-strange.

Citation

Download Citation

Howard Becker. "Strange Structures from Computable Model Theory." Notre Dame J. Formal Logic 58 (1) 97 - 105, 2017. https://doi.org/10.1215/00294527-3767941

Information

Received: 21 July 2013; Accepted: 23 March 2014; Published: 2017
First available in Project Euclid: 17 November 2016

zbMATH: 06686419
MathSciNet: MR3595343
Digital Object Identifier: 10.1215/00294527-3767941

Subjects:
Primary: 03C57
Secondary: 03D45, 03E60

Rights: Copyright © 2017 University of Notre Dame

JOURNAL ARTICLE
9 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

SHARE
Vol.58 • No. 1 • 2017
Back to Top