Automorphisms of the Lattice of Recursively Enumerable Sets


Book Description

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.




Recursively Enumerable Sets and Degrees


Book Description

..."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




Recursion Theory


Book Description




Recursive Model Theory


Book Description

Recursive Model Theory




Theoretical Computer Science


Book Description







Southeast Asian Conference on Logic


Book Description

The visit of Gerald Sacks to the National University of Singapore in 1981 provided an opportunity to organize a shortconference in Mathematical Logic. We were fortunate to receive encouragement and material support for this venture from several sources. Specific acknowledgements are made below. Sponsorship of the conference by the Association for Symbolic Logic was received and gave added inspiration. A final word in this connexion concerns the debt we owe to invited speakers who were able to provide for travel expenses from their own resources. Their presence at the conference would not have been possible otherwise. The publication of these Proceedings came about through an initiative of North Holland. The progress in producing the volume has been somewhat fitful, and we appreciate their forbearance and understanding. The items herein, with some exceptions, are written versions of invited talks given at the conference. Abstracts of contributed papers have appeared in the Journal of Symbolic Logic. The two workshops: in Recursion Theory by Mark Tamthai and Model Theory by Chris Ash, which were held in conjunction with the conference, are not recorded. We were fortunate to receive editorial assistance from John Bell during his visit to NUS. A great debt is owed to Mimi Bell and Madam Lam for producing the splendid typescript for the volume.