arXiv Analytics

Sign in

arXiv:1704.07678 [math.LO]AbstractReferencesReviewsResources

Provability Logics of Hierarchies

Amirhossein Akbar Tabatabai

Published 2017-04-20Version 1

The branch of provability logic investigates the provability-based behavior of the mathematical theories. In a more precise way, it studies the relation between a mathematical theory $T$ and a modal logic $L$ via the provability interpretation which interprets the modality as the provability predicate of $T$. In this paper we will extend this relation to investigate the provability-based behavior of a hierarchy of theories. More precisely, using the modal language with infinitely many modalities, $\{\Box_n\}_{n=0}^{\infty}$, we will define the hierarchical counterparts of some of the classical modal theories such as $\mathbf{K4}$, $\mathbf{KD4}$, $\mathbf{GL}$ and $\mathbf{S4}$. Then we will define their canonical provability interpretations and their corresponding soundness-completeness theorems.

Related articles: Most relevant | Search more
arXiv:1307.4692 [math.LO] (Published 2013-07-17, updated 2015-02-18)
A mathematical theory of truth and an application to the regress problem
arXiv:2309.05948 [math.LO] (Published 2023-09-12)
Semantical cut-elimination for the provability logic of true arithmetic
arXiv:1511.05882 [math.LO] (Published 2015-11-18)
Strong Completeness of Provability Logic for Ordinal Spaces