A completeness proof for a logic with an alternative necessity operator

DOI10.1023/A:1004944015811zbMATH Open0864.03012MaRDI QIDQ677080FDOQ677080

Authors: Stéphane Demri 

Publication date: 15 June 1997

Published in: Studia Logica (Search for Journal in Brave)

Recommendations

• A guide to completeness and complexity for modal logics of knowledge and belief
• scientific article; zbMATH DE number 1778906
• Completeness criteria for expressibility in a 4-valued extension of provability logic
• scientific article; zbMATH DE number 851063

zbMATH Keywords

contingencycompletenessco-NP-completeHilbert-style systemknowledge logicreasoning with incomplete information

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in artificial intelligence (68T27) Complexity of computation (including implicit computational complexity) (03D15)

Cited In (7)

• A simple proof of a completeness result for \(leads\)-\(to\) in the UNITY logic
• The modal logic of agreement and noncontingency
• A hierarchy of modal logics with relative accessibility relations
• Beyond knowing that: a new generation of epistemic logics
• Contingency and knowing whether
• On the axiomatization of an unawareness structure from knowing-whether operators
• Logics for propositional determinacy and independence

This page was built for publication: A completeness proof for a logic with an alternative necessity operator

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