Iterative Characterizations of Computable Unary Functions: A General Method

Mathematical Logic Quarterly 43 (1):29-38 (1997)
  Copy   BIBTEX

Abstract

Iterative characterizations of computable unary functions are useful patterns for the definition of programming languages based on iterative constructs. The features of such a characterization depend on the pairing producing it: this paper offers an infinite class of pairings involving very nice features

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,127

External links

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

Through your library

Similar books and articles

General iteration and unary functions.G. M. Germano & S. Mazzanti - 1991 - Annals of Pure and Applied Logic 54 (2):137-178.
Bounded iteration and unary functions.Stefano Mazzanti - 2005 - Mathematical Logic Quarterly 51 (1):89-94.
Iteration on notation and unary functions.Stefano Mazzanti - 2013 - Mathematical Logic Quarterly 59 (6):415-434.
On a theorem of Günter Asser.Cristian S. Calude & Lila Sântean - 1990 - Mathematical Logic Quarterly 36 (2):143-147.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
The Development of Ideas on Computable Intelligence.Yinsheng Zhang - 2017 - Journal of Human Cognition 1 (1):97-108.
Tennenbaum's Theorem and Unary Functions.Sakae Yaegasi - 2008 - Notre Dame Journal of Formal Logic 49 (2):177-183.
There is no safe pairing function over an arbitrary structure.Olga Xirotiri - 2006 - Mathematical Logic Quarterly 52 (4):362-366.

Analytics

Added to PP
2013-11-03

Downloads
4 (#1,644,260)

6 months
18 (#152,778)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Iteration on notation and unary functions.Stefano Mazzanti - 2013 - Mathematical Logic Quarterly 59 (6):415-434.

Add more citations

References found in this work

Recursiveness.Samuel Eilenberg & Calvin C. Elgot - 1974 - Studia Logica 33 (2):220-224.

Add more references