Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
1996
Highly Cited
1996
  • M. Kummer
  • SIAM J. Comput.
  • 1996
  • Corpus ID: 18471904
The way in which way Kolmogorov complexity and instance complexity affect properties of recursively enumerable (r.e.) sets is… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Abstract Annotated logics were introduced in [43] and later studied in [5, 7, 31, 32]. In [32], annotations were extended to… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
TABLE OF CONTENTS Introduction Chapter I. The relation of the structure of an r.e. set to its degree. 1. Post's program and… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1987
Highly Cited
1987
  • R. Soare
  • Perspectives in mathematical logic
  • 1987
  • Corpus ID: 122049874
..."The book, written by one of the main researchers on the field, gives a complete account of the theory of r.e. degrees...The… Expand
Is this relevant?
Highly Cited
1976
Highly Cited
1976
Abstract The polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarchy in which deterministic… Expand
Is this relevant?
1975
1975
We extend the priority method in a-recursion theory to certain arguments with no a priori bound on the required preservations by… Expand
Is this relevant?
Highly Cited
1973
Highly Cited
1973
  • R. Ladner
  • J. Symb. Log.
  • 1973
  • Corpus ID: 19320042
A recursively enumerable (r.e.) set is mitotic if it is the disjoint union of two r.e. sets both of the same degree of… Expand
Is this relevant?
Highly Cited
1968
Highly Cited
1968
This paper presents some new theorems concerning recursively enumerable (r.e.) sets. The aim of the paper is to advance the… Expand
Is this relevant?
Highly Cited
1953
Highly Cited
1953
1. Introduction. In this paper we consider classes whose elements are re-cursively enumerable sets of non-negative integers. No… Expand
Is this relevant?
Highly Cited
1944
Highly Cited
1944
Introduction. Recent developments of symbolic logic have considerable importance for mathematics both with respect to its… Expand
Is this relevant?