From single agent to multi-agent via hypersequents

DOI10.1007/S11787-012-0047-8MaRDI QIDQ2392010zbMATH OpenOpenAlexFDO

Authors Francesca Poggiolesi

Publication date 6 August 2013

Published in Logica Universalis (Search for Journal in Brave)

Full work available at URL https://halshs.archives-ouvertes.fr/halshs-00775806/file/articleS5m9.pdf

zbMATH Keywords

multi-agent systemsdecidabilitymodal logiccut-eliminationAumann structures

Mathematics Subject Classification ID

Logics of knowledge and belief (including belief change) (03B42) Modal logic (including the logic of norms) (03B45) Cut-elimination and normal-form theorems (03F05) Logic in artificial intelligence (68T27)

Recommendations

• Common knowledge: a finitary calculus with a syntactic cut-elimination procedure
• Hypersequent calculi for S5: the methods of cut elimination
• A cut-free simple sequent calculus for modal logic S5
• Consistency proofs for systems of multi-agent only knowing
• Cut free sequent calculus for logic S5_n(ED)

Cites work

• scientific article; zbMATH DE number 3572133 (Why is no real title available?)
• A cut-free simple sequent calculus for modal logic S5
• Agreeing to disagree
• Cut-free double sequent calculus for S5
• Cut-free modal sequents for normal modal logics
• Dynamic epistemic logic
• Logics for epistemic programs
• Proof theory. An introduction
• Sequent Calculi for Normal Modal Propositional Logics
• Tableaux for Public Announcement Logic

Cited in

(3)

• A Critical Overview of the Most Recent Logics of Grounding
• Inconsistency-tolerant multi-agent calculus
• Nested sequents or tree-hypersequents -- a survey

This page was built for publication: From single agent to multi-agent via hypersequents

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