Revisiting completeness for the Kn modal logics: a new proof

DOI10.1093/JIGPAL/8.1.101zbMATH Open1034.03019OpenAlexW2003782541MaRDI QIDQ4444913FDOQ4444913

Authors: Tara Nicholson, Ray E. Jennings, Darko Sarenac 

Publication date: 28 January 2004

Published in: Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/8.1.101

Recommendations

• A solution to the completeness problem for weakly aggregative modal logic
• scientific article; zbMATH DE number 3845547
• On the complexity of modal axiomatisations over many-dimensional structures
• On modal logics betweenK × K × KandS5 × S5 × S5
• On non-finite axiomatization of \(n\)-modal logics between \(\mathbf{K}^n\) and \(\mathbf{S}5^n\) for finite \(n \geq 3\)

zbMATH Keywords

aggregationcompletenessmodal logicrelational frames\(n\)-traceschromatic indices of hypergraphs

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45)

Cited In (8)

• A new version of the proof of completeness criterion for k-valued logic functions
• Approximations of modal logics: \(\mathbf K\) and beyond
• Model theoretical aspects of weakly aggregative modal logic
• Title not available (Why is that?)
• Arithmetical completeness theorem for modal logic \(\mathsf{K}\)
• Hypergraphs, local reasoning, and weakly aggregative modal logic
• A solution to the completeness problem for weakly aggregative modal logic
• Title not available (Why is that?)

This page was built for publication: Revisiting completeness for the Kn modal logics: a new proof

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4444913)