TENTANG EPISODE INI

Inggris
Britania Raya

TRANSKRIP 🔗

CARI EPISODE TERDAHULU

Cari episode sebelumnya dari Mathematical, Foundational and Computational Aspects of the Higher Infinite.

EPISODE LAIN DALAM PODCAST INI

For various questions in Infinite Graph Theory, matroids have turned out to be the right tool to tackle them. This introduction to infinite matroids will be self-contained; in particular I will explain what a matroid is.
Miller, B (Universität Wien) Friday 18th December 2015 - 10:00 to 11:00
Co-author: Philipp Schlicht (Universität Bonn) Transfinite machine models of computation provide an approach to an `effective mathematics of the uncountable'. However, their set-theoretical interest seems to be limited by the fact that even the strongest such model, Koepke's Ordinal Turing Machine…
We discuss several results related to the question of when a Borel graph has a Borel matching. Here, the analogue of Hall's matching theorem fails, but there are positive results giving Borel matchings in several contexts if we are willing to discard null or meager sets. We also discuss some applic…
The limit of this kind of computability is the least ordinal which is \Pi_1 gap-reflecting on admissibles. If you would like to know what any of this means, come to the talk!
Sanggahan: Podcast dan karya seni yang disematkan pada halaman ini berasal dari Cambridge University, yang merupakan milik pemiliknya dan tidak berafiliasi atau didukung oleh Listen Notes, Inc.