[Alta-Logic] Tak on the 27th.

[Gillman Payette]

This talk looks very interesting to those who have an interest in modal
logic and/or multi-agent systems.

Start: 05/27/2009 - 14:00
End: 05/27/2009 - 15:00

Room: ICT 616

Speaker: Mehrnoosh Sadrzadeh (joint work with Roy Dyckhoff)

Abstract:

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 Sadrzadeh, 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.

-- 

Mehrnoosh Sadrzadeh

EPSRC Postdoctoral Research Fellow

Oxford University Computing Laboratory

Research Fellow of Wolfson College

http://web.comlab.ox.ac.uk/people/Mehrnoosh.Sadrzadeh/


-- 
Gillman Payette
Department of Philosophy
University of Calgary
2500 University Drive NW
Calgary, AB T2N 1N4, Canada
Ph 403.220.6463
Fax 403.289.5698