Continuous Gradability of R-tree Cut-Point Orders
An exploration of the continuous gradability of cut-point orders in R-trees, addressing a problem posed by Favre and Jonsson and establishing new links with set-theoretic trees.
Sam Adam-Day is a visiting speaker at the University of Oxford, specializing in mathematical logic and set theory.
Verified alma mater degrees, faculty appointments, co-authors, doctoral lineage, and intellectual peers across the archive.
3 courses · 58 lectures
Faculty & Lecturer · University of Oxford
Self-contained public lectures, keynote addresses, and research seminars.