- Members of our group
- The Logic Seminar meets every Tuesday afternoon at 4:00 p.m.
- The Graduate Logic Seminar meets weekly Wednesdays at 4:00 p.m. without fixed topic, but with each student/faculty choosing a topic for his/her talk.
- The Midwest Computability Seminar meets once or twice a semester, usually on a Tuesday afternoon, on the University of Chicago campus.
- The Model Theory Day meets once a semester, usually on a Tuesday afternoon, on the University of Illinois at Chicago campus.
- The Graduate Student Conference in Logic traditionally meets in late April,
is organized by graduate students, and rotates typically between the University
of Wisconsin-Madison, the University of Illinois at Urbana-Champaign, the
University of Notre Dame, and universities in Chicago.

Former UW students Asher Kach (Google-Chicago) and Turbo Ho (Purdue) have written up some helpful instructions for future organizers. - UW logic theses since 1990 (many online, click on the arrow to the right)
- Ning Zhong: Generalized metric spaces and products (1990, M. Rudin)
- Avner Landver: Singular Baire numbers and related topics (1990, Kunen)
- Peter Cholak: Automorphism of the lattice of recursively enumberable sets (1991, Millar and Lempp)
- Timothy Daniel: Normality in box products and S-products (1991, M. Rudin)
- Tom Linton: Partial isomorphisms and continuous reductions with games (1991, A. Miller)
- Curt Tuckey: Nonstandard methods in the calculus of variations (1991, Keisler)
- Roman Zrotowski: Indescribility properties of large cardinals (1991, Kunen)
- Renling Jin: Independence relative to nonstandard analysis (1992, Keisler)
- Deborah Kaddah: Uniformity in the recursively enumerable degrees and infima in the degrees of the differences of recursively enumerable sets (1992, Lempp)
- David Lamb: Pseudocompact and densely compact spaces in products (1992, Kunen and M. Rudin)
- Zorana Lazarevic: Some shrinking spaces (1992, M. Rudin)
- Tammo Reisewitz: Hyperarithmetical relations and existentially decidable models in recursive model theory (1992, Millar)
- Mike Benedikt: Nonstandard analysis and special ultrafilters (1993, Keisler)
- Mirna Džamonja: A set-theoretic approach to some problems in measure theory (1993, Kunen)
- Michael Jahn: The index set of the cuppable sets (1993, Lempp)
- Louis Wingers: Countable box products (1993, Kunen)
- Lisa Galminas: Lattices of enumerable algebraic structures (1994, Lempp)
- Mark Johnson: Techniques in iterated forcing (1994, A. Miller)
- Steve Leonhardi: Generalized nonsplitting in the recursively enumerable degrees (1994, Lempp)
- Alan Letarte: Covering properties on the hyperfinite time line (1994, Keisler)
- Zoran Spasojević: Gaps, trees and iterated forcing (1994, Kunen)
- Rob Forsythe: Dynamical systems and temporal-model logic (1995, Robbin)
- Randy Pruim: Weakly hard languages and Kuratowski-Ulam theorems in resource bounded category (1995, D. Joseph)
- Matt Raw: Complexity of automorphisms of recursive linear orders (1995, Millar)
- Mark Ettinger: Topics in combinatorial games (1996, Keisler)
- Joan Hart: Some Results in set theory (1996, Kunen)
- Andrés Villaveces: Extensions of models of set theory: Height and large cardinals (1996, Kunen)
- Argimiro Arratia-Quesada: On the existence of normal forms for logics that capture complexity classes (1997, D. Joseph)
- Carlos Ortiz: On the existence of normal forms for logics that capture complexity classes and approximate truth in metric spaces (1997, Keisler)
- Chien-Ning Yeh: O-minimal expansions of ordered sets with unary functions (1997, Keisler)
- Philip Apps: Nonstandard stochastic matching processes and stochastic canards (1998, Keisler)
- Evan Griffiths: Completely mitotic Turing degrees, jump classes, and enumeration degrees (1998, Lempp)
- Wafik Lotfallah: Strong laws in finite model theory (1998, Keisler)
- Joã oTeixeira: Elliptic differential equations and their discretizations (1999, Keisler)
- Dejia Wang: Saturation properties in the computably enumerable degrees (2000, Lempp)
- Joni Baker: Some topological results on ultrafilters (2001, Kunen)
- Tim Cookson: Independence from cardinal arithmetic and random x random forcing (2002, A. Miller)
- Daniel Miller: A preparation theorem for Weierstrass systems (2003, Speissegger)
- Berit Nilsen Givens: Hypergraphs and chromatic numbers, with applications to the Bohr topology (2003, Kunen)
- Ramiro de la Vega: Homogeneity properties on compact spaces (2005, Kunen)
- Tom Kent: Decidability and
definability in the
Σ
^{0}_{2}-enumeration degrees (2005, Lempp) - Alex Raichev: Relative randomness via rK-reducibility (2006, Lempp)
- Elisa Vásquez: Geometric partitions of definable sets and the Cauchy-Crofton formula (2006, Speissegger)
- Chris Alfeld: To branch or not to
branch: Branching and non-branching in the Medvedev lattice of
Π
^{0}_{1}-classes (2007, Lempp) - Asher Kach: Characterizing the computable structures: Boolean algebras and linear orders (2007, Lempp)
- James Hunter: Higher-order reverse topology (2008, Lempp)
- Rob Owen: Outer model theory and the definability of forcing (2008, Kunen)
- Dilip Raghavan: MADness and set theory (2008, Kunen and Kastermans)
- Erik Andrejko: Between
*O*and Ostaszewski (2009, Kunen) - Ben Ellison: Boolean indexed models and Wheeler's Conjecture (2009, Ruitenburg)
- Dan McGinn: Quantifier elimination for a class of intuitionistic theories (2009, Ruitenburg)
- David Milovich: Order-theoretic invariants in set-theoretic topology (2009, Kunen)
- Dan Turetsky: Effective algebra and effective dimension (2010, Lempp)
- Achilles Beros: Applications of arithmetic complexity and priority arguments in algorithmic learning theory (2013, Lempp)
- Kostas Beros: Descriptive group theory (2013, A. Miller and J. Miller)
- Andrea Medini: The topology of ultrafilters as subspaces of the Cantor set and other topics (2013, Kunen)
- Mushfeq Khan: Some results on algorithmic randomness and computability-theoretic strength (2014, J. Miller)
- Ashutosh Kumar: On some problems in set-theoretic real analysis (2014, A. Miller)
- Brian Rice: The Thin Set Theorem for pairs and substructures of the Muchnik lattice (2014, Lempp)
- Kyle Riggs: Computable properties of decomposable and completely decomposable groups (2014, Moss (Indiana University) and Lempp)
- Kuanysh Abeshev: Computable numberings in hierarchies (2014, Badaev (Kazakh National University) and Lempp)
- Meng-Che ("Turbo") Ho: Randomizing and describing groups (2017, Andrews and Dymarz)
- Paul Tveite: Effectivizations of dimension and cardinal characteristics (2017, J. Miller)
- Reese Johnston: Computability in uncountable binary trees (2018, advisor: Lempp)
- Tamvana Makuluni: Complexity classificatitons in model theory and computable structures (2018, advisor: Andrews)
- Ethan McCarthy: Some results and applications of computability theory (2018, advisor: J. Miller)
- Wil Cocke: Idle words: Word maps on finite groups (2019, advisors: Boston and Isaacs)

- Logic Qualifying Exams