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 PrelinearityAdd to your list(s) Download to your calendar using vCal - Yoichi Hirai, University of Tokyo
- Monday 27 August 2012, 11:00-12:00
- CS 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. ## This talk is included in these lists:- CS 217
- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Theoretical computer science seminar
- computer sience
Note that ex-directory lists are not shown. |
## Other listsFeatured lists Combinatorics and Probability seminar Mathematics Colloquium## Other talksUltrafast Spectroscopy and Microscopy as probes of Energy Materials Quantum Sensing in Space TBA TBA Life : itâ€™s out there, but what and why ? TBC |