Results 1 
7 of
7
Effective model theory: the number of models and their complexity
 MODELS AND COMPUTABILITY
, 1999
"... Effective model theory studies model theoretic notions with an eye towards issues of computability and effectiveness. We consider two possible starting points. If the basic objects are taken to be theories, then the appropriate effective version investigates decidable theories (the set of theorems i ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
Effective model theory studies model theoretic notions with an eye towards issues of computability and effectiveness. We consider two possible starting points. If the basic objects are taken to be theories, then the appropriate effective version investigates decidable theories (the set of theorems is computable) and decidable structures (ones with decidable theories). If the objects of initial interest are typical mathematical structures, then the starting point is computable structures. We present an introduction to both of these aspects of effective model theory organized roughly around the themes of the number and types of models of theories with particular attention to categoricity (as either a hypothesis or a conclusion) and the analysis of various computability issues in families of models.
Degree spectra of prime models
 J. Symbolic Logic
, 2004
"... 2.1 Notation from model theory................... 4 2.2 F ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
2.1 Notation from model theory................... 4 2.2 F
The atomic model theorem and type omitting
 Trans. Amer. Math. Soc
"... We investigate the complexity of several classical model theoretic theorems about prime and atomic models and omitting types. Some are provable in RCA0, others are equivalent to ACA0. One, that every atomic theory has an atomic model, is not provable in RCA0 but is incomparable with WKL0, more than ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
We investigate the complexity of several classical model theoretic theorems about prime and atomic models and omitting types. Some are provable in RCA0, others are equivalent to ACA0. One, that every atomic theory has an atomic model, is not provable in RCA0 but is incomparable with WKL0, more than Π1 1 conservative over RCA0 and strictly weaker than all the combinatorial principles of Hirschfeldt and Shore [2007] that are not Π1 1 conservative over RCA0. A priority argument with Shore blocking shows that it is also Π1 1conservative over BΣ2. We also provide a theorem provable by a finite injury priority argument that is conservative over IΣ1 but implies IΣ2 over BΣ2, and a type omitting theorem that is equivalent to the principle that for every X there is a set that is hyperimmune relative to X. Finally, we give a version of the atomic model theorem that is equivalent to the principle that for every X there is a set that is not recursive in X, and is thus in a sense the weakest possible natural principle not true in the ωmodel consisting of the recursive sets.
The atomic model theorem
"... We investigate the complexity of several classical model theoretic theorems about prime and atomic models and omitting types. Some are provable in RCA0, others are equivalent to ACA0. One, that every atomic theory has an atomic model, is not provable in RCA0 but is incomparable with WKL0, more than ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
We investigate the complexity of several classical model theoretic theorems about prime and atomic models and omitting types. Some are provable in RCA0, others are equivalent to ACA0. One, that every atomic theory has an atomic model, is not provable in RCA0 but is incomparable with WKL0, more than Π1 1 conservative over RCA0 and strictly weaker than all the combinatorial principles of Hirschfeldt and Shore [2007] that are not Π1 1 conservative over RCA0. A priority argument with Shore blocking shows that it is also Π 1 1conservative over BΣ2. We also provide a theorem provable by a finite injury priority argument that is conservative over IΣ1 but implies IΣ2 over BΣ2, and a type omitting theorem that is equivalent to the principle that for every X there is a set that is hyperimmune relative to X. Finally, we give a version of the atomic model theorem that is equivalent to the principle that for every X there is a set that is not recursive in X, and is thus in a sense the weakest possible natural principle not true in the ωmodel consisting of the recursive sets.
Open Problems in the Theory of Constructive Algebraic Systems
, 2000
"... In this paper we concentrate on open problems in two directions in the development of the theory of constructive algebraic systems. The first direction deals with universal algebras whose positive open diagrams can be computably enumerated. These algebras are called positive algebras. Here we em ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we concentrate on open problems in two directions in the development of the theory of constructive algebraic systems. The first direction deals with universal algebras whose positive open diagrams can be computably enumerated. These algebras are called positive algebras. Here we emphasize the interplay between universal algebra and computability theory. We propose a systematic study of positive algebras as a new direction in the development of the theory of constructive algebraic systems. The second direction concerns the traditional topics in constructive model theory. First we propose the study of constructive models of theories with few models such as countably categorical theories, uncountably categorical theories, and Ehrenfeucht theories. Next, we propose the study of computable isomorphisms and computable dimensions of such models. We also discuss issues related to the computabilitytheoretic complexity of relations in constructive algebraic systems.
Computable Models Spectra of Ehrenfeucht Theories
"... This study is devoted to the class of Ehrenfeucht theories, this class of theories has been well studied and has attracted considerable attention. ..."
Abstract
 Add to MetaCart
This study is devoted to the class of Ehrenfeucht theories, this class of theories has been well studied and has attracted considerable attention.