COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > An effective classification of Borel Wadge classes
An effective classification of Borel Wadge classesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact nobody. SASW09 - International conference on computability, complexity and randomness In 1983, Louveau completed the work started by Wadge in his thesis, and gave a complete classification of Borel Wadge classes. Later, Louveau and Saint-Raymond used this classification to give a proof of Borel Wadge determinacy in second-order arithmetic. We describe how to give an effective and streamlined classification. Being dynamic in spirit, we consider names of Borel sets as decision processes (or approximation) for membership, rather than static descriptions of classes as being built from simpler classes using Boolean operations. Joint with Matthew Harrison-Trainor and Dan Turetsky This talk is part of the Isaac Newton Institute Seminar Series series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsMedSoc Violence Research Centre, Institute of Criminology ConvertidorOther talksIdentifying degradation patterns of lithium ion batteries from impedance spectroscopy using machine learning Targeting non-coding RNAs in vascular cell therapy Industrial Panel (MathWorks, Microsoft, Nvidia) Hasse principle for simply connected groups - Kirk Distinguished Visiting Fellow Lecture Parental care: an evolutionary case of “use it or lose it” Predicting extreme heat waves using rare event simulations and deep neural networks |