Fr. 220.00

Higher Recursion Theory And Set Theory

English · Hardback

Shipping usually within 3 to 5 weeks

Description

Read more










This volume celebrates the research contributions of Professors Theodore A Slaman and W Hugh Woodin, marking their distinguished careers in higher recursion theory and set theory as they approached the milestone of their 65th birthdays in 2019. It originates from the Institute for Mathematical Sciences program, Higher Recursion Theory and Set Theory, held at the National University of Singapore (May 20-June 14, 2019).

The program explored cutting-edge developments in higher recursion theory, set theory, and their intricate interconnections. Topics discussed during the workshop included Martin's conjecture, higher randomness, the HOD conjecture, descriptive inner model theory, and the Ultimate-L program.

This volume presents 15 peer-reviewed contributions by leading experts in the field, offering a comprehensive overview of recent advances in higher recursion theory and set theory, with a focus on their dynamic interactions.

Product details

Authors Andrew Marks Yue Yang James Cummings
Assisted by James Cummings (Editor), Cummings James (Editor), Andrew Marks (Editor), Yue Yang (Editor), Yang Yue (Editor), Liang Yu (Editor), Yu Liang (Editor)
Publisher Ingram Publishers Services
 
Languages English
Product format Hardback
Released 24.03.2025
 
EAN 9789819806577
ISBN 978-981-9806-57-7
Series Lecture Notes Series, Institute for Mathematical Sciences, National University of Singapore
Subjects Natural sciences, medicine, IT, technology > Mathematics > Miscellaneous

MATHEMATICS / Logic, MATHEMATICS / Set Theory, Mathematical logic, Set theory

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.