Streamlined subrecursive degree theory

, &
Annals of Pure and Applied Logic 163 (6):698-716 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2011.11.004

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,505

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

Andreas Weiermann. Sometimes slow growing is fast growing. Annals of pure and applied logic, vol. 90 (1997) pp. 91–99.Martin Ruckert - 2000 - Bulletin of Symbolic Logic 6 (2):222-223.
Degree theory on ℵω.C. T. Chong & Sy D. Friedman - 1983 - Annals of Pure and Applied Logic 24 (1):87-97.
Jan Krajíèek.Gaisi Takeuti - 1991 - Annals of Pure and Applied Logic 52:143-153.
Andreas Blass. Selective ultrafilters and homogeneity. Annals of pure and applied logic, vol. 38 , pp. 215–255. - Claude Laflamme. Forcing with filters and complete combinatorics. Annals of pure and applied logic, vol. 42 , pp. 125–163. [REVIEW]Peter J. Nyikos - 1991 - Journal of Symbolic Logic 56 (4):1490-1492.
The degree of a Σn cut.C. T. Chong & K. J. Mourad - 1990 - Annals of Pure and Applied Logic 48 (3):227-235.
Jan Krajíček. On the number of steps in proofs. Annals of pure and applied logic, vol. 41 , pp. 153–178.William M. Farmer - 1991 - Journal of Symbolic Logic 56 (1):334-335.
Jan von Plato. The axioms of constructive geometry. Annals of pure and applied logic, vol. 76 , pp. 169–200.Wolfgang Rautenberg - 1997 - Journal of Symbolic Logic 62 (2):687-688.
Erratum to “computable isomorphisms, degree spectra of relations, and Scott families” [ann. pure appl. logic 93 (1998) 153–193]. [REVIEW]Bakhadyr Khoussainov & Richard A. Shore - 1999 - Annals of Pure and Applied Logic 98 (1-3):297-298.
Intuitionistic formal theories with realizability in subrecursive classes.Anatoly Petrovich Beltiukov - 1997 - Annals of Pure and Applied Logic 89 (1):3-15.
Andreas Weiermann. How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study. The journal of symbolic logic, vol. 63 (1998), pp. 1348–1370. [REVIEW]Thomas Strahm - 2002 - Bulletin of Symbolic Logic 8 (3):435-436.

Analytics

Added to PP
2013-10-27

Downloads
45 (#495,167)

6 months
12 (#302,973)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Proof lengths for instances of the Paris–Harrington principle.Anton Freund - 2017 - Annals of Pure and Applied Logic 168 (7):1361-1382.
Degrees of Relative Provability.Mingzhong Cai - 2012 - Notre Dame Journal of Formal Logic 53 (4):479-489.

View all 6 citations / Add more citations

References found in this work

A jump operator on honest subrecursive degrees.Lars Kristiansen - 1998 - Archive for Mathematical Logic 37 (2):105-125.
A Classification of the Recursive Functions.Albert R. Meyer & Dennis M. Ritchie - 1972 - Mathematical Logic Quarterly 18 (4‐6):71-82.
A Classification of the Recursive Functions.Albert R. Meyer & Dennis M. Ritchie - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (4-6):71-82.
Subrecursive degrees and fragments of Peano Arithmetic.Lars Kristiansen - 2001 - Archive for Mathematical Logic 40 (5):365-397.

Add more references