Automorphisms of the lattice of recursively enumerable sets: Promptly simple sets

Authors

Peter Cholak, University of Wisconsin-Madison
Rod G. Downey, Victoria University of Wellington
Michael Stob, Calvin University

Document Type

Article

Publication Title

Transactions of the American Mathematical Society

Abstract

We show that for every coinfinite r.e. set A there is a complete r.e. set B such that ℒ⋆(A)≈ ℒ⋆(B) and that every promptly simple set is automorphic (in f⋆) to a complete set.

First Page

555

Last Page

570

DOI

10.1090/S0002-9947-1992-1097164-6

Publication Date

1-1-1992

Recommended Citation

Cholak, Peter; Downey, Rod G.; and Stob, Michael, "Automorphisms of the lattice of recursively enumerable sets: Promptly simple sets" (1992). University Faculty Publications and Creative Works. 464.
https://digitalcommons.calvin.edu/calvin_facultypubs/464