Intuitionistic implication makes model checking hard

DOI10.2168/LMCS-8(2:3)2012zbMath1237.68125arXiv1107.1963OpenAlexW3104155280MaRDI QIDQ2887060

Felix Weiß, Martin Mundhenk

Publication date: 16 May 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.1963

zbMATH Keywords

complexitymodel checkingintuitionistic logicP-completeness

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (2)

An \(\mathsf{AC}^{1}\)-complete model checking problem for intuitionistic logic ⋮ The complexity of primal logic with disjunction

This page was built for publication: Intuitionistic implication makes model checking hard