Results 1 -
1 of
1
The ∆ 0 3-automorphism method and noninvariant classes of degrees
- J. Amer. Math. Soc
, 1996
"... AsetAof nonnegative integers is computably enumerable (c.e.), also called recursively enumerable (r.e.), if there is a computable method to list its elements. Let E denote the structure of the computably enumerable sets under inclusion, E =({We}e∈ω,⊆). Most previously known automorphisms Φ of the st ..."
Abstract
-
Cited by 12 (1 self)
- Add to MetaCart
AsetAof nonnegative integers is computably enumerable (c.e.), also called recursively enumerable (r.e.), if there is a computable method to list its elements. Let E denote the structure of the computably enumerable sets under inclusion, E =({We}e∈ω,⊆). Most previously known automorphisms Φ of the structure E of
