ABOUT THIS PODCAST 🔗
The goals of set theory are the analysis of the structure of the Higher Infinite, i.e. Cantor's set-theoretic universe and the elucidation of the nature of infinite mathematical objects and their role in foundational issues underlying mathematics. Moreover, the current standard system of set theory, the Zermelo-Fraenkel axioms with the Axiom of Choice (ZFC), is the usual framework for a large part of mathematics.
Current set-theoretic research on infinity focuses on the following three broad areas: large Cardinals and inner model theory, descriptive set-theoretic methods and classification problems, and infinite combinatorics.
The programme HIF will connect these three main strands of set-theoretic research and other fields of set theory to the wider scope of mathematics, to research in the foundations of mathematics, including some philosophical issues, and to research on computational issues of infinity, e.g. in theoretical computer science and constructive mathematics.
The following topics are a non-exclusive list of important examples of relevant fields for the research done in the programme HIF:
1.The structure of definable subsets of the continuum
2.Infinite combinatorics, forcing, and large cardinals
3.Inner models of large cardinals and aspects of determinacy
4.Applications of set theory to other areas of mathematics
5.Constructive set theory and new models of computation
6.Set theory and the foundations of mathematics
Three workshops are planned during the programme: The first one (24-28 August 2015) will be the 5th European Set Theory Conference. The second workshop, entitled "New challenges in iterated forcing" will be a Satellite Meeting held at the University of East Anglia in Norwich (2-6 November 2015). A final workshop will take place on 14-18 December 2015.
Current set-theoretic research on infinity focuses on the following three broad areas: large Cardinals and inner model theory, descriptive set-theoretic methods and classification problems, and infinite combinatorics.
The programme HIF will connect these three main strands of set-theoretic research and other fields of set theory to the wider scope of mathematics, to research in the foundations of mathematics, including some philosophical issues, and to research on computational issues of infinity, e.g. in theoretical computer science and constructive mathematics.
The following topics are a non-exclusive list of important examples of relevant fields for the research done in the programme HIF:
1.The structure of definable subsets of the continuum
2.Infinite combinatorics, forcing, and large cardinals
3.Inner models of large cardinals and aspects of determinacy
4.Applications of set theory to other areas of mathematics
5.Constructive set theory and new models of computation
6.Set theory and the foundations of mathematics
Three workshops are planned during the programme: The first one (24-28 August 2015) will be the 5th European Set Theory Conference. The second workshop, entitled "New challenges in iterated forcing" will be a Satellite Meeting held at the University of East Anglia in Norwich (2-6 November 2015). A final workshop will take place on 14-18 December 2015.
Average audio length:
50 minutes
Video podcast
English
United Kingdom
76 episodes
since Aug. 25, 2015
episodic
LATEST EPISODE 🔗
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…
SEARCH PAST EPISODES
Search past episodes of Mathematical, Foundational and Computational Aspects of the Higher Infinite.
PREVIOUS EPISODES 🔗
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
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…
Disclaimer: The podcast and artwork embedded on this page are from Cambridge University, which is the property of its owner and not affiliated with or endorsed by Listen Notes, Inc.
PODCAST SEARCH ENGINE
You can use our website to search 3,822,726 podcasts and 195,626,818 episodes by people, places, or topics.
If I have seen further than others, it is by listening to podcasts and standing upon the shoulders of
giants.
‐ Isaac "Llamacorn" Newton
SEARCH PAST EPISODES
Search past episodes of Mathematical, Foundational and Computational Aspects of the Higher Infinite.
CLAIM THIS PODCAST
Why to claim podcasts?
If you are a podcaster, the best way to manage your podcasts on Listen Notes is by claiming your Listen Notes
podcast pages.
It is a great, free way to engage the podcast community and increase the visibility of your podcasts.
After claiming your Listen Notes podcast pages, you will be able to:
✓
Manually refresh the RSS feed to sync up
✓
Get a verified badge (
✓
) alongside with your podcast name on Listen Notes
✓
Post classified ads for sponsorship,
guests, co-hosts,
cross-promotion...
✓
Respond to listener comments on Listen Notes
✓
Use speech-to-text techniques to transcribe your show and
edit transcripts
✓
Improve the presence of your podcasts, e.g., self-service
podcaster interview...
✓
If you share your Listen Notes page and at-mention @ListenNotes
on X (formerly Twitter),
our official X (formerly Twitter) account will retweet to promote
your show to our followers.
Coming soon:
◯ Self-service promotion on Listen Notes
◯ Track your podcast stats on Listen
Notes, e.g., listens, page
views...
◯ Manage episodes
EDIT
Thank you for helping to keep the podcast database up to date.