Skip to search formSkip to main contentSkip to account menu

Recursively enumerable set

Known as: CE, Partially decidable, Co-r.e. 
In computability theory, traditionally called recursion theory, a set S of natural numbers is called recursively enumerable, computably enumerable… 
Wikipedia (opens in a new tab)

Related topics

Related topics

34 relations
AlgorithmAlpha recursion theoryArithmetical hierarchyArithmetical set

Broader (2)

Computability theoryTheory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
ON MODAL LOGICS BETWEEN K×K×K AND S5× S5× S5
We prove that every n-modal logic between K and S5 is undecidable, whenever n ≥ 3. We also show that each of these logics is non… 
2001
2001
Extension of embeddings in the computably enumerable degrees
Gödel’s Incompleteness Theorem [Göd31] and his subsequent work on computable functions [Göd34] exhibited undecidability in the… 
Review
1991
Review
1991
Disunification: A Survey.
Solving an equation in an algebra of terms is known as uniication. Solving more complex formulas combining equations and… 
1986
1986
Lattice embeddings into the recursively enumerable degrees
The classification of algebraic structures which can be embedded into ℛ, the uppersemilattice of recursively enumerable degrees… 
1984
1984
Decidable subspaces and recursively enumerable subspaces
Abstract A subspace V of an infinite dimensional fully effective vector space V∞ is called decidable if V is r.e. and there… 
1972
1972
Characterization of recursively enumerable sets
Abstract Let N, O and S denote the set of nonnegative integers, the graph of the constant 0 function and the graph of the… 
1968
1968
COMPLETE RECURSIVELY ENUMERABLE SETS
The main purpose of this paper is to improve upon the main theorem of Martin [2 ]. Martin gave a sufficient condition for a… 
1967
1967
Infinite subclasses of recursively enumerable classes
P. R. Young [1 ] has constructed an infinite recursively enumerable (r.e.) class with no proper infinite r.e. subclasses, and has… 
1967
1967
No recursively enumerable set is the union of finitely many immune retraceable sets
In what follows, by retracing function we will always mean special retracing function: a partial recursive function f whose range… 
1966
1966
Some properties of pseudo-complements of recursively enumerable sets
Introductory remarks. Those first order systems which exhibit some real mathematical pretensions fall into what is called in [1…