על אודות פודקאסט זה 🔗

אורך אודיו ממוצע:
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 in‮…

חיפוש פרקים ישנים

חפש פרקים קודמים של 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 appli‮…
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’ c‮…
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 Machin‮…
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 ea‮…
הצהרה: הפודקאסט והגרפיקה המוטבעים בדף זה הם מ-Cambridge University, שהוא רכושו של בעליו ואינו קשור או מאושר על ידי Listen Notes, Inc.