G. Kreisel. Some reasons for generalizing recursion theory. Logic colloquium '69, Proceedings of the summer school and colloquium in mathematical logic, Manchester, August 1969, edited by R. O. Gandy and C. E. M. Yates, Studies in logic and the foundations of mathematics, vol. 61, North-Holland Publishing Company, Amsterdam and London1971, pp. 139–198 [Book Review]

Journal of Symbolic Logic 40 (2):230-232 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271903

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,314

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

Daniel Lacombe. Recursion theoretic structure for relational systems. Logic colloquium '69, Proceedings of the summer school and colloquium in mathematical logic, Manchester, August 1969, edited by R. O. Gandy and C. E. M. Yates, Studies in logic and the foundations of mathematics, vol. 61, North-Holland Publishing Company, Amsterdam and London1971, pp. 3–17. [REVIEW]Carl E. Gordon - 1975 - Journal of Symbolic Logic 40 (3):454-455.
J. R. Shoenfield. Measurable cardinals. Logic colloquium '69, Proceedings of the summer school and colloquium in mathematical logic, Manchester, August 1969, edited by R. O. Gandy and C. E. M. Yates, Studies in logic and the foundations of mathematics, vol. 61, North-Holland Publishing Company, Amsterdam and London1971, pp. 19–49. [REVIEW]Kenneth Kunen - 1975 - Journal of Symbolic Logic 40 (1):93-94.
C. E. M. Yates. Recursively enumerable degrees and the degrees less than 0. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 264–271. [REVIEW]S. K. Thomason - 1970 - Journal of Symbolic Logic 35 (4):589-589.
J. C. E. Dekker. Regressive isols. Sets, models and recursion theory. Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 272–296. [REVIEW]C. E. Bredlau - 1969 - Journal of Symbolic Logic 34 (3):519-519.
R. O. Gandy. Computable functionals of finite type I. Sets, models and recursion theory. Proceedings of the Summer School In Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 202–242. [REVIEW]Richard A. Platek - 1970 - Journal of Symbolic Logic 35 (1):157-158.
Jensen R. B.. Concrete models of set theory. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by Crossley John N., Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 44–74. [REVIEW]Frank R. Drake - 1970 - Journal of Symbolic Logic 35 (3):472-473.
Moschovakis J. R.. Disjunction and existence in formalized intuitionistic analysis. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by Crossley John N., Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 309–331. [REVIEW]W. A. Howard - 1970 - Journal of Symbolic Logic 35 (4):587-588.
Karp Carol. A proof of the relative consistency of the continuum hypothesis. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by Crossley John N., Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 1–32. [REVIEW]Leslie H. Tharp - 1970 - Journal of Symbolic Logic 35 (2):344-345.
Martin-Löf Per. An intuitionistic theory of types: predicative part. Logic colloquium '73, Proceedings of the logic colloquium, Bristol, July 1973, edited by Rose H. E. and Shepherdson J. C., Studies in logic and the foundations of mathematics, vol. 80, North-Holland Publishing Company, Amsterdam and Oxford, and American Elsevier Publishing Company, New York, 1975, pp. 73–118. [REVIEW]Wim Veldman - 1984 - Journal of Symbolic Logic 49 (1):311-313.
Gerald E. Sacks. Metarecursively enumerable sets and admissible ordinals. Bulletin of the American Mathematical Society, vol. 72 , pp. 59–64. - Gerald E. Sacks. Post's problem, admissible ordinals, and regularity. Transactions of the American Mathematical Society, vol. 124 , pp. 1–23. - Gerald E. Sacks. Metarecursion theory. Sets, models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Leicester, August-September 1965, edited by John N. Crossley, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam, and Humanities Press, New York, 1967, pp. 243–263. - Graham C. DriscollJr., Metarecursively enumerable sets and their metadegrees. The Journal of symbolic logic, vol. 33 , pp. 389–11. [REVIEW]Richard A. Platek - 1969 - Journal of Symbolic Logic 34 (1):115-116.

Analytics

Added to PP
2013-11-02

Downloads
130 (#178,479)

6 months
16 (#194,914)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
Hyperhypersimple sets and Δ2 systems.C. T. Chong - 1989 - Annals of Pure and Applied Logic 44 (1-2):25-38.
Computability in partial combinatory algebras.Sebastiaan A. Terwijn - 2020 - Bulletin of Symbolic Logic 26 (3-4):224-240.

View all 8 citations / Add more citations

References found in this work

No references found.

Add more references