Automorphisms of the Lattice of Recursively Enumerable Sets - Couverture souple

Cholak, Peter

Couverture souple

ISBN 10 : 0821826018 ISBN 13 : 9780821826010

Editeur : American Mathematical Society, 1995

Synopsis

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.

Détails de l'édition

• Éditeur: American Mathematical Society
• Date d'édition: 1995
• Langue: anglais
• ISBN 10: 0821826018
• ISBN 13: 9780821826010
• Reliure: Broché
• Nombre de pages: 151
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible