On modal logics betweenK × K × KandS5 × S5 × S5

DOI10.2178/jsl/1190150040zbMath1002.03019OpenAlexW1489614395MaRDI QIDQ4532612

No author found.

Publication date: 13 January 2003

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1190150040

zbMATH Keywords

decidabilitymultimodal logicfinite relation algebras\(n\)-frames\(n\)-modal logicasiomatizability

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Decidability of theories and sets of sentences (03B25) Other algebras related to logic (03G25) Cylindric and polyadic algebras; relation algebras (03G15)

Related Items

Embeddability into Relational Lattices Is Undecidable ⋮ Embeddability into relational lattices is undecidable ⋮ Omitting Types in Fragments and Extensions of First Order Logic ⋮ A construction of cylindric and polyadic algebras from atomic relation algebras ⋮ Бинарный предикат, транзитивное замыкание, две-три переменные: сыграем в домино? ⋮ An NP-complete fragment of fibring logic ⋮ A study on multi-dimensional products of graphs and hybrid logics ⋮ Relational Lattices via Duality ⋮ Neat embeddings, omitting types, and interpolation: an overview ⋮ Non-primitive recursive decidability of products of modal logics with expanding domains ⋮ Undecidability of First-Order Intuitionistic and Modal Logics with Two variables ⋮ The Complexity of Decomposing Modal and First-Order Theories ⋮ Algebraic Logic, Where Does it Stand Today? ⋮ \({\mathcal E}\)-connections of abstract description systems

Cites Work

• Unnamed Item
• Unnamed Item
• Cylindric algebras. Part II
• Many-dimensional modal logics: theory and applications
• Representability is not decidable for finite relation algebras
• Complexity of products of modal logics
• On axiomatising products of Kripke frames
• Two-dimensional modal logic