[1] Stephen M. Walk. Toward the definablility of the array noncomputable degrees. PhD thesis, University of Notre Dame, 1999. 1998 Graduate Student Union Teaching Award (Independent Instructor), 1999 Eli J. and Helen Shaheen Graduate Award in Science, currently a Professor at St. Cloud State in St. Cloud, MN. Pdf.
[2] Charles Frederick Dymphna McCoy. Relativization, categoricity, and dimension. PhD thesis, University of Notre Dame, 2000. co-directed with Julia Knight, 2000 Ph.D., 2000 Notre Dame Alumni Association Teaching Award, a Van Vleck/VIGRE visiting professor at the University of Wisconsin--Madison 2000--2, CSC Priest, currently at University of Portland. Pdf.
[3] Rebecca Weber. A definable relation between c.e. sets and ideals. PhD thesis, University of Notre Dame, 2004. Clare Boothe Luce fellowship, 1999-2003; Outstanding Graduate Student Teacher, 2003, 2004. First job was a lecturership at Penn State University. Second job was a tenure track position at Dartmouth. Pdf.
[4] Joshua A. Cole. On the elementary theories of the Muchnik and Medvedev Lattices of Π01 classes. PhD thesis, University of Notre Dame, 2009. Tenure track at St. Joseph's College, Indiana. Pdf.
[5] Logan M. Axon. Algorithmically Random Closed Sets and Probability. PhD thesis, University of Notre Dame, 2010. Tenure track at Gonzaga University. Pdf.
[6] Sean Walsh. Arithmetical Knowledge and Arithmetical Definability: Four Studies. PhD thesis, University of Notre Dame, 2010. co-directed with Michael Detlefsen, Ph.D. from Program in Logic and the Foundations of Mathematics sponsored by the Department of Philosophy and the Department of Mathematics, 3 year Postdoc at Birkbeck, University of London, Kurt Gödel fellowship (pre-doctoral) EUR 100K. Tenure track at UC--Irvine, Departmant of Logic and Philosophy of Science. Pdf.
[7] Christopher Porter. Mathematical and Philosophical Perspectives on Algorithmic Randomness. PhD thesis, University of Notre Dame, 2012. co-directed with Michael Detlefsen and Curtis Franks, Ph.D. from Program in Logic and the Foundations of Mathematics sponsored by the Department of Philosophy and the Department of Mathematics. Got a 2 year NSF International Research Fellowship in Paris, a postdoc at University of Florida, and now tenure track at Drake University. Pdf.
[8] Stephen Flood. Path, Trees, and the Computational Strength of Some Ramsey-type Theorems. PhD thesis, University of Notre Dame, 2012. Instructor at Penn State, 2012-13, Visiting Assistant Professor, UCONN-Waterbury, 2013-16. Tenure Track at Bridgewater State University, Massachusetts. Pdf.
[9] Quinn Culver. Topics in Algorithmic Randomness and Effective Probability. PhD thesis, University of Notre Dame, 2015. Lecturer at Fordham. Pdf.
[10] Justin Miller. Intrinsic density, asymptotic computability, and stochasticity. PhD thesis, University of Notre Dame, 2021. Postdoc at Dartmouth. Pdf.
[11] Li Ling Ko. Towards finding a lattice that characterozes the > ω2 recursively enumerable Turing degrees. PhD thesis, University of Notre Dame, 2021. Postdoc at Ohio State. Pdf.
[12] John V. Siratt. Some applications of formal Mathematics. PhD thesis, University of Notre Dame, 2024. Research Computer Scientist Rsch Aerospace Technology, Computer Rsch and Development, NASA. Pdf.

This file was generated by bibtex2html 1.99.