Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets

1974/07/01 by Robert I. Soare · 1 citation
Computer Science · Mathematics · #Advanced Topology and Set Theory #Automorphism #Combinatorics #Computability, Logic, AI Algorithms #Computer science #Discrete mathematics #Lattice (music) #Mathematics #Maximal set #Pure mathematics #Recursively enumerable language #Recursively enumerable set #Set (abstract data type) #semigroups and automata theory

paper · doi:10.2307/1970842

openalex publication_date 1974/07/01 · openalex created_date 2025/10/10 · openalex updated_date 2025/11/06

Abstract

Introduction . 80 ?1. Background material 82 S2. Automorphisms and maximal sets . 88 S3. Satisfying condition (2.2) and the hypotheses of the Extension Theorem . 92 S4. Proof of the Extension Theorem Part I: Motivation . ...... 97 S5. Proof of the Extension Theorem Part II: Covering ......... 105 S6. Proof of the Extension Theorem Part III: Mappings . ...... 114 S7. Conclusion 118

Citations

• Recursively enumerable sets of positive integers and their decision problems

Cited by

• Computability theory [wikipedia]