درباره این پادکست 🔗

میانگین طول صدا:
50 minutes
پادکست ویدیویی
انگلیسی
انگلستان
76 قسمت
از سال 25 اوت 2015
episodic

آخرین اپیزود 🔗

In this talk I plan to discuss some joint work with Sheila Miller related to knots. Quandles are algebraic structures that can be associated to (tame) knots, and they in fact constitute one of the few complete invariants we have for knots. However, there is some dissatisfaction with quandles as inv…

جستجوی اپیزودهای گذشته

اپیزودهای قبلی Mathematical, Foundational and Computational Aspects of the Higher Infinite را جستجو کن.

اپیزود قبلی

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…
Bowler, N (Universität Hamburg) Thursday 17th December 2015 - 14:45 to 15:45

Pairwise Sums in the Reals

Co-authors: Neil Hindman (Howard University), Dona Strauss (University of Leeds) We show (assuming CH) that there is a finite colouring of the reals such that no infinite set X has X+X (meaning the pairwise sums from X, allowing repetition) monochromatic. And we give positive results for ‘nice’ co…
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.
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!
Hrusak, M [Universidad Nacional Autónoma de México (UNAM)] Wednesday 16th December 2015 - 15:00 to 16: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…
Co-author: Sylvain Schmitz (ENS Cachan) The talk will survey some of the applications of well-quasi-orderings in computer science. Well-quasi-orderings are an important tool in some areas like program verification, or computer-aided deduction and theorem-proving. Most importantly, they provide eas…
سلب مسئولیت: پادکست و آثار هنری تعبیه شده در این صفحه متعلق به Cambridge University است که متعلق به صاحب آن است و به Listen Notes، Inc وابسته یا تایید نشده است.