Skip to search formSkip to main content>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

We consider the informal concept of “computability” or “effective calculability” and two of the formalisms commonly used to… Expand

Highly Cited

1985

Highly Cited

1985

The use of conventional classical logic is misleading for characterizing the behavior of logic programs because a logic program… Expand

Highly Cited

1984

Highly Cited

1984

A general theory of public-key cryptography is developed that is based on the mathematical framework of complexity theory. Two… Expand

Highly Cited

1983

Highly Cited

1983

On introduit les termes du λ-calcul et les termes de la logique combinatoire d'ordres divers, correspondant aux niveaux de… Expand

Review

1982

Review

1982

In this chapter we introduce the formal definitions of computational complexity of real functions. We first review the… Expand

Highly Cited

1980

Highly Cited

1980

Preface Prologue, prerequisites and notation 1. Computable functions 2. Generating computable functions 3. Other approaches to… Expand

Review

1977

Review

1977

This paper reviews algorithmic information theory, which is an attempt to apply information-theoretic and probabilistic ideas to… Expand

Highly Cited

1977

Highly Cited

1977

1. Beginning Mathematical Logic. 2. First-Order Logic. 3. First-Order Logic (continued). 4. Boolean Algebras. 5. Model Theory. 6… Expand

Review

1977

Review

1977

Publisher Summary Inductive definitions of sets are often informally presented by giving some rules for generating elements of… Expand

Highly Cited

1963

Highly Cited

1963

As a result of the work of Turing, Post, Kleene and Church [1, 2, 3, 9, 10, l l 12, 17, 18] it is now widely accepted ~ that the… Expand