Contributions to Mathematical Logic

This volume features the latest scientific developments in the fields of computability theory and logical foundations of mathematics as well as applications. The scope involves the topics of Computability Theory, Reverse Mathematics, Nonstandard Analysis, Proof Theory, Set Theory, Philosophy of Mathematics, Constructive Mathematics, Theory of Randomness and Computational Complexity Theory.

Descriptive Set Theory is the study of sets in separable, complete metric spaces that can be defined (or constructed), and so can be expected to have special properties not enjoyed by arbitrary pointsets. This subject was started by the French analysts at the turn of the 20th century, most prominently Lebesgue, and, initially, was concerned primarily with establishing regularity properties of Borel and Lebesgue measurable functions, and analytic, coanalytic, and projective sets. Its rapid development came to a halt in the late 1930s, primarily because it bumped against problems which were independent of classical axiomatic set theory. The field became very active again in the 1960s, with the introduction of strong set-theoretic hypotheses and methods from logic (especially recursion theory), which revolutionized it. This monograph develops Descriptive Set Theory systematically, from its classical roots to the modern ?effective? theory and the consequences of strong (especially determinacy) hypotheses. The book emphasizes the foundations of the subject, and it sets the stage for the dramatic results (established since the 1980s) relating large cardinals and determinacy or allowing applications of Descriptive Set Theory to classical mathematics. The book includes all the necessary background from (advanced) set theory, logic and recursion theory.

This volume reflects the contributions stemming from the conference Analytic and Combinatorial Number Theory: The Legacy of Ramanujan which took place at the University of Illinois at Urbana-Champaign on June 6-9, 2019. The conference included 26 plenary talks, 71 contributed talks, and 170 participants. As was the case for the conference, this book is in honor of Bruce C Berndt and in celebration of his mathematics and his 80th birthday.Along with a number of papers previously appearing in Special Issues of the International Journal of Number Theory, the book collects together a few more papers, a biography of Bruce by Atul Dixit and Ae Ja Yee, a preface by George Andrews, a gallery of photos from the conference, a number of speeches from the conference banquet, the conference poster, a list of Bruce's publications at the time this volume was created, and a list of the talks from the conference.

This volume develops an effective theory approach to understanding deep neural networks of practical relevance.

This almost self-contained introduction to higher recursion theory is essential reading for all researchers in the field.