Automorphisms of the lattice of recursively enumerable sets / [electronic resource] Peter Cholak.

By: Cholak, Peter, 1962-Material type: TextTextSeries: Memoirs of the American Mathematical Society ; v. 541Publication details: Providence, RI : American Mathematical Society, 1995Description: 1 online resource (vii, 151 p.)ISBN: 9781470401207 (online)Subject(s): Recursively enumerable sets | Automorphisms | Lattice theoryAdditional physical formats: Automorphisms of the lattice of recursively enumerable sets /DDC classification: 510 s | 511.3/5 LOC classification: QA3 | .A57 no. 541 | QA9.615Online resources: Contents | Contents
Contents:
I. Introduction II. The extension theorem revisited III. The high extension theorems IV. The proof of the high extension theorem I V. The proof of the high extension theorem II VI. Lowness notions in the lattice of r.e. sets
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Current library Home library Call number Materials specified URL Status Date due Barcode
IMSc Library
IMSc Library
Link to resource Available EBK12994

Includes bibliographical references.

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

Access is restricted to licensed institutions

Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012

Mode of access : World Wide Web

Description based on print version record.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India

Powered by Koha