Complexity of the variable-free fragment of the weak Grzegorczyk logic
Abstract
The paper proves PSPACE-hardness of variable-free fragments of all logics between K and wGrz.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.