![]() |
![]() |
University of Birmingham > Talks@bham > Theoretical computer science seminar > Reverse mathematics of non-deterministic inductive definitions
Reverse mathematics of non-deterministic inductive definitionsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Benedikt Ahrens. We present some reverse mathematics within a constructive set theory, and classify the following theorems in terms of non-deterministic inductive definition (NID) principles: Fullness; the category of basic pairs and relation pairs has coequalisers; the category of sets and relations has weak coequalisers; the category of concrete spaces and convergent relation pairs has equalisers; the class of formal points of a set-presented formal topology is set-generated; the class of models of a geometric theory is set-generated. This is a joint work with Ayana Hirata, Tatsuji Kawai and Takako Nemoto. This talk is part of the Theoretical computer science seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsBirmingham Popular Maths Lectures Theoretical Physics Journal Club Topology and Dynamics seminarOther talksTBC Quantum Sensing in Space Horizontal Mean Curvature Flow and stochastic optimal controls Ultrafast Spectroscopy and Microscopy as probes of Energy Materials Hunt for an Earth-twin Control variates for computing transport coefficients |