Recursive Equivalence Types and Combinatorial Functions

Journal of Symbolic Logic 31 (3):510-511 (1966)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270491

Links

PhilArchive



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

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

Review: John Myhill, Recursive Equivalence Types and Combinatorial Functions. [REVIEW]J. C. E. Dekker - 1966 - Journal of Symbolic Logic 31 (3):510-511.
Hyper-Torre isols.Erik Ellentuck - 1981 - Journal of Symbolic Logic 46 (1):1-5.
Combinatorial Series and Recursive Equivalence Types.A. B. Manaster - 1968 - Journal of Symbolic Logic 33 (4):620-621.
Myhill's work in recursion theory.J. C. E. Dekker & E. Ellentuck - 1992 - Annals of Pure and Applied Logic 56 (1-3):43-71.
Recursive Equivalence Types.J. C. E. Dekker & J. Myhill - 1960 - Journal of Symbolic Logic 25 (4):356-359.
Recursive equivalence types on recursive manifolds.Leon W. Harkleroad - 1979 - Notre Dame Journal of Formal Logic 20 (1):1-31.
Subsystems of true arithmetic and hierarchies of functions.Z. Ratajczyk - 1993 - Annals of Pure and Applied Logic 64 (2):95-152.
On Evolving of Recursive Functions using λ-abstraction and Higher-order Functions.Martin Dostál - 2005 - Logic Journal of the IGPL 13 (5):515-524.
Review: John N. Crossley, Recursive equivalence: A survey; John N. Crossley, Recursive equivalence. [REVIEW]Alfred B. Manaster - 1972 - Journal of Symbolic Logic 37 (2):406-407.
Accessible recursive functions.Stanley S. Wainer - 1999 - Bulletin of Symbolic Logic 5 (3):367-388.
Computability of Real Numbers by Using a Given Class of Functions in the Set of the Natural Numbers.Dimiter Skordev - 2002 - Mathematical Logic Quarterly 48 (S1):91-106.
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge, Mass.: MIT Press.
Formal systems and recursive functions.John N. Crossley & Michael Dummett (eds.) - 1965 - Amsterdam,: North-Holland Pub. Co..
Additive Relations Among Recursive Equivalence Types.A. Nerode - 1970 - Journal of Symbolic Logic 35 (4):589-590.
Infinite products of recursive equivalence types.Don C. Ferguson - 1968 - Journal of Symbolic Logic 33 (2):221-230.

Analytics

Added to PP
2015-02-05

Downloads
11 (#1,075,532)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Cancellation laws for polynomial-time p-isolated sets.John N. Crossley & J. B. Remmel - 1992 - Annals of Pure and Applied Logic 56 (1-3):147-172.
Myhill's work in recursion theory.J. C. E. Dekker & E. Ellentuck - 1992 - Annals of Pure and Applied Logic 56 (1-3):43-71.
Model theoretic methods in the theory of isols.Erik Ellentuck - 1978 - Annals of Mathematical Logic 14 (3):273-285.

Add more citations

References found in this work

No references found.

Add more references