Axiomatizing provable \(n\)-provability
type: Item
instance of: scholarly article
title: Axiomatizing provable \(n\)-provability
zbMATH Open document ID: 1484.03123
DOI: 10.1134/S1064562418070153
author: E. A. Kolmakov
author: Lev D. Beklemishev
published in: Doklady Mathematics
publication date: 2019-03-15T00:00:00Z
Mathematics Subject Classification ID: 03F30
Mathematics Subject Classification ID: 03F45
zbMATH DE Number: 7036528
MaRDI profile type: Publication
cites work: Parameter free induction and provably total computable functions
cites work: Proof-theoretic analysis by iterated reflection
cites work: Provability algebras and proof-theoretic ordinals. I
cites work: Reflection principles and provability algebras in formal arithmetic
cites work: On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories
cites work: Unprovability and proving unprovability
cites work: Transfinite recursive progressions of axiomatic theories
cites work: On strong provability predicates and the associated modal logics
cites work: Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
cites work: Self-reference and modal logic
cites work: Systems of Logic Based on Ordinals†
full work available at URL: s1064562418070153
OpenAlex ID: W2963720101
description: scientific article; zbMATH DE number 7036528