Joseph Barback. An md-class of sets indexed by a regressive function. The journal of the Australian Mathematical Society, vol. 7 (1967), pp. 301–310 [Book Review]

&
Journal of Symbolic Logic 35 (1):157-157 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271215

Links

PhilArchive



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

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: R. O. Gandy, John N. Crossley, Computable Functionals of Finite Type I. [REVIEW]Richard A. Platek - 1970 - Journal of Symbolic Logic 35 (1):157-158.
Review: S. C. Kleene, Ernest Nagel, Patrick Suppes, Alfred Tarski, Turing-Machine Computable Functionals of Finite Types I; S. C. Kleene, Turing-Machine Computable Functionals of Finite Types II. [REVIEW]D. A. Clarke - 1970 - Journal of Symbolic Logic 35 (4):588-589.
Equivalence of bar recursors in the theory of functionals of finite type.Marc Bezem - 1988 - Archive for Mathematical Logic 27 (2):149-160.
The hereditary partial effective functionals and recursion theory in higher types.G. Longo & E. Moggi - 1984 - Journal of Symbolic Logic 49 (4):1319-1332.
The sequentially realizable functionals.John Longley - 2002 - Annals of Pure and Applied Logic 117 (1-3):1-93.
A restricted computation model on Scott domains and its partial primitive recursive functionals.Karl-Heinz Niggl - 1998 - Archive for Mathematical Logic 37 (7):443-481.
Computable choice functions for computable linear orderings.Manuel Lerman & Richard Watnick - 2003 - Mathematical Logic Quarterly 49 (5):485-510.
Finite computable dimension does not relativize.Charles F. D. McCoy - 2002 - Archive for Mathematical Logic 41 (4):309-320.
Strongly majorizable functionals of finite type: A model for barrecursion containing discontinuous functionals.Marc Bezem - 1985 - Journal of Symbolic Logic 50 (3):652-660.
Turing-Machine Computable Functionals of Finite Types I.S. C. Kleene, Ernest Nagel, Patrick Suppes & Alfred Tarski - 1970 - Journal of Symbolic Logic 35 (4):588-589.
The Block Relation in Computable Linear Orders.Michael Moses - 2011 - Notre Dame Journal of Formal Logic 52 (3):289-305.
Approaches to Effective Semi‐Continuity of Real Functions.Xizhong Zheng, Vasco Brattka & Klaus Weihrauch - 1999 - Mathematical Logic Quarterly 45 (4):481-496.
Recursion on the countable functionals.Dag Normann - 1980 - New York: Springer Verlag.
Intensional interpretations of functionals of finite type I.W. W. Tait - 1967 - Journal of Symbolic Logic 32 (2):198-212.
Injecting uniformities into Peano arithmetic.Fernando Ferreira - 2009 - Annals of Pure and Applied Logic 157 (2-3):122-129.

Analytics

Added to PP
2015-02-05

Downloads
10 (#1,129,009)

6 months
4 (#698,851)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Finite notations for infinite terms.Helmut Schwichtenberg - 1998 - Annals of Pure and Applied Logic 94 (1-3):201-222.

Add more citations

References found in this work

No references found.

Add more references