University of Cambridge > > Isaac Newton Institute Seminar Series > Borel Matchings and equidecompositions

Borel Matchings and equidecompositions

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact webseminars.

Mathematical, Foundational and Computational Aspects of the Higher Infinite

We present some recent theorems, possibly having to do with Borel reducibility, the combinatorics of Borel graphs, or computability, and some of which may have been proved after the deadline for submitting abstracts in July.

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity