Computably enumerable sets and related issues

DOI10.1007/S10469-012-9161-1zbMATH Open1260.03078OpenAlexW2080383721MaRDI QIDQ695800FDOQ695800

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

Recommendations

The computably enumerable sets: recent results and future directions
Definable structures in the lattice of recursively enumerable sets
Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
Algebraic aspects of the computably enumerable degrees.
On definable filters in computably enumerable degrees

decidability definability computably enumerable sets principal ideals algebraic descriptions lattice of c.e. sets m-reducibility principal filters semilattice of c.e. many-one degrees

Mathematics Subject Classification ID

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

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
Classes of Recursively Enumerable Sets and Degrees of Unsolvability
Classical recursion theory. The theory of functions and sets of natural numbers
Theory of Formal Systems. (AM-47)
Recursively enumerable sets of positive integers and their decision problems
On the degrees less than 0'
Title not available (Why is that?)
Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
Post's program and incomplete recursively enumerable sets.
Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
Title not available (Why is that?)
Title not available (Why is that?)
Some theorems on R-maximal sets and major subsets of recursively enumerable sets
Title not available (Why is that?)
On the Cartesian subalgebras of a free Lie sum of Lie algebras
A Dichotomy of the Recursively Enumerable Sets
Title not available (Why is that?)
Degrees of classes of RE sets
Definable Encodings in the Computably Enumerable Sets
On the Lattice of Recursively Enumerable Sets
Degrees of recursively enumerable sets which have no maximal supersets
The computable enumerations of families of general recursive functions
tt- and m-degrees
Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I
Several results on upper semilattices and m-degrees
The upper semilattice of numerations of a finite set
Coding in the partial order of enumerable sets
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 a property of creative sets
Title not available (Why is that?)
Recursively Enumerable Sets and Retracing Functions
A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
Title not available (Why is that?)
Title not available (Why is that?)
Model theory of the computably enumerable many-one degrees
Title not available (Why is that?)
Isomorphisms of splits of computably enumerable sets
Title not available (Why is that?)
Title not available (Why is that?)
Simplicity of recursively enumerable sets
A theorem on hyperhypersimple sets
Title not available (Why is that?)
A note on universal sets
The intervals of the lattice of recursively enumerable sets determined by major subsets

Cited In (14)

Constructive sets in computable sets
Post's program and incomplete recursively enumerable sets.
Almost computably enumerable families of sets
Sub-computabilities
Title not available (Why is that?)
Computably enumerable sets below random sets
Title not available (Why is that?)
On definable filters in computably enumerable degrees
Title not available (Why is that?)
Computably enumerable sets and quasi-reducibility
ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
The computably enumerable sets: recent results and future directions
The complexity types of computable sets
On the filter of computably enumerable supersets of an r-maximal set

This page was built for publication: Computably enumerable sets and related issues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q695800)