DROPS

Document

DOI: 10.4230/LIPIcs.STACS.2011.368

The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete

Authors: Martin Mundhenk and Felix Weiß

Published in: LIPIcs, Volume 9, 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)

Abstract

We investigate the complexity of the model checking problem for propositional intuitionistic logic. We show that the model checking problem for intuitionistic logic with one variable is complete for logspace-uniform AC^1, and for intuitionistic logic with two variables it is P-complete. For superintuitionistic logics with one variable, we obtain NC^1-completeness for the model checking problem and for the tautology problem.

Cite as

Martin Mundhenk and Felix Weiß. The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 368-379, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{mundhenk_et_al:LIPIcs.STACS.2011.368,
  author =	{Mundhenk, Martin and Wei{\ss}, Felix},
  title =	{{The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete}},
  booktitle =	{28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)},
  pages =	{368--379},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-25-5},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{9},
  editor =	{Schwentick, Thomas and D\"{u}rr, Christoph},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.368},
  URN =		{urn:nbn:de:0030-drops-30278},
  doi =		{10.4230/LIPIcs.STACS.2011.368},
  annote =	{Keywords: complexity, intuitionistic logic, model checking, ACi}
}

Search Results

Documents authored by Mundhenk, Martin

The model checking problem for propositional intuitionistic logic with one variable is AC^1-complete

Abstract

Cite as

Thanks for your feedback!

Could not send message