Jumps of Minimal Degrees Below 0'

We show that there is a degree a REA in and low over 0' suchthat no minimal degree below 0' jumps to a degree above a. Wealso show that every nonlow recursively enumerable degree boundsa nonlow minimal degree.     

Downward closure of depth in countable Boolean algebras

We study the set of depths of relative algebras of countable Boolean algebras, in particular the extent to which this set may not be downward closed within the countable ordinals for a fixed countable Boolean algebra. Doing so, we exhibit a structural difference between the class of arbitrary rank countable Boolean algebras and the class of rank one countable Boolean algebras.     

Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order

We compare Aut(Q), the classical automorphism group of a countable dense linear order, with Aut _c (Q), the group of all computable automorphisms of such an order. They have a number of similarities, including the facts that every element of each group is a commutator and each group has exactly three nontrivial normal subgroups. However, the standard proofs of these facts in Aut(Q) do not work for Aut _c (Q). Also, Aut(Q) has three fundamental properties which fail in Aut _c (Q): it is divisible, every element is a commutator of itself with some other element, and two elements are conjugate if and only if they have isomorphic orbital structures.     

The -theory of the computably enumerable Turing degrees is undecidable

We show the undecidability of the -theory of the partial order of computably enumerable Turing degrees.

     

Initial Segments of Recursive Linear Orders

We show that any -initial segment of a recursive linear order can be presented recursively.     

Interval Dismantlable Lattices

A finite lattice is interval dismantlable if it can be partitioned into an ideal and a filter, each of which can be partitioned into an ideal and a filter, etc., until you reach 1-element lattices. In this note, we find a quasi-equational basis for the pseudoquasivariety of interval dismantlable lattices, and show that there are infinitely many minimal interval non-dismantlable lattices.     

Lattice Embeddings into the R.E. Degrees Preserving 0 and 1

We show that a finite distributive lattice can be embedded intothe r.e. degrees preserving least and greatest element if andonly if the lattice contains a join-irreducible noncappableelement.     

Highness and bounding minimal pairs

We show the existence of a high r. e. degree bounding only joins of minimal pairs and of a high₂ nonbounding r. e. degree. MSC: 03D25.     

On the filter of computably enumerable supersets of an r-maximal set

We study the filter ℒ^*(A) of computably enumerable supersets (modulo finite sets) of an r-maximal set A and show that, for some such set A, the property of being cofinite in ℒ^*(A) is still Σ⁰ ₃-complete. This implies that for this A, there is no uniformly computably enumerable “tower” of sets exhausting exactly the coinfinite sets in ℒ^*(A). Received: 6 November 1999 / Revised version: 10 March 2000 /?Published online: 18 May 2001