Small recursive ordinals, many-one degrees, and the arithmetical difference hierarchy

Annals of Mathematical Logic 8 (3):297 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0003-4843(75)90005-4

Other Versions

No versions found

Links

PhilArchive



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

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

Stability of recursive structures in arithmetical degrees.C. J. Ash - 1986 - Annals of Pure and Applied Logic 32:113-135.
Ash, CJ, Stability of recursive structures in arithmetical degrees Ash, CJ, Categoric@ in hyperarithmetical degrees.D. Cenzer, P. Clote, R. L. Smith, S. S. Wainer, K. J. Compton, C. W. Henson & S. Shelah - 1988 - Annals of Pure and Applied Logic 40:307-310.
Countable ordinals and the analytical hierarchy, II.Alexander S. Kechris - 1978 - Annals of Mathematical Logic 15 (3):193.
Thin collections of sets of projective ordinals and analogs of L.Howard Becker - 1980 - Annals of Mathematical Logic 19 (3):205.
Thin collections of sets of projective ordinals and analogs of L.Howard Becker - 1980 - Annals of Mathematical Logic 19 (3):205-241.
ASH, CJ, Stability of recursive structures in arithmetical degrees BLASS, A. and GUREVICH, Y., Henkin quantifiers and complete problems BUCHHOLZ, W., A new system of proof-theoretic ordinal functions. [REVIEW]H. Friedman & Rc Flagg - 1986 - Annals of Pure and Applied Logic 32 (C):299.
Decidability, Recursive Enumerability and Kleene Hierarchy For L‐Subsets.Loredana Biacino & Giangiacomo Gerla - 1989 - Mathematical Logic Quarterly 35 (1):49-62.
Axt Paul. On a subrecursive hierarchy and primitive recursive degrees. Transactions of the American Mathematical Society, Bd. 92 , S. 85–105. [REVIEW]Rózsa Péter - 1960 - Journal of Symbolic Logic 25 (2):167-168.
The existence of high nonbounding degrees in the difference hierarchy.Chi Tat Chong, Angsheng Li & Yue Yang - 2006 - Annals of Pure and Applied Logic 138 (1):31-51.
Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.

Analytics

Added to PP
2014-01-17

Downloads
17 (#1,149,837)

6 months
5 (#1,038,502)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Borel ideals vs. Borel sets of countable relations and trees.Samy Zafrany - 1989 - Annals of Pure and Applied Logic 43 (2):161-195.
Recursive well-founded orderings.Keh-Hsun Chen - 1978 - Annals of Mathematical Logic 13 (2):117-147.

Add more citations

References found in this work

Recursive well-orderings.Clifford Spector - 1955 - Journal of Symbolic Logic 20 (2):151-163.
Number theoretic concepts and recursive well-orderings.G. Kreisel, J. Shoenfield & Hao Wang - 1960 - Archive for Mathematical Logic 5 (1-2):42-64.
The method of alternating chains.J. W. Addison - 1965 - In The theory of models. Amsterdam,: North-Holland Pub. Co.. pp. 1--16.
Index Sets Universal for Differences of Arithmetic Sets.Louise Hay - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (13-18):239-254.

View all 9 references / Add more references