Iteration on notation and unary functions

Mathematical Logic Quarterly 59 (6):415-434 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.201200055

Links

PhilArchive



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

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

Bounded iteration and unary functions.Stefano Mazzanti - 2005 - Mathematical Logic Quarterly 51 (1):89-94.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
Iterative Characterizations of Computable Unary Functions: A General Method.Stefano Mazzanti - 1997 - Mathematical Logic Quarterly 43 (1):29-38.
Time polynomial in input or output.Yuri Gurevich & Saharon Shelah - 1989 - Journal of Symbolic Logic 54 (3):1083-1088.
The $\mu$ -measure as a tool for classifying computational complexity.Karl-Heinz Niggl - 2000 - Archive for Mathematical Logic 39 (7):515-539.
Tailoring recursion for complexity.Erich Grädel & Yuri Gurevich - 1995 - Journal of Symbolic Logic 60 (3):952-969.
A Buchholz Derivation System for the Ordinal Analysis of KP + Π₃-Reflection.Markus Michelbrink - 2006 - Journal of Symbolic Logic 71 (4):1237 - 1283.
Primitive iteration and unary functions.G. Germano & S. Mazzanti - 1988 - Annals of Pure and Applied Logic 40 (3):217-256.
General iteration and unary functions.G. M. Germano & S. Mazzanti - 1991 - Annals of Pure and Applied Logic 54 (2):137-178.
Subrecursion: functions and hierarchies.H. E. Rose - 1984 - New York: Oxford University Press.
Tennenbaum's Theorem and Unary Functions.Sakae Yaegasi - 2008 - Notre Dame Journal of Formal Logic 49 (2):177-183.
A set theory with support for partial functions.William M. Farmer & Joshua D. Guttman - 2000 - Studia Logica 66 (1):59-78.
Computability Theory: An Introduction to Recursion Theory.Herbert B. Enderton - 2010 - Academic Press.
Uniformly computable aspects of inner functions: estimation and factorization.Timothy H. McNicholl - 2008 - Mathematical Logic Quarterly 54 (5):508-518.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.

Analytics

Added to PP
2013-12-01

Downloads
20 (#766,692)

6 months
8 (#359,856)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

General Recursive Functions.Julia Robinson - 1951 - Journal of Symbolic Logic 16 (4):280-280.
Simplifications of the recursion scheme.M. D. Gladstone - 1971 - Journal of Symbolic Logic 36 (4):653-665.
A reduction of the recursion scheme.M. D. Gladstone - 1967 - Journal of Symbolic Logic 32 (4):505-508.
Bounded iteration and unary functions.Stefano Mazzanti - 2005 - Mathematical Logic Quarterly 51 (1):89-94.
Primitive iteration and unary functions.G. Germano & S. Mazzanti - 1988 - Annals of Pure and Applied Logic 40 (3):217-256.

View all 10 references / Add more references