(sigemb-info 383) Talks by Bart Jacobs at RIMS, Kyoto U.

[Ichiro Hasuo <ichiro@xxxxxxxxxxxxxxxxxxxx>]

Dear colleagues,

Let me advertise two talks by our guest Bart Jacobs at RIMS,
Kyoto University. One is on this Friday, on quantum logic in a
categorical setting; the other on Thursday next week, on monoidal
traces via coalgebras.  No registration needed, please just show
up. See you there!

Best regards,
Ichiro Hasuo
---
RIMS-CS website
http://www.kurims.kyoto-u.ac.jp/~cs/

============
Bart Jacobs (Radboud Univ. Nijmegen)
Quantum Logic in Dagger Kernel Categories
11.00 - 12.00, Fri 3 Apr 2009
CS Laboratory, RIMS, Kyoto University
(See http://www.kurims.kyoto-u.ac.jp/~cs/lab.html for direction)

This paper investigates quantum logic from the perspective of
categorical logic, and starts from minimal assumptions, namely
the existence of involutions/daggers and kernels. The resulting
structures turn out to (1) encompass many examples of interest,
such as categories of relations, partial injections, Hilbert
spaces (also modulo phase), and Boolean algebras, and (2) have
interesting categorical/logical properties, in terms of kernel
fibrations, such as existence of pullbacks, factorisation, and
orthomodularity. For instance, the Sasaki hook and and-then
connectives are obtained, as adjoints, via the
existential-pullback adjunction between fibres.

Reference: Quantum Logic in Dagger Kernel Categories, by Chris
Heunen and Bart Jacobs.

============
Bart Jacobs (Radboud Univ. Nijmegen)
Coalgebraic and Monoidal Traces
11.00 - 12.00, Thu 9 Apr 2009
CS Laboratory, RIMS, Kyoto University
(See http://www.kurims.kyoto-u.ac.jp/~cs/lab.html for direction)

It will be shown how coalgebraic traces, in suitable Kleisli
categories, give rise to traced monoidal structure in those
Kleisli categories, with finite coproducts as monoidal
structure. By applying the standard ``Int'' construction one
obtains compact closed categories for ``bidirectional monadic
computation''. This generic construction uses partially additive
structure in suitably ordered Kleisli homsets. It combines
several lines of work in the semantics of computation.