Theodore A. Slaman

collaborators

Showing math.LOShow all

3 papers · 1 filter

math.LO2008

K-trivials are NCR

Antonio Montalban, Theodore A. Slaman

We show that for every K-trivial real X, there is no representation of a continuous probability measure m such that X is 1-random relative to m.

math.LO2007★ 1 cited

Low upper bounds of ideals

Antonin Kucera, Theodore A. Slaman

We show that there is a low T-upper bound for the class of K-trivial sets, namely those which are weak from the point of view of algorithmic randomness. This result is a special ca…

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…

K-trivials are NCR

Low upper bounds of ideals

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