Corpus ID: 14312110

Complexity of Strict Implication

@inproceedings{Bou2004ComplexityOS,
  title={Complexity of Strict Implication},
  author={F. Bou},
  booktitle={Advances in Modal Logic},
  year={2004}
}
  • F. Bou
  • Published in Advances in Modal Logic 2004
  • Computer Science, Mathematics
The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner’s Theorem remains valid when we restrict the language to the strict implication fragment, and that the same holds for Hemaspaandra’s Theorem. As a consequence we have that the validity problem for most standard normal modal logics is the same one than the validity problem for its strict implication fragment. We also prove that the validity… Expand
Intuitionistic implication makes model checking hard
Material and Strict Implication in Boolean Algebras, Revisited
Die Komplexität der Formelauswertung in intuitionistischen Logiken

References

SHOWING 1-10 OF 34 REFERENCES
A Closer Look at Some Subintuitionistic Logics
The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic
Intuitionistic Propositional Logic is Polynomial-Space Complete
  • R. Statman
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1979
Constructive logic and the paradoxes
Semantical Analysis of Intuitionistic Logic I
Completeness and Correspondence in the First and Second Order Semantics for Modal Logic
Displaying as Temporalizing
A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief
Word problems requiring exponential time(Preliminary Report)
Modal Translations in K and D
...
1
2
3
4
...