Automorphisms of the Lattice of Recursively Enumerable Sets
Author | : Peter Cholak |
Publisher | : American Mathematical Soc. |
Total Pages | : 151 |
Release | : 1995 |
ISBN-10 | : 9780821826010 |
ISBN-13 | : 0821826018 |
Rating | : 4/5 (018 Downloads) |
Download or read book Automorphisms of the Lattice of Recursively Enumerable Sets written by Peter Cholak and published by American Mathematical Soc.. This book was released on 1995 with total page 151 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.