Atomless \(r\)-maximal sets

DOI10.1007/BF02780182zbMath0936.03039MaRDI QIDQ1961349

André Nies, Peter A. Cholak

Publication date: 14 February 2000

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

filterscomputably enumerable setlattice of supersetspairwise incomparable

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Related Items (3)

Computably enumerable sets and related issues ⋮ Extension theorems, orbits, and automorphisms of the computably enumerable sets ⋮ -MAXIMAL SETS

Cites Work

• Unnamed Item
• The intervals of the lattice of recursively enumerable sets determined by major subsets
• Automorphisms of the lattice of recursively enumerable sets: Orbits
• Coding in the partial order of enumerable sets
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets
• A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
• Automorphisms of the lattice of recursively enumerable sets
• On the Lattice of Recursively Enumerable Sets
• Simplicity of recursively enumerable sets

This page was built for publication: Atomless \(r\)-maximal sets