Pages that link to "Item:Q1411664"
From MaRDI portal
The following pages link to On the polynomial-space completeness of intuitionistic propositional logic (Q1411664):
Displaying 7 items.
- An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic (Q475340) (← links)
- Disjunction property and complexity of substructural logics (Q549720) (← links)
- The decision problem of provability logic with only one atom (Q1423633) (← links)
- Computational complexity for bounded distributive lattices with negation (Q2032990) (← links)
- Proof compression and NP versus PSPACE (Q2631644) (← links)
- Primal Infon Logic: Derivability in Polynomial Time (Q2963910) (← links)
- Proof Compression and NP Versus PSPACE II (Q5147748) (← links)