A note on the complexity of S4.2

DOI10.1080/11663081.2021.1901560OpenAlexW3139033683MaRDI QIDQ5156186

Aggeliki Chalki, Yorgos Zikos, Costas D. Koutras

Publication date: 15 October 2021

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.2021.1901560

zbMATH Keywords

modal logiccomplexity of multimodal logicsS4.2 logictableaux proof procedures

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Kripke's worlds. An introduction to modal logics via tableaux
• Computability and complexity theory.
• A guide to completeness and complexity for modal logics of knowledge and belief
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
• The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• A quick guided tour to the modal logic S4.2
• Computer Science Logic
• Computational Complexity
• The modal logic of forcing
• Modalities and multimodalities. With the assistance and collaboration of Juliana Bueno-Soler.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the complexity of S4.2