Topic Archive: Berkeley
University of Wisconsin
Noah Schweber received his doctorate from the University of California-Berkeley in 2016, under the supervision of Antonio Montalban. He now holds a postdoctoral position at the University of Wisconsin.
University of California Berkeley
Matthew Harrison-Trainor is a doctoral student at the University of California at Berkeley, studying computability, computable model theory, and model theory. His advisor is Prof. Antonio Montalban.
University of Wisconsin
Uri Andrews received his Ph.D. from the University of California-Berkeley in 2010, as a student of Tom Scanlon, and subsequently took up an assistant professorship (now tenure-track) at the University of Wisconsin. He studies computable model theory, blending techniques from model theory and computability theory.
University of Connecticut
Linda Brown Westrick received her doctorate in 2014 from the University of California at Berkeley, under the supervision of Ted Slaman. Currently she holds a postdoctoral position at the University of Connecticut. She works in computability theory and effective descriptive set theory, applying techniques from these areas to questions in analysis, symbolic dynamics, and chaos.
University of Waterloo
Rahim Moosa received his doctorate in 2001 from the University of Illinois at Urbana-Champaign, with Anand Pillay as his advisor. After a series of postdoctoral positions, he joined the faculty at the University of Waterloo, where he is now Associate Professor. He studies model theory, especially in relation to differential algebra, fields, and number theory.
North Carolina State University
Michael Singer is a professor at North Carolina State University, studying differential algebra, difference algebra, and symbolic computation. He received his Ph.D. in 1974 from the University of California at Berkeley, under the supervision of Maxwell Rosenlicht.
Scott Cramer received his Ph.D. from the University of California-Berkeley in 2012, with a thesis on reflection of large cardinals, written under the supervision of Hugh Woodin. He is presently a Triennial Assistant Professor at Rutgers University, working in set theory, with specific interests in very large cardinals and determinacy axioms.
Grigor Sargsyan is a professor of mathematics at Rutgers University. He received his Ph.D. at UC Berkeley, 2009. His research interests are in logic, set theory, and foundations: descriptive set theory, inner model theory, large cardinals, and forcing.
University of Connecticut
Damir Dzhafarov studies computability theory and reverse mathematics. He received his doctorate in 2011 from the University of Chicago, as a student of Profs. Robert Soare, Denis Hirschfeldt, and Antonio Montalban, and then held an NSF Postdoctoral Fellowship at Notre Dame University and at the University of California-Berkeley. In 2013 he joined the mathematics faculty of the University of Connecticut.
Department of Mathematics and Computer Science, Wesleyan University
Cameron Hill studies geometric model theory and discrete mathematics. After completing his doctorate in 2010 at the University of California-Berkeley, under the supervision of Leo Harrington and Tom Scanlon, he held a postdoctoral position at Notre Dame University, and is now Assistant Professor in the Department of Mathematics and Computer Science at Wesleyan University.
University of Denver
Professor Dobrinen earned her Ph.D. at the University of Minnesota under Karel Prikry in 1996, afterwards holding post-doctoral positions at Penn State and the University of Vienna before moving to the University of Denver. Her research interests mainly fall under the broad category of logic and foundations of Mathematics, and includes research in set theory, Ramsey theory, Boolean algebras, and measure theory. She has investigated relationships between random reals, eventually dominating functions, measure, generalized weak distributive laws, infinitary two-player games, and complete embeddings of the Cohen algebra into complete Boolean algebras. Currently, she is working on problems in Ramsey theory, problems regarding the structure of the Tukey types of ultrafilters, and problems involving both.
City College -- CUNY
Prof. Medvedev is a model theorist, teaching at City College in the CUNY system. She received her doctorate from the University of California-Berkeley, under the supervision of Tom Scanlon, and subsequently held postdoctoral positions at Berkeley and at the University of Illinois-Chicago.
Prof. Franklin has been an Assistant Professor in the mathematics department of Hofstra University since 2014. She studies algorithmic randomness and recursion theory, with applications in probability and ergodic theory. She received her doctorate from the University of California-Berkeley, under the supervision of Ted Slaman, and has taught at the University of Connecticut, Dartmouth College, the University of Waterloo, and the National University of Singapore.
Miami University of Ohio
Professor Larson (B.S. Dartmouth, Ph.D. UC Berkeley) conducts research in set theory, particularly on the topic of forcing and large cardinals.
University of Toronto
Alex Rennet is a postdoc in the Mathematics department at the University of Toronto working under the supervision of Bill Weiss. His research focus right now is in o-minimality and in particular, ultraproducts of o-minimal structures. He received his Ph.D. in 2012 at the University of California at Berkeley, under the supervision of Thomas Scanlon.
University of California at Berkeley
Nam Trang is a Ph.D. graduate student studying set theory at the University of California at Berkeley.
The City University of New York
Professor Hamkins (Ph.D. 1994 UC Berkeley) conducts research in mathematical and philosophical logic, particularly set theory, with a focus on the mathematics and philosophy of the infinite. He has been particularly interested in the interaction of forcing and large cardinals, two central themes of contemporary set-theoretic research. He has worked in the theory of infinitary computability, introducing (with A. Lewis and J. Kidder) the theory of infinite time Turing machines, as well as in the theory of infinitary utilitarianism and, more recently, infinite chess. His work on the automorphism tower problem lies at the intersection of group theory and set theory. Recently, he has been preoccupied with various mathematical and philosophical issues surrounding the set-theoretic multiverse, engaging with the emerging debate on pluralism in the philosophy of set theory, as well as the mathematical questions to which they lead, such as in his work on the modal logic of forcing and set-theoretic geology.
BerkeleyCSICUNYCaltechGraduate CenterJapanNew YorkUvAapproximation and coverautomorphism towercomputabilityforcinginfinitary computabilityinfinite chesslarge cardinalsmaximality principlemultiversephilosophical logicphilosophyphilosophy of mathematicsphilosophy of set theoryset theoryset-theoretic geologytall cardinalsunfoldable cardinalsuplifting cardinals