Complexity of the variable-free fragment of the weak Grzegorczyk logic
From MaRDI portal
Publication:6418549
arXiv2211.14571MaRDI QIDQ6418549FDOQ6418549
Irina Agadzhanian, Mikhail Rybakov
Publication date: 26 November 2022
Abstract: The paper proves PSPACE-hardness of variable-free fragments of all logics between K and wGrz.
This page was built for publication: Complexity of the variable-free fragment of the weak Grzegorczyk logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6418549)
