First non-labelled sequent calculi for CS, CSM, ER bimodal provability logics with cut-elimination and uniform Lyndon interpolation.
A proof of cut-elimination theorem in simple type-theory.Journal of the Mathe- matical Society of Japan, 19(4):399–410
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
baseline 1
citation-polarity summary
fields
math.LO 1years
2026 1verdicts
UNVERDICTED 1roles
baseline 1polarities
baseline 1representative citing papers
citing papers explorer
-
Proof Theory for Bimodal Provability Logics
First non-labelled sequent calculi for CS, CSM, ER bimodal provability logics with cut-elimination and uniform Lyndon interpolation.