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.

2019

2019

Abstract In the context of his theory of numberings, Ershov showed that Kleene's recursion theorem holds for any precomplete… Expand

2009

2009

We show that many of the so called discrete weak semilattices considered earlier in a series of author's publications have… Expand

2005

2005

Abstract.A strong reducibility relation between partial numberings is introduced which is such that the reduction function… Expand

2001

2001

Abstract Acceptable programming systems have many nice properties like s-m-n-Theorem, Composition and Kleene Recursion Theorem… Expand

1992

1992

Let G = (V, E) be a directed graph and n denote |V|. We show that G is k-vertex connected iff for every subset X of V with |X… Expand

1984

1984

Er\u{s}ov [1] characterized precomplete numerations as those numerations which satisfy the 2nd recursion theorem. In this short… Expand

1983

1983

People scanned lists of hierarchically numbered items in order to perform various tasks. For tasks involving location of… Expand

1982

1982

Sixteen people scanned lists of hierarchically numbered items to perform various tasks. For tasks involving location of… Expand