Nowhere simple sets and the lattice of recursively enumerable sets

DOI10.2307/2272830zbMath0398.03029OpenAlexW2015707592MaRDI QIDQ4182728

Richard A. Shore

Publication date: 1978

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2272830

zbMATH Keywords

Lattice of Recursively Enumerable SetsNowhere Simple Sets

Mathematics Subject Classification ID

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

Related Items

Co-immune subspaces and complementation inV_∞ ⋮ Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets ⋮ Effectively nowhere simple sets ⋮ A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets ⋮ Relations between certain reducibilities ⋮ One strengthening of \(Q\)-reducibility ⋮ Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility ⋮ \(Q _{1}\)-degrees of c.e. sets ⋮ Some reducibilities and splittings of recursively enumerable sets ⋮ Maximality in effective topology ⋮ Friedberg splittings of recursively enumerable sets ⋮ Degrees of convex dependence in recursively enumerable vector spaces ⋮ On the bounded quasi‐degrees of c.e. sets ⋮ \(r\)-maximal major subsets ⋮ Upper semilattice of recursively enumerable sQ-degrees ⋮ Recursively enumerable sets and degrees ⋮ Annual Meeting of the Association for Symbolic Logic

Cites Work

• Unnamed Item
• Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
• Automorphisms of the lattice of recursively enumerable sets
• Recursively enumerable sets of positive integers and their decision problems