University of Birmingham > Talks@bham > Theoretical computer science seminar > Concurrent Computational Interpretation of Dummett's Axiom and Prelinearity

Concurrent Computational Interpretation of Dummett's Axiom and Prelinearity

Add to your list(s) Download to your calendar using vCal

  • UserYoichi Hirai, University of Tokyo
  • ClockMonday 27 August 2012, 11:00-12:00
  • HouseCS 217.

If you have a question about this talk, please contact Paul Levy.

Dummett’s axiom (A → B) \/ (B → A) on top of intuitionistic logic characterizes Godel-Dummett logic. First we give a lambda calculus for this logic, which can code waitfree computation. There, the axiom describes two communicating processes and guarantees one of them to succeed. Second, we give a recent development similar to classical realizability in an affine logic with prelinearity.

This talk is part of the Theoretical computer science seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.