Subrecursive hierarchies on Scott domains

Archive for Mathematical Logic 32 (4):239-257 (1993)
  Copy   BIBTEX

Abstract

We study a notion ofpartial primitive recursion (p.p.r.) including the concept ofparallelism in the context of partial continuous functions of type level one in the sense of [Krei], [Sco82], [Ers]. A variety of subrecursive hierarchies with respect top.p.r. is introduced and it turns out that they all coincide

Categories

Keywords

Reprint years

DOI

10.1007/bf01387405

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,435

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Subrecursive functions on partial sequences.Karl-Heinz Niggl - 1999 - Archive for Mathematical Logic 38 (3):163-193.
A restricted computation model on Scott domains and its partial primitive recursive functionals.Karl-Heinz Niggl - 1998 - Archive for Mathematical Logic 37 (7):443-481.
A Uniform Approach to Fundamental Sequences and Hierarchies.Wilfried Buchholz, Adam Cichon & Andreas Weiermann - 1994 - Mathematical Logic Quarterly 40 (2):273-286.
Non-definability of the Ackermann function with type 1 partial primitive recursion.Karl-Heinz Niggl - 1997 - Archive for Mathematical Logic 37 (1):1-13.
Review: Robert A. DiPaola, Random Sets in Subrecursive Hierarchies. [REVIEW]Donald W. Loveland - 1975 - Journal of Symbolic Logic 40 (2):249-250.
The Structure of Loop Programs and Subrecursive Hierarchies.Bernhard Goetze & Werner Nehrlich - 1980 - Mathematical Logic Quarterly 26 (14‐18):255-278.
Classical and constructive hierarchies in extended intuitionistic analysis.Joan Rand Moschovakis - 2003 - Journal of Symbolic Logic 68 (3):1015-1043.
Down with the Hierarchies.Jacob Stegenga - 2014 - Topoi 33 (2):313-322.
Hierarchy.Paul H. Rubin - 2000 - Human Nature 11 (3):259-279.
Fine hierarchies and Boolean terms.V. L. Selivanov - 1995 - Journal of Symbolic Logic 60 (1):289-317.
Subrecursion: functions and hierarchies.H. E. Rose - 1984 - New York: Oxford University Press.
On Wainer's notation for a minimal subrecursive inaccessible ordinal.Noriya Kadota - 1993 - Mathematical Logic Quarterly 39 (1):217-227.
A uniform approach for characterizing the provably total number-theoretic functions of KPM and its subsystems.Benjamin Blankertz & Andreas Weiermann - 1999 - Studia Logica 62 (3):399-427.
Recursion-theoretic hierarchies.Peter G. Hinman - 1978 - New York: Springer Verlag.
The intrinsic difficulty of recursive functions.F. W. Kroon - 1996 - Studia Logica 56 (3):427 - 454.

Analytics

Added to PP
2013-11-23

Downloads
15 (#934,326)

6 months
2 (#1,214,131)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Towards the computational complexity of ℘Rω-terms.Karl-Heinz Niggl - 1995 - Annals of Pure and Applied Logic 75 (1-2):153-178.
Towards the computational complexity of ℘Rω-terms.Karl-Heinz Niggl - 1995 - Annals of Pure and Applied Logic 75 (1):153-178.
< i> M_< sup> ω considered as a programming language.Karl-Heinz Niggl - 1999 - Annals of Pure and Applied Logic 99 (1):73-92.
Mω considered as a programming language.Karl-Heinz Niggl - 1999 - Annals of Pure and Applied Logic 99 (1-3):73-92.

Add more citations

References found in this work

Rekursionszahlen und die Grzegorczyk-Hierarchie.Helmut Schwichtenberg - 1969 - Archive for Mathematical Logic 12 (1-2):85-97.

Add more references