A note on assumption-completeness in modal logic

DOI10.1007/978-3-642-15164-4_10zbMATH Open1287.03041OpenAlexW1875111098MaRDI QIDQ3584876FDOQ3584876

Authors: Eric Pacuit, Jonathan Alexander Zvesper 

Publication date: 31 August 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15164-4_10

Recommendations

• Strong completeness theorems for weak logics of common belief
• A modal logic of epistemic games
• scientific article; zbMATH DE number 1778906
• scientific article; zbMATH DE number 2063025
• A guide to completeness and complexity for modal logics of knowledge and belief

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Rationality and learning in game theory (91A26)

Cited In (4)

• The placeholder view of assumptions and the Curry-Howard correspondence
• Substantive assumptions in interaction: a logical perspective
• The completeness problem for modal logic
• Title not available (Why is that?)

This page was built for publication: A note on assumption-completeness in modal logic

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