Decidability of modal logics of non-\(k\)-colorable graphs

DOI10.1007/978-3-031-39784-4_22arXiv2303.09934MaRDI QIDQ6118698

Ilya B. Shapirovsky

Publication date: 28 February 2024

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

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

zbMATH Keywords

modal logicfiltrationdecidabilitychromatic numberfinite model propertydifference modality

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Modal logic with names
• The finite model property for logics with the tangle modality
• The chromatic number of the plane is at least 5: a new proof
• Every world can see a reflexive world
• The modal logic of inequality
• Erdős Graphs Resolve Fine's Canonicity Problem
• Derivational Modal Logics with the Difference Modality
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decidability of modal logics of non-\(k\)-colorable graphs