Recursively Enumerable Sets and Degrees

Recursively Enumerable Sets and Degrees PDF

Author: Robert I. Soare

Publisher: Springer Science & Business Media

Published: 1999-11-01

Total Pages: 460

ISBN-13: 9783540152996

DOWNLOAD EBOOK →

..."The book, written by one of the main researchers on the field, gives a complete account of the theory of r.e. degrees. .... The definitions, results and proofs are always clearly motivated and explained before the formal presentation; the proofs are described with remarkable clarity and conciseness. The book is highly recommended to everyone interested in logic. It also provides a useful background to computer scientists, in particular to theoretical computer scientists." Acta Scientiarum Mathematicarum, Ungarn 1988 ..."The main purpose of this book is to introduce the reader to the main results and to the intricacies of the current theory for the recurseively enumerable sets and degrees. The author has managed to give a coherent exposition of a rather complex and messy area of logic, and with this book degree-theory is far more accessible to students and logicians in other fields than it used to be." Zentralblatt für Mathematik, 623.1988

Computability in Analysis and Physics

Computability in Analysis and Physics PDF

Author: Marian B. Pour-El

Publisher: Cambridge University Press

Published: 2017-03-02

Total Pages: 219

ISBN-13: 1107168449

DOWNLOAD EBOOK →

The first graduate-level treatment of computable analysis within the tradition of classical mathematical reasoning.

Automorphisms of the Lattice of Recursively Enumerable Sets

Automorphisms of the Lattice of Recursively Enumerable Sets PDF

Author: Peter Cholak

Publisher: American Mathematical Soc.

Published: 1995

Total Pages: 166

ISBN-13: 0821826018

DOWNLOAD EBOOK →

A version of Harrington's [capital Greek]Delta3-automorphism technique for the lattice of recursively enumerable sets is introduced and developed by reproving Soare's Extension Theorem. Then this automorphism technique is used to show two technical theorems: the High Extension Theorem I and the High Extension Theorem II. This is a degree-theoretic technique for constructing both automorphisms of the lattice of r.e. sets and isomorphisms between various substructures of the lattice.