The model checking problem for intuitionistic propositional logic with one variable is AC1-complete
Abstract
We show that the model checking problem for intuitionistic propositional logic with one variable is complete for logspace-uniform AC1. As basic tool we use the connection between intuitionistic logic and Heyting algebra, and investigate its complexity theoretical aspects. For superintuitionistic logics with one variable, we obtain NC1-completeness for the model checking problem.
- Publication:
-
arXiv e-prints
- Pub Date:
- December 2010
- DOI:
- 10.48550/arXiv.1012.3828
- arXiv:
- arXiv:1012.3828
- Bibcode:
- 2010arXiv1012.3828M
- Keywords:
-
- Computer Science - Computational Complexity;
- Computer Science - Logic in Computer Science;
- 68Q17 (Primary);
- 03B20 (Secondary);
- F.2;
- F.4
- E-Print:
- A preliminary version of this work was presented at STACS 2011. 19 pages, 3 figures