Skip to search formSkip to main content

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

Is this relevant?

2007

2007

We show that many so called discrete weak semilatticesconsidered earlier in a series of author's publications havehereditary… Expand

Is this relevant?

2005

2005

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

Is this relevant?

2001

2001

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

Is this relevant?

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

Is this relevant?

1989

1987

1984

1984

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

Is this relevant?

1983

1983

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

Is this relevant?

1982

1982

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

Is this relevant?