A Classification of the Recursive Functions

Albert R. Meyer & Dennis M. Ritchie

Mathematical Logic Quarterly 18 (4‐6):71-82 (1972) Copy BIBT_EX

Abstract

This article has no associated abstract. (fix it)

Cite

Plain text

BibTeX

Formatted text

Reference Manager

RefWorks

Options

Mark as duplicate

Find it on Scholar

Request removal from index

Revision history

Categories

Computability in Philosophy of Computing and Information

Keywords

Reprint years

DOI

10.1002/malq.19720180405

Other Versions

reprint

Meyer, Albert R.; Ritchie, Dennis M. (1972) "A Classification of the Recursive Functions". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18(4-6):71-82

Links

PhilArchive

Upload a copy of this work Papers currently archived: 103,388

External links

From the Publisher via CrossRef (no proxy)

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

Through your library

Sign in / register and customize your OpenURL resolver
Configure custom resolver

My notes

Sign in to use this feature

Similar books and articles

A classification of the ordinal recursive functions.S. S. Wainer - 1970 - Archive for Mathematical Logic 13 (3-4):136-153.

A classification of the one-argument primitive recursive functions.Jovan Naumović - 1983 - Archive for Mathematical Logic 23 (1):161-174.

Recursive baire classification and speedable functions.Cristian Calude, Gabriel Istrate & Marius Zimand - 1992 - Mathematical Logic Quarterly 38 (1):169-178.

Hierarchies of Primitive Recursive Functions.Charles Parsons - 1968 - Mathematical Logic Quarterly 14 (21-24):357-376.

Note on the 3‐Recursive Functions.Paul Axt - 1961 - Mathematical Logic Quarterly 7 (7-10):97-98.

A Hierarchy of Primitive Recursive Functions.J. P. Cleave - 1963 - Mathematical Logic Quarterly 9 (22):331-346.

On the Algebraic Structure of Primitive Recursive Functions.István Szalkai - 1985 - Mathematical Logic Quarterly 31 (35-36):551-556.

Classes of One‐Argument Recursive Functions.Nadejda V. Georgieva - 1976 - Mathematical Logic Quarterly 22 (1):127-130.

n‐Ary Almost Recursive Functions.John W. Berry - 1974 - Mathematical Logic Quarterly 20 (34-36):551-559.

Analytics

Added to PP
2013-11-24

Downloads
19 (#1,120,317)

6 months
1 (#1,572,794)

Historical graph of downloads

How can I increase my downloads?

Citations of this work

Streamlined subrecursive degree theory.Lars Kristiansen, Jan-Christoph Schlage-Puchta & Andreas Weiermann - 2012 - Annals of Pure and Applied Logic 163 (6):698-716.

Semi-honest subrecursive degrees and the collection rule in arithmetic.Andrés Cordón-Franco & F. Félix Lara-Martín - 2023 - Archive for Mathematical Logic 63 (1):163-180.

On Shavrukov’s Non-Isomorphism Theorem for Diagonalizable Algebras.Evgeny A. Kolmakov - 2024 - Review of Symbolic Logic 17 (1):206-243.

Honest elementary degrees and degrees of relative provability without the cupping property.Paul Shafer - 2017 - Annals of Pure and Applied Logic 168 (5):1017-1031.

The intrinsic difficulty of recursive functions.F. W. Kroon - 1996 - Studia Logica 56 (3):427 - 454.

View all 6 citations / Add more citations

References found in this work

Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.

Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references