Book contents
- Frontmatter
- Introduction
- Contents
- K. Jon Barwise (1942-2000)
- TUTORIALS
- PHOTOGRAPHS
- ARTICLES
- Bounded forcing axioms and the size of the continuum
- Hilbert's wide program
- Rigidity conjectures
- Metapredicative and explicit Mahlo: a proof-theoretic perspective
- A two-dimensional tree ideal
- Psychology looks hopefully to logic
- Russell's logics
- Partitioning pairs of uncountable sets
- Aspects of the Turing jump
- Liouville functions
- References
Aspects of the Turing jump
from ARTICLES
Published online by Cambridge University Press: 27 June 2017
Book contents
- Frontmatter
- Introduction
- Contents
- K. Jon Barwise (1942-2000)
- TUTORIALS
- PHOTOGRAPHS
- ARTICLES
- Bounded forcing axioms and the size of the continuum
- Hilbert's wide program
- Rigidity conjectures
- Metapredicative and explicit Mahlo: a proof-theoretic perspective
- A two-dimensional tree ideal
- Psychology looks hopefully to logic
- Russell's logics
- Partitioning pairs of uncountable sets
- Aspects of the Turing jump
- Liouville functions
- References
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Logic Colloquium 2000 , pp. 365 - 382Publisher: Cambridge University PressPrint publication year: 2005
References
[1950], On the theory of recursive unsolvability, Ph.D. thesis, Princeton University.
[1957], A criterion for completeness of degrees of unsolvability, The Journal of Symbolic Logic, vol. 22, pp. 159–160.Google Scholar
, and [1984], Pseudo-jump operators II: Transfinite iterations, hierarchies, and minimal covers, The Journal of Symbolic Logic, vol. 49, pp. 1205–1236.
and [1978], The Victoria Delfino problems, Cabal seminar 76–77 ( and , editors), Lecture Notes in Mathematics, vol. 689, Springer-Verlag, Heidelberg, pp. 279–282.
and [1981], Degrees joining to, The Journal of Symbolic Logic, vol. 46, no. 4, pp. 714–722.Google Scholar
, [1967], Some problems of definability in recursive function theory, Sets models and recursion theory, Proceedings of the Summer School in Mathematical Logic and Tenth Logic Colloquium, Lercester,August–September 1965 (, editor), North-Holland Publishing Co.
[1990], Higher recursion theory, Springer-Verlag, Berlin.
and [1999], Defining the Turing jump, Mathematical Research Letters, vol. 6, pp. 711–722.Google Scholar
and [1981], Complementation in the Turing degrees, The Journal of Symbolic Logic, vol. 54, no. 1, pp. 160–176.Google Scholar
[1955], Recursive well-orderings, The Journal of Symbolic Logic, vol. 20, pp. 151–163.Google Scholar