Computable model theory.
3. Theories, types, models, and diagrams. 138 4. Small theories and their models. 144 5.
Effective categoricity. 148 6. Automorphisms of effective structures. 156 7. Degree spectra of …
Effective categoricity. 148 6. Automorphisms of effective structures. 156 7. Degree spectra of …
Limitwise monotonic sequences and degree spectra of structures
I Kalimullin, B Khoussainov, A Melnikov - Proceedings of the American …, 2013 - ams.org
In this paper, we study effective monotonic approximations of sets and sequences of sets.
We show that there is a sequence of sets which has no uniform computable monotonic …
We show that there is a sequence of sets which has no uniform computable monotonic …
Limitwise monotonic functions and their applications
RG Downey, AM Kach, D Turetsky - Proceedings Of The 11Th Asian …, 2012 - World Scientific
We survey what is known about limitwise monotonic functions and sets and discuss their
applications in effective algebra and computable model theory. Additionally, we characterize …
applications in effective algebra and computable model theory. Additionally, we characterize …
A new spectrum of recursive models using an amalgamation construction
U Andrews - The Journal of Symbolic Logic, 2011 - cambridge.org
We employ an infinite-signature Hrushovski amalgamation construction to yield two results
in Recursive Model Theory. The first result, that there exists a strongly minimal theory whose …
in Recursive Model Theory. The first result, that there exists a strongly minimal theory whose …
Iterated effective embeddings of abelian p-groups
This paper contributes to the theory of recursively presented (see Higman [Subgroups of
finitely presented groups, Proc. R. Soc. Ser. A 262 (1961) 455–475]) infinitely generated …
finitely presented groups, Proc. R. Soc. Ser. A 262 (1961) 455–475]) infinitely generated …
Applications of Kolmogorov complexity to computable model theory
B Khoussainov, P Semukhin… - The Journal of Symbolic …, 2007 - cambridge.org
In this paper we answer the following well-known open question in computable model
theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique …
theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique …
Strongly minimal theories with recursive models.
U Andrews, JF Knight - Journal of the European Mathematical …, 2018 - content.ems.press
We give effectiveness conditions on a strongly minimal theory T guaranteeing that all
countable models have computable copies. In particular, we show that if T is strongly …
countable models have computable copies. In particular, we show that if T is strongly …
[PDF][PDF] Structural and topological aspects of the enumeration and hyperenumeration degrees
J Jacobsen-Grocott - 2024 - math.wisc.edu
This thesis focuses on compatibility theory, mainly looking at enumeration reducibility and
related topics. In Chapter 2 we η-representable sets. We delevope the notion of a connected …
related topics. In Chapter 2 we η-representable sets. We delevope the notion of a connected …
Amalgamation constructions and recursive model theory
U Andrews - 2010 - escholarship.org
We employ the Hrushovski Amalgamation Construction to generate strongly minimal
examples of interesting recursive model theoretic phenomena. We show that there exists a …
examples of interesting recursive model theoretic phenomena. We show that there exists a …
Is a spectrum of a non-disintegrated flat strongly minimal model complete theory in a language with finite signature
U Andrews, O Mermelstein - The Journal of Symbolic Logic, 2021 - cambridge.org
[0,n] ∪ { } IS A SPECTRUM OF A NON-DISINTEGRATED FLAT STRONGLY MINIMAL MODEL
COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATU Page 1 The Journal of Symbolic …
COMPLETE THEORY IN A LANGUAGE WITH FINITE SIGNATU Page 1 The Journal of Symbolic …