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

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

Paperback

Up to 1 WeekUsually despatched within 1 week

Description

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.

Contents

Introduction The extension theorem revisited The high extension theorems The proof of the high extension theorem I The proof of the high extension theorem II Lowness notions in the lattice of r.e. sets Bibliography.

Product Details

  • ISBN13: 9780821826010
  • Format: Paperback
  • Number Of Pages: 151
  • ID: 9780821826010
  • ISBN10: 0821826018

Delivery Information

  • Saver Delivery: Yes
  • 1st Class Delivery: Yes
  • Courier Delivery: Yes
  • Store Delivery: Yes

Prices are for internet purchases only. Prices and availability in WHSmith Stores may vary significantly

Close