Complexity of the variable-free fragment of the weak Grzegorczyk logic
Logic
2022-11-29 v1
Abstract
The paper proves PSPACE-hardness of variable-free fragments of all logics between K and wGrz.
Cite
@article{arxiv.2211.14571,
title = {Complexity of the variable-free fragment of the weak Grzegorczyk logic},
author = {Irina Agadzhanian and Mikhail Rybakov},
journal= {arXiv preprint arXiv:2211.14571},
year = {2022}
}
Comments
in Russian language