Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic

&
Journal of Symbolic Logic 56 (2):643-660 (1991)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2274707

Links

PhilArchive



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

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.
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.
More existence theorems for recursion categories.Florian Lengyel - 2004 - Annals of Pure and Applied Logic 125 (1-3):1-41.
Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic.Grzegorz Michalski - 1995 - Mathematical Logic Quarterly 41 (4):515-522.
Complete, Recursively Enumerable Relations in Arithmetic.Giovanna D'Agostino & Mario Magnago - 1995 - Mathematical Logic Quarterly 41 (1):65-72.
Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Recursive constructions in topological spaces.Iraj Kalantari & Allen Retzlaff - 1979 - Journal of Symbolic Logic 44 (4):609-625.
Recursively Enumerable Equivalence Relations Modulo Finite Differences.André Nies - 1994 - Mathematical Logic Quarterly 40 (4):490-518.
The provability logics of recursively enumerable theories extending peano arithmetic at arbitrary theories extending peano arithmetic.Albert Visser - 1984 - Journal of Philosophical Logic 13 (1):97 - 113.
On the complexity of models of arithmetic.Kenneth McAloon - 1982 - Journal of Symbolic Logic 47 (2):403-415.
The role of true finiteness in the admissible recursively enumerable degrees.Noam Greenberg - 2005 - Bulletin of Symbolic Logic 11 (3):398-410.
On recursive enumerability with finite repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
On Recursive Enumerability with Finite Repetitions.Stephan Wehner - 1999 - Journal of Symbolic Logic 64 (3):927-945.
The Sacks density theorem and Σ2-bounding.Marcia J. Groszek, Michael E. Mytilinaios & Theodore A. Slaman - 1996 - Journal of Symbolic Logic 61 (2):450 - 467.
Torre models in the isols.Joseph Barback - 1994 - Journal of Symbolic Logic 59 (1):140-150.

Analytics

Added to PP
2017-04-23

Downloads
15 (#923,100)

6 months
3 (#992,474)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Introduction to Turing categories.J. Robin B. Cockett & Pieter Jw Hofstra - 2008 - Annals of Pure and Applied Logic 156 (2):183-209.
More existence theorems for recursion categories.Florian Lengyel - 2004 - Annals of Pure and Applied Logic 125 (1-3):1-41.

Add more citations

References found in this work

On certain lattices of degrees of interpretability.Per Lindström - 1984 - Notre Dame Journal of Formal Logic 25 (2):127-140.
"Pathologies" in two syntactic categories of partial maps.Franco Montagna - 1988 - Notre Dame Journal of Formal Logic 30 (1):105-116.

Add more references