A note on arbitrarily complex recursive functions

Notre Dame Journal of Formal Logic 29 (2):198-207 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
Some restrictions on simple fixed points of the integers.G. L. McColm - 1989 - Journal of Symbolic Logic 54 (4):1324-1345.
Formal systems and recursive functions.John N. Crossley & Michael Dummett (eds.) - 1965 - Amsterdam,: North-Holland Pub. Co..
Hyper-Torre isols.Erik Ellentuck - 1981 - Journal of Symbolic Logic 46 (1):1-5.
Generalized weak presentations.Alexandra Shlapentokh - 2002 - Journal of Symbolic Logic 67 (2):787-819.
A note on nominalism and recursive functions.R. M. Martin - 1949 - Journal of Symbolic Logic 14 (1):27-31.
Weak Presentations of Computable Fields.Carl G. Jockusch & Alexandra Shlapentokh - 1995 - Journal of Symbolic Logic 60 (1):199 - 208.
Recursive functionals.Luis E. Sanchis - 1992 - New York: North-Holland.
Degrees of Relative Provability.Mingzhong Cai - 2012 - Notre Dame Journal of Formal Logic 53 (4):479-489.

Analytics

Added to PP
2010-08-24

Downloads
12 (#1,079,336)

6 months
8 (#351,492)

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

No references found.

Add more references