Computer Science – Logic in Computer Science
Scientific paper
2009-03-13
Computer Science
Logic in Computer Science
This paper is the full version of the article that is to appear in the ENTCS proceedings of the 25th conference on the Mathema
Scientific paper
We consider a simple modal logic whose non-modal part has conjunction and disjunction as connectives and whose modalities come in adjoint pairs, but are not in general closure operators. Despite absence of negation and implication, and of axioms corresponding to the characteristic axioms of (e.g.) T, S4 and S5, such logics are useful, as shown in previous work by Baltag, Coecke and the first author, for encoding and reasoning about information and misinformation in multi-agent systems. For such a logic we present an algebraic semantics, using lattices with agent-indexed families of adjoint pairs of operators, and a cut-free sequent calculus. The calculus exploits operators on sequents, in the style of "nested" or "tree-sequent" calculi; cut-admissibility is shown by constructive syntactic methods. The applicability of the logic is illustrated by reasoning about the muddy children puzzle, for which the calculus is augmented with extra rules to express the facts of the muddy children scenario.
Dyckhoff Roy
Sadrzadeh Mehrnoosh
No associations
LandOfFree
Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Positive Logic with Adjoint Modalities: Proof Theory, Semantics and Reasoning about Information will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-229352