Results 1 -
2 of
2
Some Computability-Theoretical Aspects of Reals and Randomness
- the Lect. Notes Log. 18, Assoc. for Symbol. Logic
, 2001
"... We study computably enumerable reals (i.e. their left cut is computably enumerable) in terms of their spectra of representations and presentations. ..."
Abstract
-
Cited by 25 (7 self)
- Add to MetaCart
We study computably enumerable reals (i.e. their left cut is computably enumerable) in terms of their spectra of representations and presentations.
Effective presentability of Boolean algebras of Cantor-Bendixson rank 1
- Journal of Symbolic Logic
, 1999
"... We show that there is a computable Boolean algebra B and a computably enumerable ideal I of B such that the quotient algebra B/I is of Cantor-Bendixson rank 1 and is not isomorphic to any computable Boolean algebra. This extends a result of L. Feiner and is deduced from Feiner's result even though F ..."
Abstract
-
Cited by 6 (6 self)
- Add to MetaCart
We show that there is a computable Boolean algebra B and a computably enumerable ideal I of B such that the quotient algebra B/I is of Cantor-Bendixson rank 1 and is not isomorphic to any computable Boolean algebra. This extends a result of L. Feiner and is deduced from Feiner's result even though Feiner's construction yields a Boolean algebra of infinite Cantor-Bendixson rank.
