معلومات عن هذه الحلقة
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!
الإنجليزية
المملكة المتحدة
النص 🔗
Are you the producer of this podcast?
Add a podcast transcript
Need Audio-to-Text?
Transcribe with Listen411 in Just 60 Seconds
البحث في الحلقات الماضية
البحث في الحلقات السابقة من Mathematical, Foundational and Computational Aspects of the Higher Infinite.
حلقات أخرى في هذا البودكاست
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.
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…
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…
إخلاء المسؤولية: البودكاست والأعمال الفنية المضمنة في هذه الصفحة مأخوذة من Cambridge University، وهي مملوكة لمالكها وليست تابعة لشركة Listen Notes, Inc أو معتمدة منها.
تعديل
شكراً على مساعدتنا في الحفاظ على قاعدة بيانات البودكاست مُحدَّثة.
