Cut elimination and complexity bounds for intuitionistic epistemic logic

DOI10.1093/logcom/exaa012OpenAlexW3008372586WikidataQ126405904 ScholiaQ126405904MaRDI QIDQ5108026

Vladimir Nikolaevich Krupskiĭ

Publication date: 29 April 2020

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exaa012

zbMATH Keywords

modal logicsequent calculuscut-eliminationPSPACEintuitionistic epistemic logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (1)

Constructive and mechanised meta-theory of intuitionistic epistemic logic

This page was built for publication: Cut elimination and complexity bounds for intuitionistic epistemic logic