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)
| Abstract | This article has no associated abstract. (fix it) | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,679 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesJoseph Barback (1994). Torre Models in the Isols. Journal of Symbolic Logic 59 (1):140-150.
Marcia J. Groszek, Michael E. Mytilinaios & Theodore A. Slaman (1996). The Sacks Density Theorem and Σ2-Bounding. Journal of Symbolic Logic 61 (2):450 - 467.
Michael E. Mytilinaios & Theodore A. Slaman (1988). Σ2-Collection and the Infinite Injury Priority Method. Journal of Symbolic Logic 53 (1):212 - 221.
Stewart Shapiro (2002). Incompleteness and Inconsistency. Mind 111 (444):817-832.
Stephan Wehner (1999). On Recursive Enumerability with Finite Repetitions. Journal of Symbolic Logic 64 (3):927-945.
Kenneth McAloon (1982). On the Complexity of Models of Arithmetic. Journal of Symbolic Logic 47 (2):403-415.
Noam Greenberg (2005). The Role of True Finiteness in the Admissible Recursively Enumerable Degrees. Bulletin of Symbolic Logic 11 (3):398-410.
Albert Visser (1984). The Provability Logics of Recursively Enumerable Theories Extending Peano Arithmetic at Arbitrary Theories Extending Peano Arithmetic. Journal of Philosophical Logic 13 (1):97 - 113.
Iraj Kalantari & Allen Retzlaff (1979). Recursive Constructions in Topological Spaces. Journal of Symbolic Logic 44 (4):609-625.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #274,830 of 549,084 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
