Back to Search
Start Over
An AC-complete model checking problem for intuitionistic logic.
- Source :
- Computational Complexity; Dec2014, Vol. 23 Issue 4, p637-669, 33p
- Publication Year :
- 2014
-
Abstract
- We show that the model checking problem for intuitionistic propositional logic with one variable is complete for logspace-uniform AC. For superintuitionistic logics with one variable, we obtain NC-completeness for the model checking problem. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10163328
- Volume :
- 23
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- Computational Complexity
- Publication Type :
- Academic Journal
- Accession number :
- 99256859
- Full Text :
- https://doi.org/10.1007/s00037-013-0062-z