Recursion in Objects of Finite Type

Journal of Symbolic Logic 39 (2):343-344 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,283

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Control structures in programs and computational complexity.Karl-Heinz Niggl - 2005 - Annals of Pure and Applied Logic 133 (1-3):247-273.
Equivalence of bar recursors in the theory of functionals of finite type.Marc Bezem - 1988 - Archive for Mathematical Logic 27 (2):149-160.
Infinite Versions of Some Problems from Finite Complexity Theory.Jeffry L. Hirst & Steffen Lempp - 1996 - Notre Dame Journal of Formal Logic 37 (4):545-553.
Safe recursion with higher types and BCK-algebra.Martin Hofmann - 2000 - Annals of Pure and Applied Logic 104 (1-3):113-166.
Hierarchies based on objects of finite type.Thomas J. Grilliot - 1969 - Journal of Symbolic Logic 34 (2):177-182.
Unimonotone functions of finite types (recursive functionals and quantifiers of finite types revisited IV).S. C. Kleene - 1985 - In Anil Nerode & Richard A. Shore (eds.), Recursion theory. Providence, R.I.: American Mathematical Society. pp. 42--119.
A decidable theory of type assignment.William R. Stirton - 2013 - Archive for Mathematical Logic 52 (5-6):631-658.
Locally finite weakly minimal theories.James Loveys - 1991 - Annals of Pure and Applied Logic 55 (2):153-203.

Analytics

Added to PP
2015-02-05

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
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