The biennial logic meetings at UCLA have been among the most important forums for mathematical logic on the West Coast for over three decades. The 2011 meeting continues this series. It will emphasize descriptive set theory, theoretical computer science, philosophical logic and linguistics, and complexity theory. The conference will provide a key opportunity for logicians to learn about and discuss important advances in research, to exchange ideas, and to collaborate on scientific projects. Most of the participants are expected to be research mathematicians and university teachers. At least half the award funds will be used for travel grants to help graduate students and young researchers come to the conference. What they learn at the conference will have a positive impact on their research and teaching.
This grant helped fund a conference on mathematical logic at UCLA. The conference was held Friday February 4th, to Sunday February 6, 2011. Talks given at the conferene covered a broad selection of topics in mathematical logic, including set theory, recursion theory, model theory, proof theory, philosophy of mathematics, and theoretical computer science. Speakers included (with affiliation and title of talk in parenthesis): Uri Andrews (Madison, Ahmad tuples), Lou van den Dries (UIUC, Remarks on arithmetic complexity), Rachel Epstein (Harvard, Definability of the Jump Classes of C.E. Sets), Ilijas Farah (York, The complexity of classification problem of separable C*-algebras), Haim Gaifman (Columbia, On The Mathematical Content of Principia Mathematica), Itay Kaplan (Konstanz, The Automorphism tower of centerless group without choice), Alexander Kechris (Caltech, On the work of Greg Hjorth), Phokion Kolaitis (UCSC, Random Graphs and the Parity Quantifier), Stephan Kreutzer (Oxford, Fixed-Point Logics From Elementary Induction on Abstract Structures to Databases and Descriptive Complexity), Joan Moschovakis (Occidental, Models and Interpretations of Intuitionistic Analysis), Larry Moss (Indiana, Final Coalgebras), and Slawomir Solecki (UIUC, An abstract approach to finite Ramsey theory and a self-dual Ramsey theorem). NSF funds were used in part to fund speaker travel expenses and in part to fund travel grants for graduate students and young researchers coming to attend the conference.
