Skip to search formSkip to main contentSkip to account menu>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

1996

Highly Cited

1996

The way in which way Kolmogorov complexity and instance complexity affect properties of recursively enumerable (r.e.) sets is…

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…

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…

Highly Cited

1987

Highly Cited

1987

..."The book, written by one of the main researchers on the field, gives a complete account of the theory of r.e. degrees...The…

Highly Cited

1976

Highly Cited

1976

Abstract The polynomial-time hierarchy is that subrecursive analog of the Kleene arithmetical hierarchy in which deterministic…

Highly Cited

1973

Highly Cited

1973

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…

Highly Cited

1973

Highly Cited

1973

An important goal of complexity theory, as we see it, is to characterize those partial recursive functions and recursively…

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…

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…

Highly Cited

1944

Highly Cited

1944

Introduction. Recent developments of symbolic logic have considerable importance for mathematics both with respect to its…