Friedberg Numbering in Fragments of Peano Arithmetic and α-Recursion Theory

Journal of Symbolic Logic 78 (4):1135-1163 (2013)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2178/jsl.7804060

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 103,748

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

Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic.Robert A. Di Paola & Franco Montagna - 1991 - Journal of Symbolic Logic 56 (2):643-660.
On nested simple recursion.Ján Komara - 2011 - Archive for Mathematical Logic 50 (5-6):617-624.
Peano arithmetic, games and descent recursion.Emanuele Frittaion - 2025 - Annals of Pure and Applied Logic 176 (4):103550.
On generalized computational complexity.Barry E. Jacobs - 1977 - Journal of Symbolic Logic 42 (1):47-58.
An extension of the nondiamond theorem in classical and α-recursion theory.Klaus Ambos-Spies - 1984 - Journal of Symbolic Logic 49 (2):586-607.
Reflection Principles in Fragments of Peano Arithmetic.Hiroakira Ono - 1987 - Mathematical Logic Quarterly 33 (4):317-333.
The uniform regular set theorem in α-recursion theory.Wolfgang Maass - 1978 - Journal of Symbolic Logic 43 (2):270-279.
Peano arithmetic may not be interpretable in the monadic theory of linear orders.Shmuel Lifsches & Saharon Shelah - 1997 - Journal of Symbolic Logic 62 (3):848-872.
On predicate provability logics and binumerations of fragments of Peano arithmetic.Taishi Kurahashi - 2013 - Archive for Mathematical Logic 52 (7-8):871-880.
Existentially Closed Models in the Framework of Arithmetic.Zofia Adamowicz, Andrés Cordón-Franco & F. Félix Lara-martín - 2016 - Journal of Symbolic Logic 81 (2):774-788.

Analytics

Added to PP
2016-06-30

Downloads
17 (#1,227,964)

6 months
4 (#970,122)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Wei Li

Citations of this work

Add more citations

References found in this work

The α-finite injury method.G. E. Sacks & S. G. Simpson - 1972 - Annals of Mathematical Logic 4 (4):343-367.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
The degree of a Σn cut.C. T. Chong & K. J. Mourad - 1990 - Annals of Pure and Applied Logic 48 (3):227-235.
Some minimal pairs of alpha-recursively enumerable degrees.Manuel Lerman - 1972 - Annals of Mathematical Logic 4 (4):415.

Add more references