Theodore A. Slaman

activity

20062008

most citedThe complexity of the index sets of

ℵ_{0}

-categorical theories and of Ehrenfeucht theories

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

collaborators

Showing 2006Show all

3 papers · 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…

math.LO2006★ 1 cited

Decidability of the Natural Numbers with the Almost-All Quantifier

David Marker, Theodore A. Slaman

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substruc…

math.LO2006

Turing Incomparability in Scott Sets

Antonin Kucera, Theodore A. Slaman

For every Scott set F and every nonrecursive set X in F, there is a Y in F such that X and Y are Turing incomparable.

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

Decidability of the Natural Numbers with the Almost-All Quantifier

Turing Incomparability in Scott Sets

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