Computably enumerable sets and related issues
From MaRDI portal
Publication:695800
DOI10.1007/s10469-012-9161-1zbMath1260.03078OpenAlexW2080383721MaRDI QIDQ695800
Publication date: 17 December 2012
Published in: Algebra and Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10469-012-9161-1
decidabilityprincipal idealsdefinabilityprincipal filterscomputably enumerable setsalgebraic descriptionslattice of c.e. setsm-reducibilitysemilattice of c.e. many-one degrees
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The intervals of the lattice of recursively enumerable sets determined by major subsets
- Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I
- Several results on upper semilattices and m-degrees
- Classical recursion theory. The theory of functions and sets of natural numbers
- tt- and m-degrees
- The upper semilattice of numerations of a finite set
- Coding in the partial order of enumerable sets
- The computable enumerations of families of general recursive functions
- The elementary theory of recursively enumerable sets
- Undecidable fragments of elementary theories
- The last question on recursively enumerable \(m\)-degrees
- Atomless \(r\)-maximal sets
- On computable enumerations. II
- A theorem on maximal sets
- On the Cartesian subalgebras of a free Lie sum of Lie algebras
- On the degrees less than 0'
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- Theory of Formal Systems. (AM-47)
- Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
- Recursively Enumerable Sets and Retracing Functions
- A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
- Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
- Post's program and incomplete recursively enumerable sets.
- Degrees of classes of RE sets
- Definable Encodings in the Computably Enumerable Sets
- Model theory of the computably enumerable many-one degrees
- Isomorphisms of splits of computably enumerable sets
- On the Lattice of Recursively Enumerable Sets
- Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Degrees of recursively enumerable sets which have no maximal supersets
- Simplicity of recursively enumerable sets
- A theorem on hyperhypersimple sets
- A Dichotomy of the Recursively Enumerable Sets
- A note on universal sets
- Some theorems on R-maximal sets and major subsets of recursively enumerable sets
- Recursively enumerable sets of positive integers and their decision problems
This page was built for publication: Computably enumerable sets and related issues
