A note on the hyperarithmetical hierarchy

Journal of Symbolic Logic 35 (3):429-430 (1970)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

An introduction to hyperarithmetical functions.Julia Robinson - 1967 - Journal of Symbolic Logic 32 (3):325-342.
A note on the arithmetical hierarchy.Stephen L. Bloom - 1968 - Notre Dame Journal of Formal Logic 9 (1):89-91.
Recursive linear orderings and hyperarithmetical functions.Shih-Chao Liu - 1962 - Notre Dame Journal of Formal Logic 3 (3):129-132.
Computable structures and the hyperarithmetical hierarchy.C. J. Ash - 2000 - New York: Elsevier. Edited by J. Knight.

Analytics

Added to PP
2009-01-28

Downloads
44 (#351,926)

6 months
9 (#298,039)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.
A fixed point for the jump operator on structures.Antonio Montalbán - 2013 - Journal of Symbolic Logic 78 (2):425-438.
Reals n-Generic Relative to Some Perfect Tree.Bernard A. Anderson - 2008 - Journal of Symbolic Logic 73 (2):401 - 411.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references