- AutorIn
- Carsten Lutz RWTH Aachen, Theoretical Computer Science
- Ulrike SattlerRWTH Aachen, Theoretical Computer Science
- Titel
- The Complexity of Reasoning with Boolean Modal Logics
- Untertitel
- Extended Version
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-789030
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 00-02
- Erstveröffentlichung
- 2000
- DOI
- https://doi.org/10.25368/2022.105
- Abstract (EN)
- Since Modal Logics are an extension of Propositional Logic, they provide Boolean operators for constructing complex formulae. However, most Modal Logics do not admit Boolean operators for constructing complex modal parameters to be used in the box and diamond operators. This asymmetry is not present in Boolean Modal Logics, in which box and diamond quantify over arbitrary Boolean combinations of atomic model parameters.
- This is an extended version of the article in: Advances in Modal Logic (AiML), Volume 3
- Freie Schlagwörter (DE)
- Aussagenlogik, Hintikka-Menge, modaler Parameter
- Freie Schlagwörter (EN)
- propositional logic, hintikka set, modal parameter
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Publizierende Institution
- Aachen University of Technology, Aachen
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-789030
- Veröffentlichungsdatum Qucosa
- 20.05.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0