Results 1 
4 of
4
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 Relations on Computable Structures
 J. Symbolic Logic
, 1999
"... Abstract We give some new examples of possible degree spectra of invariant relations on \Delta 02categorical computable structures that demonstrate that such spectra can be fairly complicated. On the other hand, we show that there are nontrivial restrictions on the kinds of sets of degrees that can ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
Abstract We give some new examples of possible degree spectra of invariant relations on \Delta 02categorical computable structures that demonstrate that such spectra can be fairly complicated. On the other hand, we show that there are nontrivial restrictions on the kinds of sets of degrees that can be realized as degree spectra of such relations. In particular, we give a sufficient condition for a relation to have infinite degree spectrum that implies that every invariant computable relation on a \Delta 02categorical computable structure is either intrinsically computable or has infinite degree spectrum. This condition also allows us to use the proof of a result of Moses [22] to establish the same result for computable relations on computable linear orderings.
Computable Structures: Presentations Matter
 IN PROCEEDINGS OF THE INTL. CONG. LMPS
, 1999
"... The computability properties of a relation R not included in the language of a computable structure A can vary from one computable presentation to another. We describe some classic results giving conditions on A or R that restrict the possible variations in the computable dimension of A (i.e. the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The computability properties of a relation R not included in the language of a computable structure A can vary from one computable presentation to another. We describe some classic results giving conditions on A or R that restrict the possible variations in the computable dimension of A (i.e. the number of isomorphic copies of A up to computable isomorphism) and the computational complexity of R. For example, what conditions guarantee that A is computably categorical (i.e. of dimension 1) or that R is intrinsically computable (i.e. computable in every presentation). In the absence of such conditions, we discuss the possible computable dimensions of A and variations (in terms of Turing degree) of R in different presentations (the degree spectrum of R). In particular, various classic theorems and more recent ones of the author, B. Khoussainov, D. Hirschfeldt and others about the possible degree spectra of computable relations on computable structures and the connections with ...