Automorphisms of the Lattice of Recursively Enumerable Sets (Memoirs of the American Mathematical Society) - Softcover

Cholak, Peter

 
9780821826010: Automorphisms of the Lattice of Recursively Enumerable Sets (Memoirs of the American Mathematical Society)

Inhaltsangabe

This work explores the connection between the lattice of recursively enumerable (r.e.) sets and the r.e. Turing degrees. Cholak presents a degree-theoretic technique for constructing both automorphisms of the lattice of r.e. sets and isomorphisms between various substructures of the lattice. In addition to providing another proof of Soare's Extension Theorem, this technique is used to prove a collection of new results, including: every non recursive r.e. set is automorphic to a high r.e. set; and for every non recursive r.e. set $A$ and for every high r.e. degree h there is an r.e. set $B$ in h such that $A$ and $B$ form isomorphic principal filters in the lattice of r.e. sets.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

This work explores the connection between the lattice of recursively enumerable (r.e.) sets and the r.e. Turing degrees. Cholak presents a degree-theoretic technique for constructing both automorphisms of the lattice of r.e. sets and isomorphisms between various substructures of the lattice. In addition to providing another proof of Soare's Extension Theorem, this technique is used to prove a collection of new results, including: every nonrecursive r.e. set is automorphic to a high r.e. set; and for every nonrecursive r.e. set *A and for every high r.e. degree h there is an r.e. set *B in h such that *A and *B form isomorphic principal filters in the lattice of r.e. sets.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.