Recursive spectra of flat strongly minimal theories

نویسندگان

چکیده

We show that for a model complete strongly minimal theory whose pregeometry is flat, the recursive spectrum (SRM($T$)) either of form $[0,\alpha )$ $\alpha \in \omega +2$ or $[0,n]\cup \left \{\omega \right \}$ $n\in \omega$, $\{\omega \}$, contained in $\left \{0,1,2\right \}$. Combined with previous results, this leaves precisely 4 sets which it not yet determined whether each flat pregeometry.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strongly Minimal Theories with Recursive Models

We give effectiveness conditions on a strongly minimal theory T guaranteeing that all models have computable copies. In particular, we show that if T is strongly minimal and for n ě 1, T X Dn`2 is ∆n, uniformly in n, then every model has a computable copy. Relativizing, we answer a long-standing question in computable model theory, showing that if a strongly minimal theory has a computable mode...

متن کامل

New spectra of strongly minimal theories in finite languages

We describe strongly minimal theories Tn with finite languages such that in the chain of countable models of Tn, only the first n models have recursive presentations. Also, we describe a strongly minimal theory with a finite language such that every non-saturated model has a recursive presentation.

متن کامل

Spectra of Computable Models of Strongly Minimal Disintegrated Theories in Languages of Bounded Arity

In this paper, we consider the spectra of computable (or recursive) models of strongly minimal disintegrated theories. We conjecture that for any m, there are only finitely many spectra of computable models of strongly minimal disintegrated L-theories T in computable (but possibly infinite) relational languages L of arity at most m. We verify this conjecture here for binary and ternary language...

متن کامل

Spectra of Computable Models of Strongly Minimal Disintegrated Theories in Languages of Bounded Arity

In this paper, we consider the spectra of computable (or recursive) models of strongly minimal disintegrated theories. We conjecture that for any m, there are only finitely many spectra of computable models of strongly minimal disintegrated L-theories T in computable (but possibly infinite) relational languages L of arity at most m. We verify this conjecture here for binary and ternary language...

متن کامل

Trivial, Strongly Minimal Theories Are Model Complete after Naming Constants

We prove that ifM is any model of a trivial, strongly minimal theory, then the elementary diagram Th(MM ) is a model complete LM -theory. We conclude that all countable models of a trivial, strongly minimal theory with at least one computable model are 0′′-decidable, and that the spectrum of computable models of any trivial, strongly minimal theory is Σ5. The purely model-theoretic result in th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2021

ISSN: ['2330-1511']

DOI: https://doi.org/10.1090/proc/15613