journal article Dec 01, 1984

The hereditary partial effective functionals and recursion theory in higher types

Abstract
AbstractA type-structure of partial effective functionals over the natural numbers, based on a canonical enumeration of the partial recursive functions, is developed. These partial functionals, defined by a direct elementary technique, turn out to be the computable elements of the hereditary continuous partial objects; moreover, there is a commutative system of enumerations of any given type by any type below (relative numberings).By this and by results in [1] and [2], the Kleene-Kreisel countable functionals and the hereditary effective operations (HEO) are easily characterized.
Topics

No keywords indexed for this article. Browse by subject →

References
11
[1]
Scott (1982)
[5]
Kleene (1959)
[6]
Giannini (1983)
[7]
Ershov (1977)
[8]
Kreisel (1959)
[9]
Visser (1980)
[10]
Longo (1982)
Metrics
31
Citations
11
References
Details
Published
Dec 01, 1984
Vol/Issue
49(4)
Pages
1319-1332
License
View
Cite This Article
G. Longo, E. Moggi (1984). The hereditary partial effective functionals and recursion theory in higher types. The Journal of Symbolic Logic, 49(4), 1319-1332. https://doi.org/10.2307/2274281
Related

You May Also Like

On the logic of theory change: Partial meet contraction and revision functions

Carlos E. Alchourrón, Peter Gärdenfors · 1985

1,988 citations

A formulation of the simple theory of types

Alonzo Church · 1940

1,037 citations

Nicht konstruktiv beweisbare Sätze der Analysis

Ernst Specker · 1949

229 citations

Quantales and (noncommutative) linear logic

David N. Yetter · 1990

213 citations

On the Restraining Power of Guards

Erich Grädel · 1999

191 citations