S. Lempp

most citedThe complexity of the index sets of

ℵ_{0}

-categorical theories and of Ehrenfeucht theories

11 citations · 11 across the 1 of their papers we have counts for

collaborators

Showing math.LOShow all

1 paper · 1 filter

math.LO2006★ 11 cited

The complexity of the index sets of $ℵ_{0}$ -categorical theories and of Ehrenfeucht theories

Steffen Lempp, Theodore A. Slaman

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…

The complexity of the index sets of ℵ0​-categorical theories and of Ehrenfeucht theories

The complexity of the index sets of $ℵ_{0}$ -categorical theories and of Ehrenfeucht theories