A degree-theoretic definition of the ramified analytical hierarchy

&
Annals of Mathematical Logic 10 (1):1-32 (1976)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(76)90023-1

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,902

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

Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Countable algebra and set existence axioms. Annals of pure and applied logic, vol. 25 , pp. 141–181. - Harvey M. Friedman, Stephen G. Simpson, and Rick L. Smith. Addendum to “Countable algebra and set existence axioms.” Annals of pure and applied logic, vol. 28 , pp. 319–320. [REVIEW]Peter G. Clote - 1987 - Journal of Symbolic Logic 52 (1):276-278.
Stephen G. Simpson. Subsystems of second order arithmetic. Perspectives in mathematical logic. Springer, Berlin, Heidelberg, New York, etc., 1999, xiv + 445 pp. [REVIEW]Peter Cholak - 1999 - Journal of Symbolic Logic 64 (3):1356-1357.
Hempel Carl G. and Oppenheim Paul. A definition of “degree of confirmation.” Philosophy of science, vol. 12 , pp. 98–115. [REVIEW]Max Black - 1946 - Journal of Symbolic Logic 11 (1):18-19.
Countable ordinals and the analytical hierarchy, II.Alexander S. Kechris - 1978 - Annals of Mathematical Logic 15 (3):193.
Systems of notations and the ramified analytical hierarchy.Joan D. Lukas & Hilary Putnam - 1974 - Journal of Symbolic Logic 39 (2):243-253.
Stephen G. Simpson. Friedman's research on subsystems of second order arithmetic. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. S̆c̆edrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 137–159. [REVIEW]Wilfried Sieg - 1990 - Journal of Symbolic Logic 55 (2):870-874.
Degrees of isomorphism types and countably categorical groups.Aleksander Ivanov - 2012 - Archive for Mathematical Logic 51 (1):93-98.
Stephen G. Simpson. Nonprovability of certain combinatorial properties of finite trees. Harvey Friedman's research on the foundations of mathematics, edited by L. A. Harrington, M. D. Morley, A. Ṧčedrov, and S. G. Simpson, Studies in logic and the foundations of mathematics, vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, pp. 87–117. , pp. 45–65.). [REVIEW]W. Buchholz - 1990 - Journal of Symbolic Logic 55 (2):868-869.
Hempel. Carl G. A purely syntactical definition of confirmation.Max Black - 1944 - Journal of Symbolic Logic 9 (2):47-47.
Stephen G. Simpson subsystems of second-order arithmetic.Jeffrey Ketland - 2001 - British Journal for the Philosophy of Science 52 (1):191-195.

Analytics

Added to PP
2014-01-17

Downloads
26 (#844,747)

6 months
9 (#464,038)

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.

View all 22 citations / Add more citations

References found in this work

Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Distributive Initial Segments of the Degrees of Unsolvability.A. H. Lachlan - 1968 - Mathematical Logic Quarterly 14 (30):457-472.
Distributive Initial Segments of the Degrees of Unsolvability.A. H. Lachlan - 1968 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (30):457-472.

View all 18 references / Add more references