## THE COMPLEXITY OF THE INDEX SETS OF ℵ0-CATEGORICAL THEORIES AND OF EHRENFEUCHT THEORIES (2006)

Citations: | 4 - 0 self |

### BibTeX

@MISC{Lempp06thecomplexity,

author = {Steffen Lempp and Theodore and A. Slaman},

title = {THE COMPLEXITY OF THE INDEX SETS OF ℵ0-CATEGORICAL THEORIES AND OF EHRENFEUCHT THEORIES},

year = {2006}

}

### OpenURL

### Abstract

Abstract. We classify the computability-theoretic complexity of two index sets of classes of first-order theories: We show that the property of being an ℵ0-categorical theory is Π0 3-complete; and the property of being an Ehrenfeucht theory Π1 1-complete. We also show that the property of having continuum many models is Σ1 1- hard. Finally, as a corollary, we note that the properties of having only decidable models, and of having only computable models, are both Π1 1-complete. 1. The Main Theorem Measuring the complexity of mathematical notions is one of the main tasks of mathematical logic. Two of the main tools to classify complexity are provided by Kleene’s arithmetical and analytical hierarchy. These two hierarchies provide convenient ways to determine the exact complexity of properties by various notions of completeness, and to give lower bounds on the complexity by various notions of hardness. (See, e.g., Kleene [1], Soare [10] or Odifreddi [4, 5] for the definitions.) This paper will investigate the complexity of properties of a firstorder theory, more precisely, the complexity of a countable first-order theory having a certain number of models. Recall that a theory is called ℵ0-categorical if it has only one countable model up to isomorphism, and an Ehrenfeucht theory if it has more than one but only finitely many countable models up to isomorphism. In order to measure the complexity of these notions, we will use decidable first-order theories,

### Citations

686 |
Introduction to Metamathematics
- Kleene
- 1952
(Show Context)
Citation Context ...ovide convenient ways to determine the exact complexity of properties by various notions of completeness, and to give lower bounds on the complexity by various notions of hardness. (See, e.g., Kleene =-=[1]-=-, Soare [10] or Odifreddi [4, 5] for the definitions.) This paper will investigate the complexity of properties of a firstorder theory, more precisely, the complexity of a countable first-order theory... |

309 |
Classical Recursion Theory
- Odifreddi
- 1989
(Show Context)
Citation Context ...rmine the exact complexity of properties by various notions of completeness, and to give lower bounds on the complexity by various notions of hardness. (See, e.g., Kleene [1], Soare [10] or Odifreddi =-=[4, 5]-=- for the definitions.) This paper will investigate the complexity of properties of a firstorder theory, more precisely, the complexity of a countable first-order theory having a certain number of mode... |

101 |
Higher Recursion Theory
- Sacks
- 1990
(Show Context)
Citation Context ...of the Hi’s, then T is an Ehrenfeucht theory. Now, the proposition follows. Te’s being a complete first-order theory is an arithmetic property and hence Π 1 1. By the Spector-Gandy Theorem, see Sacks =-=[9]-=-, the Π 1 1 predicates are closed under existential quantification over the hyperarithmetic sets. Thus, the condition above, that there exist hyperarithmetic sets H1, . . . , Hk, for all sets A, there... |

25 |
Classical recursion theory. Vol. I
- Odifreddi
- 1989
(Show Context)
Citation Context ...rmine the exact complexity of properties by various notions of completeness, and to give lower bounds on the complexity by various notions of hardness. (See, e.g., Kleene [1], Soare [10] or Odifreddi =-=[4, 5]-=- for the definitions.) This paper will investigate the complexity of properties of a firstorder theory, more precisely, the complexity of a countable first-order theory having a certain number of mode... |

23 |
Recursively Enumerable Sets and Degrees,” Perspectives in mathematical logic
- Soare
- 1987
(Show Context)
Citation Context ...nient ways to determine the exact complexity of properties by various notions of completeness, and to give lower bounds on the complexity by various notions of hardness. (See, e.g., Kleene [1], Soare =-=[10]-=- or Odifreddi [4, 5] for the definitions.) This paper will investigate the complexity of properties of a firstorder theory, more precisely, the complexity of a countable first-order theory having a ce... |

15 |
Scott Sentences and Admissible Sets
- Nadel
- 1974
(Show Context)
Citation Context ...have the same finite-rank canonical Scott sentence, then there is an isomorphism π between the models coded by A and H which is uniformly hyperarithmetically definable from A and H. See, for example, =-=[3]-=- in which Nadel analyzes of Scott sentences and isomorphisms between countable models within admissible sets. Thus, for T with the given properties, there are finitely many hyperarithmetic presentatio... |

2 |
On the number of countable models, in: “Southeast Asian conference on logic
- Sacks
- 1981
(Show Context)
Citation Context ...in e) and is decidable (again uniformly in e). 3. The Upper Bound for Ehrenfeucht theories Proposition 1. The set {e : Te is an Ehrenfeucht theory} is Π 1 1. Proof. Proposition 1 follows from Sacks’s =-=[8]-=- proof that every countable model of an Ehrenfeucht theory has a hyperarithmetic representation. Suppose that T is a recursive, complete, first-order, Ehrenfeucht theory. From Sacks’s theorem, each of... |

1 |
Persistently finite theories with hyperarithmetic models
- Millar
- 1983
(Show Context)
Citation Context ...three countable models, and a theory having continuum many countable models, respectively. Our proof will be based largely on Reed [7], which in turn used previous work of Peretyat’kin [6] and Millar =-=[2]-=-. (Since our proof uses the rather involved machinery of Reed [7] so heavily and mostly without changes, we will assume familiarity with this paper throughout the rest of the proof.)sINDEX SETS IN MOD... |

1 |
Complete theories with a finite number of countable models, Algebra i Logika 12
- Peretjat’kin
- 1973
(Show Context)
Citation Context ...y with exactly three countable models, and a theory having continuum many countable models, respectively. Our proof will be based largely on Reed [7], which in turn used previous work of Peretyat’kin =-=[6]-=- and Millar [2]. (Since our proof uses the rather involved machinery of Reed [7] so heavily and mostly without changes, we will assume familiarity with this paper throughout the rest of the proof.)sIN... |

1 |
A decidable Ehrenfeucht theory with exactly two hyperarithmetic models
- Reed
- 1991
(Show Context)
Citation Context ... sets of) the properties of being an Ehrenfeucht theory with exactly three countable models, and a theory having continuum many countable models, respectively. Our proof will be based largely on Reed =-=[7]-=-, which in turn used previous work of Peretyat’kin [6] and Millar [2]. (Since our proof uses the rather involved machinery of Reed [7] so heavily and mostly without changes, we will assume familiarity... |