Axiomatizing provable \(n\)-provability (Q1732059)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Axiomatizing provable \(n\)-provability	scientific article

Statements

scholarly article

0 references

Axiomatizing provable \(n\)-provability (English)

0 references

0 references

Lev D. Beklemishev

0 references

Doklady Mathematics

0 references

publication date

15 March 2019

0 references

MaRDI profile type

MaRDI publication profile

0 references

Parameter free induction and provably total computable functions

0 references

Proof-theoretic analysis by iterated reflection

0 references

Provability algebras and proof-theoretic ordinals. I

0 references

Reflection principles and provability algebras in formal arithmetic

0 references

On the limit existence principles in elementary arithmetic and \(\varSigma_{n}^{0}\)-consequences of theories

0 references

Unprovability and proving unprovability

0 references

Transfinite recursive progressions of axiomatic theories

0 references

On strong provability predicates and the associated modal logics

0 references

Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems

0 references

Self-reference and modal logic

0 references

Systems of Logic Based on Ordinals<sup>†</sup>

0 references

full work available at URL

https://doi.org/10.1134/s1064562418070153

0 references

Identifiers

zbMATH Open document ID

0 references

10.1134/S1064562418070153

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1732059

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1732059&oldid=37072737"