- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Axiomatization of provable n-provability
Journal of Symbolic Logic 84 (2):849-869 (2019)
Abstract
This article has no associated abstract. (fix it)Author's Profile
Other Versions
No versions found
My notes
Similar books and articles
Lev D. Beklemishev. Induction rules, reflection principles, and provably recursive functions. Annals of pure and applied logic, vol. 85 , pp. 193–242. [REVIEW]Volker Halbach - 2002 - Bulletin of Symbolic Logic 8 (2):302-303.
Completeness of the Gödel–Löb Provability Logic for the Filter Sequence of Normal Measures.Mohammad Golshani & Reihane Zoghifard - 2024 - Journal of Symbolic Logic 89 (1):163-174.
Two new series of principles in the interpretability logic of all reasonable arithmetical theories.Evan Goris & Joost J. Joosten - 2020 - Journal of Symbolic Logic 85 (1):1-25.
The polytopologies of transfinite provability logic.David Fernández-Duque - 2014 - Archive for Mathematical Logic 53 (3-4):385-431.
Provability, complexity, grammars.Lev Dmitrievich Beklemishev - 1999 - Providence, RI: American Mathematical Society. Edited by Mati Reĭnovich Pentus & Nikolai Konstantinovich Vereshchagin.
Review: Sergei N. Artemov, Explicit Provability and Constructive Semantics. [REVIEW]Jeremy D. Avigad - 2002 - Bulletin of Symbolic Logic 8 (3):432-433.
On first-order theories with provability operator.Sergei Artëmov & Franco Montagna - 1994 - Journal of Symbolic Logic 59 (4):1139-1153.
On strong provability predicates and the associated modal logics.Konstantin N. Ignatiev - 1993 - Journal of Symbolic Logic 58 (1):249-290.
Analytics
Added to PP
2019-02-10
Downloads
38 (#595,594)
6 months
7 (#718,806)
2019-02-10
Downloads
38 (#595,594)
6 months
7 (#718,806)
Historical graph of downloads
Author's Profile
Citations of this work
Hierarchical Incompleteness Results for Arithmetically Definable Extensions of Fragments of Arithmetic.Rasmus Blanck - 2021 - Review of Symbolic Logic 14 (3):624-644.
On Shavrukov’s Non-Isomorphism Theorem for Diagonalizable Algebras.Evgeny A. Kolmakov - 2024 - Review of Symbolic Logic 17 (1):206-243.
Local reflection, definable elements and 1-provability.Evgeny Kolmakov - 2020 - Archive for Mathematical Logic 59 (7-8):979-996.
References found in this work
Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems.G. Kreisel & A. Lévy - 1968 - Mathematical Logic Quarterly 14 (7-12):97-142.
Reflection Principles and Their Use for Establishing the Complexity of Axiomatic Systems.Georg Kreisel & Azriel Lévy - 1968 - Zeitschrift für Mathematische Logic Und Grundlagen der Mathematik 14 (1):97--142.
Proof-theoretic analysis by iterated reflection.Lev D. Beklemishev - 2003 - Archive for Mathematical Logic 42 (6):515-552.
Induction rules, reflection principles, and provably recursive functions.Lev D. Beklemishev - 1997 - Annals of Pure and Applied Logic 85 (3):193-242.
Provability algebras and proof-theoretic ordinals, I.Lev D. Beklemishev - 2004 - Annals of Pure and Applied Logic 128 (1-3):103-123.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-648784bb4d-xlp8h uwo