The model checking problem for intuitionistic propositional logic with one variable is AC1-complete

Details The model checking problem for intuitionistic propositional logic with one variable is AC1-complete The model checking problem for intuitionistic propositional logic with one variable is AC1-complete

2010-12-17

arxiv.org/abs/1012.3828v3

Computer Science

Computational Complexity

A preliminary version of this work was presented at STACS 2011. 19 pages, 3 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

The model checking problem for intuitionistic propositional logic with one variable is AC1-complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The model checking problem for intuitionistic propositional logic with one variable is AC1-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The model checking problem for intuitionistic propositional logic with one variable is AC1-complete will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-638568