COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

## Stone DualityAdd to your list(s) Download to your calendar using vCal - Hugo Paquet (University of Cambridge)
- Friday 11 March 2016, 11:00-12:00
- Rainbow Room (FS07), Computer Laboratory.
If you have a question about this talk, please contact Ian Orton. I’ll talk about a result from the 1930s known as “Stone’s representation theorem for Boolean algebras”. It introduces a link between Boolean algebras and a type of topological spaces called Stone spaces. In the language of category theory (which only appeared later), the result is that the category of Boolean algebras is equivalent to the opposite of the category of Stone spaces. This has been extended to other classes of topological spaces and partially ordered sets, and these results are now typically referred to as “Stone duality”. In particular Stone duality has been studied in the context of domain theory, and I’ll also mention some of its applications to the semantics of programming languages. I’ll define all the necessary notions, the only prerequisite is basic category theory. This talk is part of the Logic & Semantics for Dummies series. ## This talk is included in these lists:Note that ex-directory lists are not shown. |
## Other listsTalks related to sustainability and the environment Epigenetics and Stem Cells 2012 DPMMS Pure Maths Seminar Sinew Speakers Series Cambridge Immunology## Other talksWhat constitutes 'discrimination' in everyday talk? Argumentative lines and the social representations of discrimination NatHistFest: the 99th Conversazione and exhibition on the wonders of the natural world. Evolution in island colonising birds: silvereyes of the south Pacific A stochastic model for understanding PIN polarity in isolated cells Foster Talk - CANCELLED - Redox Oscillations in the Circadian Clockwork “It’s like they’re speaking a different language!” Investigating an accidental resistance to school mathematics reform |