Upper Bounds for metapredicative mahlo in explicit mathematics and admissible set theory
Journal of Symbolic Logic 66 (2):935-958 (2001)
| Abstract | In this article we introduce systems for metapredicative Mahlo in explicit mathematics and admissible set theory. The exact upper proof-theoretic bounds of these systems are established | |||||||||
| 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,709 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesT. A. Slaman (1986). ∑1 Definitions with Parameters. Journal of Symbolic Logic 51 (2):453 - 461.
Gerhard Jäger (1997). Power Types in Explicit Mathematics? Journal of Symbolic Logic 62 (4):1142-1146.
Alistair H. Lachlan & Robert I. Soare (1994). Models of Arithmetic and Upper Bounds for Arithmetic Sets. Journal of Symbolic Logic 59 (3):977-983.
Thomas Glass (1996). On Power Set in Explicit Mathematics. Journal of Symbolic Logic 61 (2):468-489.
Harold T. Hodes (1983). More About Uniform Upper Bounds on Ideals of Turing Degrees. Journal of Symbolic Logic 48 (2):441-457.
Harold T. Hodes (1981). Upper Bounds on Locally Countable Admissible Initial Segments of a Turing Degree Hierarchy. Journal of Symbolic Logic 46 (4):753-760.
Michael Rathjen (1999). Explicit Mathematics with the Monotone Fixed Point Principle. II: Models. Journal of Symbolic Logic 64 (2):517-550.
Sy D. Friedman (1979). HC of an Admissible Set. Journal of Symbolic Logic 44 (1):95-102.
Thomas Strahm (2002). Wellordering Proofs for Metapredicative Mahlo. Journal of Symbolic Logic 67 (1):260-278.
Analytics
Monthly downloads
Sorry, there are not enough data points to plot this chart.
|
Added to index2009-01-28Total downloads1 ( #275,053 of 550,854 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
