OM DETTA AVSNITT
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!
Engelsk
Storbritannien
UTSKRIFT 🔗
Are you the producer of this podcast?
Add a podcast transcript
Need Audio-to-Text?
Transcribe with Listen411 in Just 60 Seconds
SÖK TIDIGARE AVSNITT
Sök efter tidigare avsnitt från Mathematical, Foundational and Computational Aspects of the Higher Infinite.
ANDRA EPISODER I DENNA PODCAST
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
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…
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…
Ansvarsfriskrivning: Podcasten och konstverket som är inbäddat på den här sidan är från Cambridge University, som är dess ägares egendom och inte anslutet till eller godkänt av Listen Notes, Inc.
REDIGERA
Tack för att du hjälper till att hålla databasen över podcaster uppdaterad.
