Automorphisms of the Lattice of Recursively Enumerable Sets - Brossura

Cholak, Peter

Brossura

ISBN 10: 0821826018 ISBN 13: 9780821826010

Casa editrice: Amer Mathematical Society, 1995

Riassunto

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.

Su questo libro

Product Description

Book by Cholak Peter

Dettagli dell'edizione

• Editore: Amer Mathematical Society
• Data di pubblicazione: 1995
• Lingua: Inglese
• ISBN 10: 0821826018
• ISBN 13: 9780821826010
• Rilegatura: Copertina flessibile
• Numero di pagine: 151
• Contatto del produttore: non disponibile
• Persona responsabile: non disponibile