On the Lattice of Recursively Enumerable Sets
From MaRDI portal
Publication:4767304
DOI10.2307/1994768zbMath0281.02042OpenAlexW4236944103MaRDI QIDQ4767304
Publication date: 1968
Full work available at URL: https://doi.org/10.2307/1994768
Decidability of theories and sets of sentences (03B25) Recursively (computably) enumerable sets and degrees (03D25)
Related Items
A class of hypersimple incomplete sets ⋮ Duality, non-standard elements, and dynamic properties of r.e. sets ⋮ A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets ⋮ Undecidable fragments of elementary theories ⋮ Lattice of recursively enumerable subalgebras of a recursive Boolean algebra ⋮ Two Theorems on Hyperhypersimple Sets ⋮ The lattice of recursively enumerable substructures of an effective closure system ⋮ \(\Sigma_ 5\)-completeness of index sets arising from the lattice of recursively enumerable sets ⋮ r‐Maximal sets and Q1,N‐reducibility ⋮ Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility ⋮ Closed left-r.e. sets ⋮ Extending and interpreting Post's programme ⋮ Isomorphism of lattices of recursively enumerable sets ⋮ Solvability of the all-existence-theory of a certain factor-lattice of recursively enumerable sets ⋮ Atomless \(r\)-maximal sets ⋮ A note on algebras of languages ⋮ Arithmetic hierarchy and ideals of enumerated Boolean algebras ⋮ A characterization ofR-maximal sets ⋮ Embedding relations in the lattice of recursively enumerable sets ⋮ Index sets of classes of hyper-hypersimple sets ⋮ The complexity of recursion theoretic games ⋮ On Lachlan's major sub-degree problem ⋮ Closed Left-R.E. Sets ⋮ Computably enumerable sets and related issues ⋮ Countable thin \(\Pi^0_1\) classes ⋮ Small \(\Pi^{0}_{1}\) classes ⋮ Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets ⋮ On the orbits of computably enumerable sets ⋮ \(r\)-maximal major subsets ⋮ Turing computability: structural theory ⋮ m-degrees of supersets of simple sets ⋮ Recursively enumerable sets and degrees ⋮ Hyper-hypersimple \(m\)-degrees ⋮ Hyperhypersimple sets and \(\Delta _ 2\) systems ⋮ Hyperarithmetical Index Sets in Recursion Theory ⋮ On effectively hypersimple sets ⋮ m-powers of simple sets ⋮ The intervals of the lattice of recursively enumerable sets determined by major subsets ⋮ Automorphisms of the lattice of recursively enumerable sets ⋮ Global and local admissibility. II. Major subsets and automorphisms ⋮ Effectively dense Boolean algebras and their applications ⋮ Splitting theorems in recursion theory ⋮ Determining Automorphisms of the Recursively Enumerable Sets ⋮ The translation theorem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Introduction to model theory and to the metamathematics of algebra
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Recursively Enumerable Sets and Retracing Functions
- On the Degrees of Index Sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- A theorem on hyperhypersimple sets
- Recursively enumerable sets of positive integers and their decision problems
