| Logic |
Faculty
- Steffen Lempp
Research: Computability Theory and Its Applications
to Model Theory, Algebra, Proof Theory, and Computer Science
lempp@math.wisc.edu
- Terry Millar
Research: Computability Theory
millar@math.wisc.edu
- Arnold W. Miller
Research: Set Theory of the Real Line
miller@math.wisc.edu
- Joseph S. Miller
Research: Computability Theory:
Algorithmic Randomness, Reverse Mathematics,
and Effective mathematics
(primarily computable analysis and topology)
jmiller@math.wisc.edu
Emeritus Faculty
- H. Jerome Keisler
Research: Model Theory and Nonstandard Analysis
keisler@math.wisc.edu
- Kenneth Kunen
Research: Set Theory, General Topology, Algebra
kunen@math.wisc.edu
- Mary Ellen Rudin
Research: Set-theoretic Topology
mrudin@math.wisc.edu
Postdoctoral Fellow
- Keng Meng (Selwyn) Ng
Research: Computability Theory
selwynng@math.wisc.edu
Recent Postdoctoral Fellow
- Bart Kastermans (now at University of Colorado-Boulder)
Research: Set TheoryGraduate Students
- Achilles Beros (advisor: Lempp)
aberos@math.wisc.edu
- Kostas Beros (advisor: A. Miller)
kberos@math.wisc.edu
- Nathan Collins
collins@math.wisc.edu
- Mushfeq Khan
khan@math.wisc.edu
- Ashutosh Kumar (advisor: A. Miller)
akumar@math.wisc.edu
- Andrea Medini (advisor: Kunen)
medini@math.wisc.edu
- Dan Rosendorf (advisor: Kunen)
rosendor@math.wisc.edu
- Annette Spyker (advisor: Lempp)
spyker@math.wisc.edu
- Dan Turetsky (advisor: Lempp)
turetsky@math.wisc.edu
Southern Wisconsin Logic Seminar
We meet roughly every other Tuesday afternoon at 3:30 p.m. or 4:00 p.m. for the Southern Wisconsin Logic Colloquium, the logic seminar for UW-Madison and Marquette University.Graduate Participation Seminar in Logic
The Graduate Student Logic Seminar (GPS Logic) meets every Thursday at 4 p.m.Logic Reading Seminar
The weekly logic reading seminar will continue in fall 2009 with a focus on the topic of Boolean algebras.Midwest Computability Seminar
The University of Wisconsin-Madison is, together with the University of Chicago and the University of Notre Dame, part of the Midwest Computability Seminar, which meets twice a semester, usually on a Tuesday afternoon, on the University of Chicago campus.UW logic theses since 1990 (many on line)
- 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 Σ-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 Lazarević: 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ão Teixeira: 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 Sigma02-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 Pi01-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)
Related Links
Maintained by Steffen Lempp (lempp@math.wisc.edu)