Journal of Symbolic Logic 67 (1):260-278 (2002)
|Abstract||In this article we provide wellordering proofs for metapredicative systems of explicit mathematics and admissible set theory featuring suitable axioms about the Mahloness of the underlying universe of discourse. In particular, it is shown that in the corresponding theories EMA of explicit mathematics and KPm 0 of admissible set theory, transfinite induction along initial segments of the ordinal φω00, for φ being a ternary Veblen function, is derivable. This reveals that the upper bounds given for these two systems in the paper Jager and Strahm  are indeed sharp|
|Keywords||No keywords specified (fix it)|
|Through your library||Configure|
Similar books and articles
Jan Krajíček (1995). Bounded Arithmetic, Propositional Logic, and Complexity Theory. Cambridge University Press.
Michael Rathjen (1999). Explicit Mathematics with the Monotone Fixed Point Principle. II: Models. Journal of Symbolic Logic 64 (2):517-550.
James Robert Brown (1999). Philosophy of Mathematics: An Introduction to the World of Proofs and Pictures. Routledge.
Jeremy Avigad (2002). An Ordinal Analysis of Admissible Set Theory Using Recursion on Ordinal Notations. Journal of Mathematical Logic 2 (01):91-112.
Maria Bonet, Toniann Pitassi & Ran Raz (1997). Lower Bounds for Cutting Planes Proofs with Small Coefficients. Journal of Symbolic Logic 62 (3):708-728.
Kenny Easwaran (2009). Probabilistic Proofs and Transferability. Philosophia Mathematica 17 (3):341-362.
Alexander S. Kechris (1978). The Perfect Set Theorem and Definable Wellorderings of the Continuum. Journal of Symbolic Logic 43 (4):630-634.
Gerhard Jäger & Thomas Strahm (2001). Upper Bounds for Metapredicative Mahlo in Explicit Mathematics and Admissible Set Theory. Journal of Symbolic Logic 66 (2):935-958.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #274,830 of 549,087 )
Recent downloads (6 months)0
How can I increase my downloads?