University of Birmingham > Talks@bham > Theoretical computer science seminar > Unique Paths as Formal Points

## Unique Paths as Formal PointsAdd to your list(s) Download to your calendar using vCal - Peter Schuster, University of Leeds
- Friday 28 May 2010, 14:00-15:00
- UG40 Computer Science.
If you have a question about this talk, please contact Paul Levy. (Joint work with Thierry Coquand) A point-free formulation of the Koenig Lemma for trees with uniformly at most one infinite path allows for a constructive proof without choice. By aiming at an infinite chain rather than an infinite sequence we can get by without unique choice. The uniform uniqueness hypothesis helps to do without any more general choice principle, and of course without classical logic. While we rely upon recent related results by Ishihara and Schwichtenberg, the underlying instance of completeness can be traced back to work by Lifshitz and Lawvere from the early 1970s. This talk is part of the Theoretical computer science seminar series. ## This talk is included in these lists:- Computer Science Departmental Series
- Computer Science Distinguished Seminars
- Theoretical computer science seminar
- UG40 Computer Science
- computer sience
Note that ex-directory lists are not shown. |
## Other listsSchool of Mathematics Events Type the title of a new list here Condensed Matter Group Meetings## Other talksModule tensor categories and the Landau-Ginzburg/conformal field theory correspondence TBC TBA Plasmonic Electronic Paper View fusion vis-à-vis a Bayesian interpretation of Black-Litterman for portfolio allocation Theory: This is moved to next year, 2023 ! |