Skip to main content
Department of Mathematics College of Liberal Arts and Sciences





Curriculum Vitae – Douglas Cenzer

CURRICULUM VITAE

Douglas Cenzer

PRESENT POSITION: Emeritus Professor, University of Florida

Address

Department of Mathematics, University of Florida

P.O. Box 118105

358 Little Hall, Gainesville, FL 32611‑8105

email: cenzer@ufl.edu

URL: https://people.clas.ufl.edu/cenzer/

phone: 352‑294‑2350

Education

  • University of Michigan – Ph.D., Mathematics, 1972 (NSF Graduate Fellow)
  • Michigan State University – B.S., Mathematics, 1968 (Ford Motor Co. Fund Scholar)

    • Professional Experience

  • Professor of Mathematics, University of Florida, 1987–2023
  • Research Member, Math. Sciences Research Institute, Berkeley, Fall 2020
  • Chair, Department of Mathematics, University of Florida, 2013–2018
  • Visiting Fellow, Newton Institute, Cambridge, Spring 2012
  • Visiting Fellow, Mathematical Science Institute, Singapore, Summer 2011
  • Visiting Scholar, University of California at San Diego, 2002
  • Member, Math. Sciences Research Institute, Berkeley, 1989–1990
  • Visiting Professor, University of Michigan (Summer 1989, 1998, 2000, 2005)
  • Associate Professor, University of Florida, 1977–1987
  • Visiting Associate Professor, North Texas State University, 1981–1982
  • Assistant Professor, University of Florida, 1972–1977
  • NSF Graduate Fellow, University of Michigan, 1968–1972
  • Research Assistant, National Security Administration, 1967

    • Awards

  • University Term Professorship, 2021–2024
  • Anderson Scholar, CLAS, 1995, 1999, 2000, 2005, 2007
  • Exemplary Mentor Award from SEAGEP (Southeastern Alliance for Graduate Education and the Professoriate), 2006.
  • STEP (Sustained Performance Award), University of Florida, 2001 and 2009
  • CLAS Bonus Award, University of Florida, 1997
  • TIP Teaching Award, University of Florida, 1998

    • Grants

  • NSF Conference grant – SEALS, Co‑PI, $90,000, 2024–2027
  • NSF Conference grant – SEALS, Co‑PI, $48,000, 2020–2023
  • NSF Conference grant – SEALS, Co‑PI, $45,000, 2014–2018
  • NSF Computability in Europe 2011 (Conference Grant), PI $20,000
  • NSF Focused Research Group, PI, $580,000 (UF $65,000), 2007–2011
  • NSF Collaboration in Computability – Binational Travel Grant with Russia and Kazakhstan, co‑PI (Julia Knight, Notre Dame PI), 2000–2004 ($30,000); renewed 2006–2009 ($75,000); renewed 2011–2014 ($75,000)
  • Effectively Closed Sets, UF Faculty Enhancement Opportunity, PI, $22,824, 2010‑2011
  • DSR Award, University of Florida 1978 ($5,000) and 1991 ($8,000)
  • NSF Special Year in Logic Award, Co‑PI, 2005‑2008 $138,000 (NSF DMS 0532644)

    • Listing

  • American Men and Women of Science
  • Who’s Who in America
  • Who’s Who in Frontier Science
  • Who’s Who in American Teachers

    • Organisations

  • Association for Symbolic Logic – Chair, Membership Committee, 2001–2007
  • Phi Beta Kappa – Chapter President, 1994
  • CCA (Network for Computability and Complexity in Analysis)
  • CiE (Association for Computability in Europe)
  • American Mathematical Society; Pi Mu Epsilon

    • Service

    Editorial Activities

  • Archive for Mathematical Logic (Springer-Verlag) Editorial Board, 2002–…
  • Chinese Journal of Mathematics, Editorial Board, 2013–2019
  • The Scientific World Journal, 2013–2019
  • Edited special issue of Annals of Pure and Applied Logic, vol. 93 (1998)
  • Referee for numerous journals (e.g., Amer. Math. Monthly, Ann. Pure and Appl. Logic, Trans. Amer. Math. Soc., and many more)

    • Program Reviews

  • Program Review for Mathematics Department at Southern Illinois University, Spring 2019
  • Reviewed proposed Ph.D. program at Charleston College, Spring 2019

    • Other Professional Activities

  • Mathematics Program Review at Southern Illinois (2019)
  • Reviewed Ph.D. Program Proposal at College of Charleston (2019)
  • Reviewer for funding agencies: National Science Foundation; National Research Council of Canada; Marsden Fund (New Zealand); Research Foundation – Flanders (FWO); France‑Berkeley Foundation; Nazarbayev University via Oak Ridge
  • Reviewed dissertation for Ackermann Award of European Association of Computer Science Logic; External reference for hiring, tenure and promotion at U. Michigan, Penn State, U. San Francisco, U. Connecticut; George Washington U., National U. Australia, U. West Florida, U. Cincinnati, Arcadia University, Kenyon College, Auckland U. (New Zealand)

    • Conferences Organized

  • Program Committee for CCA 2022 (USA), 2010 (China), 2007 (Siena, Italy), 2004 (Cincinnati)
  • Program Committee for Colloquium Logicum 2020 and 2022
  • Organized Special Session on Computability at ASL annual meeting, New York, May 2019
  • Co‑organized 10 recent SEALS Symposia (SEALS 2015‑2026) in Gainesville
  • Program Committee for CiE 2016 (Paris) and 2012 (Cambridge)
  • Organizing Committee for joint AMS‑ASL special session on Probability and Logic, Joint Math Meetings, Baltimore, January 2014
  • Organized Special Session at AMS Regional Meeting in Washington, D.C., March 2012
  • Organizing Committee and Chair of Special Session on Classical Computability Theory at CIE 2011 (Sofia)
  • Organizing Committee, 5th Conference on Logic, Computability and Randomness, Notre Dame, May 24‑28 2010, with NSF support
  • Organized Summer School in Algorithmic Randomness, Gainesville, June 2008
  • Local Organizing Committee, Association for Symbolic Logic, Annual Meeting, March 2007
  • Co‑organized Workshop on Model Theory and Computable Model Theory, Gainesville, February 2006
  • Organized Computability and Complexity in Analysis (CCA 2006), Gainesville, November 2006
  • Organized AMS Special Session on Computability and Models, Annual Meeting, Baltimore, January 2003
  • Organized AMS Special Session on Computability Theory, Annual Meeting, San Diego, January 2002
  • Organized AMS Special Session on Computability Theory, Gainesville, Florida, March 1999
  • Organized AMS Special Session on Recursive and Feasible Mathematics, Orlando, Florida, January 1996
  • Local Organizing Committee, ASL Annual Meeting, Gainesville, Spring 1994

    • University Service

  • Council on Academic Freedom, Faculty Quality and Faculty Welfare, 2004–2007 and 2014–…
  • Faculty Senate Nominating Committee, 2005–2007
  • Committee on Academic Freedom, Tenure, Professional Relations and Standards, 2004–2007
  • Goldwater Scholarship Committee, 2006–09
  • University Library Committee, 1976–80
  • CLAS Tenure and Promotion Committee, 1980–81, 2007–2009

    • Department Service

  • Department Chair, July 2013 – August 2018
  • Tenure and Promotion Committee (Chair 1993–2013, 2019)
  • Library Committee (Chair 1975–2021)
  • Hiring Plan Committee
  • Steering Committee: 1983–85, 1986–88, 1998–2000, 2009–2011
  • Townsend Award Committee: 2022–2025

    • Theses and Dissertations

  • Cameron Fraize, 2023 (Co‑directed with Dana Bartosova), Ph.D. Dissertation – “Aspects of Algorithmically Random Objects”
  • Richard Krogman, 2022, Ph.D. Dissertation – “Injection Structures Specified by Finite State Machines”
  • John Hester, 2021, Ph.D. Dissertation – “Novel Methods for Automated First‑Order Theorem Proving”
  • Thomas Winckler, 2021, Ph.D. Dissertation – “Some Results Using Weak Axioms of Choice”
  • Francis Adams, 2017 (Co‑directed with J. Zapletal), Ph.D. Dissertation – “Anticliques in Borel Graphs on Polish Spaces and Computable Ultrahomogeneous Structures”
  • Ferit Toska, 2013 Ph.D. Dissertation – “Effective Symbolic Dynamics and Complexity”
  • Sebastian Wyman, 2013 Ph.D. Dissertation – “Closed Sets, Continuous Functions and Symbolic Dynamics in the Arithmetic Hierarchy”
  • Paul Brodhead, 2008 Ph.D. Dissertation – “Computable Aspects of Closed Sets”
  • S. Ali Dashti, 2008 Ph.D. Dissertation – “Effective Symbolic Dynamics”
  • Zia Uddin, 2004 Ph.D. Dissertation – “Structures Subject to Space Complexity”
  • Farzan Riazati, 2001 Ph.D. Dissertation – “On the Lattice of $\\Pi^0_1$ Classes”
  • Amy Vanderbilt, 2000 Ph.D. Dissertation – “Common Derivations in Locally Determined Nonmonotonic Rule Systems and their Complexity”
  • William Moser, 1996 Ph.D. Dissertation – “Approximation Methods in Inductive Inference”
  • (Undergraduate) Diego Rojas, McNair Scholar and NSF Graduate Fellow – “Computability and Differentiability of Functions on the Cantor Space”, 2017
  • (Undergraduate) Marc Betinsky, 1995 Senior Honors Thesis – “Implications and Explorations of the Wronskian”, Undergraduate Research Symposium winner 1995
  • Reviewer for Habilitations at U. Heidelberg (Germany), U. Vienna (Austria), U. Bundeswehr (Germany)
  • External Member of Ph.D. Committees at Auckland U. (New Zealand), Nanyang T.U. (Singapore), Notre Dame U., U. Waterloo (Canada)
  • Reviewer for Habilitation: U. Vienna (Austria); Universität Bundeswehr, Munich, Germany

    • Selected Lectures (since 1992)

  • “Homogeneous Linear Orderings”, JMM 2026, Washington DC, ASL Special Session, January 2026
  • “Decidability and Computability of Homogeneous Linear Orderings”, Hausdorff Institute of Mathematics, Bonn, Germany, September 2025
  • “Generically Computable Structures”, JMM 2024, San Francisco
  • “Generically Computable Abelian Groups”, UCNC 2023, UNF Jacksonville
  • “Densely Computable Structures and Isomorphisms”, MSRI conference on Number Theory and Decidability, July–August 2022
  • “Extraction Rates for Random Functions”, Computability Conference, Luminy, France, March 2022
  • (with Richard Krogman) The Isomorphism Problem for FST Injection Structures, Logical Foundations of Computer Science, January 2022
  • (with Richard Krogman) Complexity and Categoricity of FST Injection Structures Induced by Finite State Transducers, 17th Conference on Computability in Europe, Ghent, July 2021
  • “Generically Computable Structures”, Math. Sci. Research Institute Seminar, October 2020
  • “Extraction Rate for Random Functionals”, CCA 2020 (Computability and Complexity in Analysis), Bologna, Italy, September 2020
  • “Extraction Rate for Almost Total Functionals”, Special Session on Computability, Canadian Math. Society Winter Meeting, Toronto, CA, December 2109
  • “Generically Computable Structures”, Special Session on Computability, AMS sectional meeting, Hartford, CT, April 2019.
  • “Extraction Rates for Turing Functionals”, Special Session on Computability, AMS sectional meeting, Honolulu, Hawaii, March 2019.
  • “Computability and Complexity in Structure Theory”, Special Session on Computability in honor of Jeffrey B. Remmel, Joint Math Meetings, Baltimore, January 2019.
  • “Weakly Homogeneous Structures”, ASL Hour Talk at Joint Math Meetings, Baltimore, January 2019.
  • “Complexity of Automatic Structures and Isomorphisms”, Colloquium talk, College of Charleston, October 2018.
  • “Automatic Structures and Isomorphisms”, Keynote Address, Colloquium Logicum, Bayreuth, Germany, September 2018.
  • “Generically Computable Structures”, Workshop on Computability Theory and Its Applications, Waterloo, Canada, June 2018, sponsored by Fields Institute.
  • “Random and Online Continuous Functions”, Keynote Speaker at LMU (Munich) workshop on constructive mathematics, April 2018.
  • “Weakly Ultrahomogeneous Structures”, Aspects of Computation, National University of Singapore, September 2017.
  • “Injection structures specified by finite state transducers”, Computability and Complexity 2017, Raumati, New Zealand, January 2017
  • “Random members of $\\Pi^0_1$ classes”, AMS Sectional Meeting, Minneapollis, October 2016
  • “Random numbers as probabilities of machine behaviour”, Computability, Randomness and Applications, CIRM, Luminy, France, June 2016
  • “Index sets for Logic Programming”, Logical Foundations of Computer Science (LFCS 2016), Los Gatos, CA, February 2016
  • “Algorithmically random functions and effective capacities”, Université de Sherbrooke, January 2016
  • “Compressibility of closed sets”, CCR 2015, Heidelberg, June 2015
  • “Randomness and capacity”, TAMC 2015, Singapore, May 2015
  • “Weakly ultrahomogeneous structrues”, Special Session on Computable Structure Theory, AMS Sectional Meeting, Washington, D.C., March 2015
  • “Algorithmically random functions and effective capacities”, Winter Meeting of Canadian Math. Society, Hamilton, Ontario, December 2014.
  • “Ultrahomogeneous structures”, Colloquium Talk, College of Charleston, November 2014.
  • “Automatic Injection Structures”, Computability in Europe (CiE 2014), Budapest, June 2014
  • “Computability and Categoricity of Ultrahomogeneous Structures”, Computability in Europe (CiE 2014), Budapest, June 2014
  • “Effective Symbolic Dynamics and Complexity”, AMS Special Session, Ames, Iowa, April 2013.
  • “Finite-to-one Structures”, AMS–ASL Special Session, San Diego, January 2013.
  • “Sub-computable Bounded Randomness”, LFCS 2013 (Logical Foundations of Computer Science, San Diego, January 2013.
  • “Conservatively Approximable Functions”, CCA 2012, Cambridge, England, June 2013
  • “Bounded Randomness”, Computability in Europe 2012, Cambridge, UK, June 2012
  • “Effective Injection Structures”, Workshop on Incomputability, Newton Institute, Cambridge, England, June 2012
  • “$\\Pi^0_1$ structures”, Logic Seminar, George Washington University, March 2012
  • “Random Sets”, Recursion Theory Workshop, Computational Prospects for Infinity, National University of Singapore, August 2011
  • “Effective Categoricity of Injection Structures”, CiE 2011, Bulgaria, June 2011
  • “Structures and Isomorphisms in the Difference Hierarchy”, Workshop on Computability (Annual ASL meeting), March 2011
  • “Effective Randomness and Capacity”, Algorithmic Randomness Conference, Notre Dame, May 2010.
  • “Effective Symbolic Dynamics”, Colloquium Talk, College of Charleston, October 2009.
  • “Algorithmic Randomness”, Pi Mu Epsilon Talk, University of Florida, September 2009.
  • “$\\Sigma^0_1$ and $\\Pi^0_1$ Equivalence Structures”, Computability in Europe (CIE 2009), Heidelberg, July 2009
  • “Immunity of Closed Sets”, Computability in Europe (CIE 2009), Heidelberg, July 2009
  • “Effective randomness and Capacity of Closed Sets”, Computability in Europe (CIE 2009), Heidelberg, July 2009
  • “Random Union, Intersection and Membership”, Fourth International Conference on Algorithmic Randomness, Luminy, France, June 2009
  • “$\\mu$-randomness of Closed Sets and Elements”, Algorithmic Randomness Workshop, Madison, Wisconsin, May 2009.
  • “Structures in the Difference Hierarchy”, Logic Seminar, Notre Dame University, April 2009.
  • “Randomness and Capacity”, Informal Random Gathering, UC Berkeley, March 2009.
  • “Countable Subshifts”, AMS Special Session on Computable Dynamics, January 2009.
  • “Complexity Theory in Algebra and Combinatorics”, Computability, Reverse Mathematics and Combinatorics, Banff Research Station, December 2008
  • “Algorithmic Randomness”, Colloquium Talk, College of Charleston, April 2008
  • “The Cantor‑Bendixson Derivative and the Well‑founded Semantics of Logic Programming”, Tenth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January 2008.
  • “Algorithmic Methods for Equivalence Relations”, AMS Special Session on Algorithmic Methods for Algebraic Structures, Murfreesboro, Tennessee, November 2007
  • “Random Closed Sets and Continuous Functions”, Workshop on Effective Randomness, Chicago, September 2007
  • “Effective Symbolic Dynamics”, CCA 2007 (Computability and Complexity in Analysis), Siena, July 2007
  • “$K$‑Trivial Closed Sets and Continuous Functions”, CIE 2007 (Computability in Europe), Siena, July 2007
  • “Pseudojump Operators and $\\Pi^0_1$ Classes”, CIE 2007 (Computability in Europe), Siena, July 2007
  • “Random Closed Sets and Continuous Functions”, Special Session on Computability, AMS Regional Meeting, Storrs, November 2006.
  • “Random Closed Sets and Continuous Functions”, American Institute of Mathematics workshop on algorithmic randomness, August 2006
  • “Random Closed Sets”, Computability in Europe, Swansea, July 2006
  • “Space Complexity of Structures”, Computability in Europe, Swansea, July 2006
  • “Effectively Closed Sets”, ASL Winter Meeting, January 2006, invited hour talk
  • “Complexity of Inductive Definability”, Computability in Europe, Amsterdam, June 2005.
  • “Reverse Mathematics and the Stable Marriage Problem”, Special Session on Reverse Mathematics, AMS Annual Meeting, Atlanta, January 2005.
  • “Logic Progamming and Computabililty”, Special Session on Computability Theory and Applications, AMS Regional Meeting, Chicago, October 2004.
  • “Logic programming with infinite sets”, 8th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January 2004
  • “Index Sets for Computable Differential Equations”, International Conference on Computability and Complexity in Analysis, Cincinnati, August 2003
  • “Well‑ordered intervals in the lattice of $\\Pi^0_1$ classes”, Workshop on Computability and Logic, Heidelberg, June 2003
  • “Effectively Closed Sets”, Colloquium Talk, East Carolina University, March 2003
  • “Categoricity of Equivalence Structures”, Special Session on Computability and Models, Annual AMS Meeting, Baltimore, January 2003
  • “$\\Delta^0_2$-categoricity of $p$‑groups”, Special Session on Effectiveness Questions in Model Theory, AMS Sectional Meeting, Madison, Wisconsin, October 2002.
  • “On the Lattice of $\\Pi^0_1$ Classes”, Logic Seminar – University of Michigan, May 2002.
  • “Minimal and Thin Extensions of $\\Pi^0_1$ Classes”, Special Session on Computability Theory with Applications, Annual AMS Meeting, San Diego, January 2002.
  • “Index Sets for $\\omega$‑languages”, Workshop on Computability and Complexity in Analysis, Schloss Dagstuhl, Germany, November 2001.
  • “Degrees of Difficulty of $\\Pi^0_1$ Classes”, ASL Special Session on Reverse Mathematics, Annual Meeting of the Association for Symbolic Logic, Philadelphia, March 2001
  • “The lattice of $\\Pi^0_1$ classes”, Computability Theory Meeting, Oberwolfach, January 2001
  • “Locally Determined Nonmonotonic Rule Systems”, Colloquium, UC San Diego, May 11, 2000.
  • “The Lattice of $\\Pi^0_1$ Classes”, ASL Special Session on Computable Model Theory, Winter Meeting of Association for Symbolic Logic, Washington, January 23, 2000.
  • Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January 2000.
  • “Logic Programming and Nonmonotonic Reasoning”, El Paso, December 1999.
  • Workshop on Computability and Complexity in Analysis, Schloss Dagstuhl, Germany, November 1999.
  • Special Session on Artificial Intelligence, Federated Logic Meeting, Trento, Italy, July 1999.
  • AMS‑IMS‑SIAM Joint Summer Research Conference on Computability Theory and Applications, Boulder, Colorado, June 1999.
  • Special Session on Computability – Annual ASL Meeting, San Diego, March 1999.
  • Logic Seminar – University of Michigan, July 1998.
  • Logic Seminar (2 talks) – University of Chicago, May 1998.
  • Special Session in Computability Theory with applications – Annual AMS Meeting, Baltimore, January 1998.
  • Special Session in Computability – Regional AMS Meeting, Milwaukee, October 1997.
  • Recursion Theory meeting – Kazan, July 1997.
  • Computability and Complexity in Analysis, Schloss Dagstuhl, Saarbrucken, April 1997.
  • Colloquium – George Washington U., March 28, 1997.
  • Logic Seminar – University of Maryland, College Park, March 27, 1997.
  • Recursion Theory Meeting, Oberwolfach, January 1996.
  • Special Session on Recursive and Feasible Mathematics, Annual AMS Meeting, Orlando, January 1996.
  • Association for Symbolic Logic Annual Meeting, Irvine, April 1995.
  • Logic and Computational Complexity Workshop, Indiana U., October 1994.
  • Recursion Theory Workshop, Uppsala, Sweden, June 1994.
  • Special Session on Recursion Theory, AMS‑DMV Meeting, Heidelberg, October 1993.
  • Special Session on Recursion Theory, AMS Meeting, Washington, D.C., April 1993.
  • Logical Methods (in honor of A. Nerode), Cornell, June 1992.
  • Feasible Mathematics II, MSI, Cornell, May 1992.

    • Publications

    135. (with J. Remmel) Effectively Closed Sets ($\\Pi^0_1$ Classes), draft of 350 pages, Perspectives in Mathematical Logic, Cambridge University Press (2023).
    134. (with Wesley Calvert, David Gonzalez, and Valentina Harizanov) Generically computable linear orderings, Ann. Pure and Appl. Logic 176 (2025)
    133. (with Wesley Calvert and Valentina Harizanov) Generically computable abelian groups and isomorphisms, J. Logic and Computation 35 (2025)
    132. (with Chris Porter and Jindrich Zapletal) Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic, Volume 1: Set Theory, World Scientific Press, Second Edition (2025).
    130. (with Cameron Fraize and Christopher Porter) Extraction Rates of Algorithmically Random Continuous Functionals, Natural Computing (2025) 17-28.
    129. (with Wesley Calvert and Valentina Harizanov) Generically Computable Abelian Groups, UCNC 2023, Springer Lecture Notes in Computer Science 14003 (2023), 46-63.
    128. (with Cameron Fraize and Christopher Porter) Extraction Rates of Random Continuous Functionals, UCNC 2023, Springer Lecture Notes in Computer Science 14003 (2023), 46-63.
    127. (with Richard Krogman) Complexity of Injection Structures Induced by Finite State Transducers, J. Logic and Computation 32 (2022), 1504-1530.
    126. (with Wesley Calvert and Valentina Harizanov) Generically and Coarsely Computable Isomorphisms, Computability 11 (2022), 223-239. DOI: 10.3233/COM-210382 (2022)
    125. The Isomorphism Problem for FST Injection Structures (with Richard Krogman), LFCS 2022, Springer Lecture Notes in Computer Science 13137, eds. Sergei Artemov, Anil Nerode (2022), 25-36.
    124. (with Richard Krogman) Computability and Categoricity of FST Injection Structures, CiE 2021, 17th Conference on Computability in Europe, Ghent, July 2021, editors Liesbeth De Mol, Andreas Weiermann, Florin Manea and David Fernandez‑Duque, Springer Lecture Notes in Computer Science 12813 (2021), 106-119.
    123. (with Chris Porter) Randomness extraction in computability theory, Computability 12 (2023), 1-21. DOI: 10.3233/COM-210333.
    122. (with Wesley Calvert and Valentina Harizanov) Densely computable structures, Journal of Logic and Computation 32 (2022), 581-607.
    121. (with Jean Larson, Chris Porter and Jindrich Zapletal) Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic, Volume 2: Foundations of Mathematics, World Scientific Press (2022), ISBN: 978-981-124-384-4.
    120. (edited with Chris Porter and Jindrich Zapletal) Structure and Randomness in Computability and Set Theory, World Scientific Press (2020), 366 pages.
    119. (with W. Marek and J. Remmel) Logic Programming and Effectively Closed Sets, in Structure and Randomness in Computability and Set Theory, World Scientific Press (2020), 197-283.
    118. (Jean Larson, Chris Porter and Jindrich Zapletal) Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic, Volume 1: Set Theory, World Scientific Press (2020).
    117. (with Jacob Carson and Jeffrey Remmel) Effective categoricity of automatic equivalence and nested equivalence structures, Theory of Computing Systems 64 (2020), 1110-1139.
    116. (with W. Marek and J.B. Remmel) On the complexity of index sets for finite predicate logic programs which allow function symbols, J. Logic and Computation 30 (2020), 107-156, DOI: 10.1093/logcom/exaa005
    115. (with Francis Adams and Selwyn Ng) Computability and Categoricity of Weakly Homogeneous Boolean Algebras and Abelian p‑Groups, in Aspects of Computation and Automata with Applications (2024), World Scientific Press IMS LNS 42, 141-158.
    114. (with Diego Rojas) Online Computability and differentiation in the Cantor space, Sailing Routes on the World of Computation, Proc. 14th CiE, Springer Lecture Notes in Computer Science 10936 (2018), 136-145.
    113. (number omitted in original; placeholder)
    111. (with George Barmpalias and Christopher Porter) The probability of a computable output from a random oracle, ACM Transactions on Computational Logic 18 (2017), 15 pp. https://arxiv.org/abs/1612.0853 (2019).
    112. (with Christopher Porter) The random members of a $\\Pi^0_1$ class, Theory of Computing Systems 62 (2018) 1637-1671. https://arxiv.org/abs/1611.05818
    111. (with G. Barmpalias and C. Porter) Random numbers as probabilities of machine behaviour, Theoretical Computer Science 673 (2017), 1–18. https://arxiv.org/abs/1605.05838
    110. (with S. Buss, M. Minnes and J. Remmel), Injection structures specified by finite state transducers, in Computability and Complexity 2017, Downey Festschrift, eds. Noam Greenberg, B. Khoussainov, A. Day, M. Fellows, S. Melnikov, Springer Lecture Notes in Computer Science 10010 (2017), 1-24.
    109. (with Francis Adams) Computability and Categoricity of Weakly Ultrahomogeneous Structures, Computability 6 (2017), 365-389. https://arxiv.org/abs/1608.01254
    108. Index sets for finite normal predicate logic programs with function symbols (with V. Marek and J.B. Remmel), in Logical Foundations of Computer Science (LFCS 2016), Springer Lecture Notes in Computer Science vol. 9537 (2015), 60-75.
    107. (with Chris Porter) Algorithmically random functions and effective capacities. Theory and Methods of Computation (TAMC 2015), Springer Lecture Notes in Mathematics 9076 (2015), 22-37.
    106. (with S. Buss and J. Remmel) Sub‑comparable Bounded Randomness, Logical Methods in Computer Science 10 (2014).
    105. (with F. Adams) Computability and categoricity of ultrahomogeneous structures, in Language, Life, Limits (Proceedings of CiE 2014, Computability in Europe), Springer Lecture Notes in Computer Science 8493 (2014), 1-10.
    104. (with M. Minnes and J. Remmel), Injection structures specified by finite state transducers, CiE 2014, Electronic Proceedings.
    103. (with V. Harizanov and J. Remmel) Two‑to‑One Structures, Journal of Logic and Computation 23 (2013), 1195-1223.
    102. (with V. Harizanov and J. Remmel) Computability‑theoretic properties of injection structures, Algebra and Logic 53 (2014), 39-69.
    101. Various papers on $\\Pi^0_1$ classes (Review), Bulletin for Symbolic Logic 18 (2012), 409-412.
    100. (with J. Remmel) Subcomputable bounded pseudorandomness, in LFCS 2013 (Logical Foundations of Computer Science), San Diego, January 2013, Springer Lecture Notes in Computer Science 7734 (2013), 104-118.
    99. (with R. Weber) Effective randomness of unions and intersections, Theory of Computing Systems 52 (2013), 48-64.
    98. (with J.B. Remmel) A connection between the Cantor‑Bendixson derivative and the well‑founded semantics of finite logic programs, Ann.Math. and Artificial Intelligence 65 (2012), pp. 1-24.
    97. (with A. Dashti, F. Toska and S. Wyman) Computability of countable subshifts in one dimension, Theory of Computing Systems 51 (2012), pp. 352-371.
    96. (with P. Brodhead, F. Toska and S. Wyman) Algorithmic randomness and capacity of closed sets, Logical Methods in Computer Science 6 (2011), 1-16.
    95. (with V. Harizanov and J. Remmel) Effective categoricity of injection structures, CiE 2011, Springer Lecture Notes in Computer Science (2011), 51-60.
    94. (with V. Harizanov and J. Remmel) $\\Sigma^0_1$ and $\\Pi^0_1$ structures, Annals of Pure and Applied Logic 162 (2011), 490-503.
    93. (with J. Franklin, Jiang Lu, and Guohua Wu) A superhigh diamond in the c.e. tt‑degrees, Arch. Math. Logic 50 (2011), 33-44.
    92. (with J.B. Remmel) A connection between the Cantor‑Bendixson derivative and the well‑founded semantics of finite logic programs, Nonmon@30 (30 Years of Nonmonotonic Reasoning), Lexington, Kentucky, October 2010, URL: http://www.cs.uky.edu/~marek/nonmonat30.dir/cenzerRemmel.pdf
    91. (with A. Dashti, F. Toska and S. Wyman) Computability of countable subshifts, in Programs, Proofs and Processes, CIE 2010, eds. F. Ferreira et al., Springer Lecture Notes in Computer Science 6158 (2010) 88-97.
    90. (with Paul Brodhead) Effective capacity and randomness of closed sets, in Computability and Complexity in Analysis, CCA 2010, eds. X. Zheng and N. Zhong, Springer Electronic Proceedings in Theoretical Computer Science 24 (2010), 67-76.
    89. (with G. LaForte and J. Remmel) Equivalence structures and isomorphisms in the difference hierarchy, J. Symbolic Logic 74 (2009), 535-556.
    88. (with G. Laforte and G. Wu) Pseudojumps and $\\Pi^0_1$ classes, J. Logic and Computation 19 (2009), 77-87.
    87. (with G. Barmpalias, J. Remmel and R. Weber) $K$‑triviality of closed sets and continuous functions, J. Logic and Computation 19 (2009), 3-16.
    86. (with T. Kihara, R. Weber and G. Wu) Immunity and non‑cupping for closed sets, Tbilisi Math. Journal 2 (2009), 79-96.
    85. (with R. Downey, J. Remmel and Z. Uddin) Space Complexity of Abelian Groups, Archive for Math. Logic 48 (2009), 63-76.
    84. (Editor, with Valentina Harizanov, David Marker and Carol Wood) Proceedings of the Model Theory and Computable Model Theory Workshop, Gainesville, February 2007, Archive for Math. Logic 48 (2009), 1-6.
    83. (with W. Calvert, V. Harizanov and A. Morozov) Effective categoricity of Abelian $p$‑groups, Ann. Pure and Applied Logic 59 (2009), 187-197.
    82. (with B. Csima and B. Khoussainov) Linear orders with distinguished function symbols, Archive for Math. Logic 48 (2009), 115-140.
    81. (with V. Harizanov and J.B. Remmel) $\\Sigma^0_1$ and $\\Pi^0_1$ equivalence structures, in CIE 2009, K. Ambos‑Spies, B. Lowe and W. Merkle (eds.) Springer Lecture Notes in Computer Science 5635 (2009), 99-108.
    80. (with R. Weber and G. Wu) Immunity for closed sets, Springer Lecture Notes in Computer Science, in CIE 2009, K. Ambos‑Spies, B. Lowe and W. Merkle (eds.) Springer Lecture Notes in Computer Science 5635 (2009), 109-117.
    79. (with J. Franklin, Jiang Lu and Guohua Wu) Embedding the diamond lattice in the c.e. tt‑degrees with superhigh atoms, TAMC 2009 (Theory and Applications of Models of Computation), J. Chen and S.B. Cooper (Eds.), Springer Lecture Notes in Computer Science 5532 (2009), 420-429.
    78. (with S. Ali Dashti and Jonathan L.F. King) Computable Symbolic Dynamics, Math. Logic Quarterly 54 (2008), 524-533.
    77. (with P. Brodhead) Effectively closed sets and enumerations, Archive for Mathematical Logic 45 (2008), 565-582.
    76. (with Peter Hinman) Degrees of difficulty of generalized r.e. separating classes, Archive for Mathematical Logic 45 (2008), 629-647.
    75. (with J.B. Remmel) A connection between Cantor‑Bendixson derivatives and the well‑founded semantics of logic programs, ISAIM 2008, The Tenth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January 2008.
    74. (with Rebecca Weber) Preface to Special Issue of Archive for Math. Logic (Proceedings of CCA 2006) 45 (2008), 529-531.
    73. (with G. Barmpalias, P. Brodhead, J. Remmel and R. Weber) Algorithmic randomness of continuous functions, Archive for Mathematical Logic 45 (2008), 533-546.
    72. (with S. Ali Dashti and Jonathan L.F. King) Effective Symbolic Dynamics, CCA 2007 (Computability and Complexity in Analysis), Siena, June 2007, Eds. R. Dillhage, T. Grubb, A. Sorbi, K. Weihrauch and N. Zhong, Springer Electronic Notes in Computer Science 202 (2008), 89-99.
    71. (with G. Barmpalias, P. Brodhead, A. Dashti and R. Weber) Algorithmically random functions and effective capacities, Journal for Logic and Computation 17 (2007), 1041-1062.
    70. (with George Barmpalias, Jeffrey Remmel and Rebecca Weber) $K$‑trivial closed sets and continuous functions, in Computation and Logic in the Real World – Proceedings CIE 2007, Editors S.B. Cooper, B. Loewe and A. Sorbi, Springer Lecture Notes in Computer Science 4497 (2007), 135-145.
    69. (with G. Laforte, and G. Wu) Pseudojumps and $\\Pi^0_1$ classes, in Computation and Logic in the Real World – Proceedings CIE 2007, Editors S.B. Cooper, B. Loewe and A. Sorbi, Springer Lecture Notes in Computer Science 4497 (2007), 146-151.
    68. (Editor, with R. Dillhage, T. Grubb and K. Weihrauch) Third International Conference on Computability and Complexity in Analysis, Information Berichte, FernUniversität, 366 pages, and Springer Electronic Notes in Computer Science 167 (2007).
    67. (with Peter Hinman) Medvedev degrees of generalized r.e. separating classes, Proc. CCA 2006, D. Cenzer, R. Dillhage, T. Grubb and Klaus Weihrauch (eds.): Third International Conference on Computability and Complexity in Analysis, Information Berichte, FernUniversität (2006), 125-142, and Springer Electronic Notes in Computer Science 167 (2007).
    66. (with Paul Brodhead and Jeffrey Remmel) Random continuous functions, Proc. CCA 2006, D. Cenzer, R. Dillhage, T. Grubb and Klaus Weihrauch (eds.): Third International Conference on Computability and Complexity in Analysis, Information Berichte, FernUniversität (2006), 76-89, and Springer Electronic Notes in Computer Science 167 (2007).
    65. (with J. Remmel) On the complexity of inductive definitions, Mathematical Structures in Computer Science 16 (2006), 763-788.
    64. (with Zia Uddin) Space complexity of structures, in Logical Approaches to Computational Barriers, Proc. CIE 2006, A. Beckmann, U. Berger, B. Loewe and J.Tucker (eds.) Springer Lecture Notes in Computer Science 3988 (2006), 76-85.
    63. (with P. Brodhead and S. Dashti) Random closed sets, in Logical Approaches to Computational Barriers, Proc. CIE 2006, A. Beckmann, U. Berger, B. Loewe and J.Tucker (eds.) Springer Lecture Notes in Computer Science 3988 (2006), 55-64.
    62. (with W. Calvert, V. Harizanov and A. Morozov) Effective categoricity of Equivalence Structures, Annals of Pure and Applied Logic 141 (2006), 61-78.
    61. Decidability, completeness and complexity, Journal of Symbolic Logic 71 (2006), 399-424.
    60. (with J. Remmel) The complexity of inductive definability, in New Computational Paradigms, eds. S. Cooper, B. Loewe and L. Torenvliet, Springer-Verlag Lecture Notes in Computer Science vol. 3526 (2005), 75-85.
    59. (with F. Riazati) Minimal extensions of $\\Pi^0_1$ classes, Mathematical Logic Quarterly 51 (2005), 206-216.
    58. (with W. Marek and J. Remmel) Logic programming with infinite sets, Annals of Artificial Intelligence and Mathematics 44 (2005), 309-339.
    57. (with J. Remmel) Proof‑Theoretic Strength of the Stable Marriage Theorem and Other Problems, in “Reverse Mathematics 2001”, edited by S. Simpson, ASL Lecture Notes in Logic vol. 21, A.K. Peters (2005), 67-103.
    56. (with J. Remmel) Index sets for computable differential equations, pages, Math. Logic Quarterly 50 (2004), 329-344.
    55. (with J. Remmel and A. Vanderbilt) Complexity of Locally Determined Logic Programs and Recursive Stable Models, Annals of Mathematics and Artificial Intelligence 40 (2004), 225-262.
    54. (with A. Nies) Global properties of the lattice of $\\Pi^0_1$ classes, Proceedings Amer. Math. Society 132 (2004), 239-249.
    53. (with W. Marek and J. Remmel) Using logic programs to reason about infinite sets, 8th International Symposium on Artificial Intelligence and Mathematics (2004), http://rutcor.rutgers.edu/~amai/aimath04.
    52. (with J. Remmel) Index sets for computable real functions, Proceedings of Computability and Complexity in Analysis, Cincinnati, 2003, Information Berichte 302, FernUniversitat in Hagen (2003), 163–182.
    51. (with P. Hinman) Density of the Medvedev Lattice of $\\Pi^0_1$ classes, Archive for Mathematical Logic 42 (2003), 583-600.
    50. (with J. Remmel) Index sets in $\\omega$‑languages, Mathematical Logic Quarterly 49 (2003), 22–33.
    49. (with J. Remmel) Effectively closed sets and graphs of computable real functions, Theoretical Computer Science 284 (2002), pp. 279–318.
    48. (with A. Vanderbilt) Common Derivations in Locally Determined Logic Programs, conference paper, 7th International Symposium on AI and Mathematics, December 2001, URL: http://rutcor.rutgers.edu/~amai/aimath02
    47. (with A. Nies) Initial segments of the lattice of Pi‑0‑1 Classes, Journal of Symbolic Logic 66 (2001), 1749–1765.
    46. (with C. Jockusch) $\\Pi^0_1$ Classes – Structure and Applications, in Computability Theory and Its Applications, eds. P. Cholak, S. Lempp, M. Lerman and R. Shore, Contemporary Mathematics 257 (2000), 39–59.
    45. (with J. Remmel and A. Vanderbilt) The complexity of the set of
    the extensions of nonmonotonic rule systems, Artificial Intelligence
    and Mathematics conference paper, Fort Lauderdale, January 2000,
    http://rutcor.rutgers.edu/~amai/aimath00.

    44. (with J. Remmel and A. Vanderbilt) Locally Determined Logic Programs, in Logic Programming and Nonmonotonic Reasoning, El Paso, December 1999, Springer Lecture Notes in Artificial Intelligence 1730 (1999), 34–48.
    43. (with J. Remmel) Polynomial time versus computable Boolean algebras, in “Recursion Theory and Complexity” (Proc. 1997 Kazan Workshop), eds. M. Arslanov & S. Lempp, de Gruyter (1999), pp. 15–53.
    42. $\\Pi^0_1$ Classes in Computability Theory, in Handbook of Computability (ed. E. Griffor), North‑Holland Studies in Logic 140 (1999), pp. 37–85.
    41. (with V. Marek & J. Remmel) Index Sets for Finite Predicate Logic Programs, FLOC ’99 Workshop on “Complexity‑theoretic and Recursion‑theoretic methods in Databases, Artificial Intelligence and Finite Model Theory”, (1999), pp. 72–80.
    40. (with J. Remmel) Index Sets in Computable Analysis, Theoretical Computer Science 219 (Special Issue for 1997 Dagstuhl meeting on Computability and Complexity in Analysis) (1999), pp. 111–150.
    39. (with J. Remmel) Feasible graphs with standard universe, Proceedings Recursion Theory Week, Oberwolfach 1996, Annals of Pure and Applied Logic 94 (1998), pp. 21–35.
    38. (with J. Remmel) Index Sets for $\\Pi^0_1$ classes, Proceedings of AMS Special Session, Orlando 1996, Annals of Pure and Applied Logic 93 (1998), pp. 3–61.
    37. (with J. Remmel) $\\Pi^0_1$ Classes in Mathematics, “Handbook of Recursive Mathematics”, Vol. 2 (eds. Y. Ersov, S. Goncharov, W. Marek, A. Nerode, J. Remmel), North‑Holland Studies in Logic 139 (1998), pp. 623–821.
    36. (with J. Remmel) Complexity theoretic model theory and algebra, “Handbook of Recursive Mathematics”, Vol. 1 (eds. Y. Ersov, S. Goncharov, W. Marek, A. Nerode, J. Remmel), North‑Holland Studies in Logic 138 (1998), pp. 381–513.
    35. (Editor, with J. Remmel) Proceedings of AMS Special Session (Orlando 1996), Annals of Pure and Applied Logic 93 (1998), pp. 1–2.
    34. (with W. Moser) A Good Oracle is Hard to Beat, Algorithmica 22 (1998), pp. 18–34.
    33. (with J. Remmel) Complexity and Categoricity, Information and Computation 140 (1998), 2–25.
    32. (with J. Remmel) Feasibly categorical Abelian groups, in Proc. Feasible Math II (eds. P. Clote & J. Remmel), Birkhäuser (1995), 91–153.
    31. (with J. Remmel) Feasibly Categorical Models, in Logic and Computer Science (Proc. LCC ’94), Springer‑Verlag Lecture Notes in Computer Science 960 (1995), 300–312.
    30. (with W. Moser) Inductive inference of functions on the rationals, in COLT ’95 (Proc. 8th Annual Conf. Computational Learning Theory), ACM (1995), 178–181.
    29. (with J. Remmel) Feasible graphs and colorings, Math. Logic Quarterly 41 (1995), 327–352.
    28. (with R. Downey, C. Jockusch, R. Shore) Countable thin $\\Pi^0_1$ classes, Ann. Pure and Applied Logic 59 (1993), 79–139.
    27. Effective Dynamics, in Logical Methods (in honor of A. Nerode), eds. J. Crossley, J. Remmel, R. Shore, M. Sweedler, Birkhäuser (1993), 162–177.
    26. (with J. Remmel) Polynomial‑time Abelian groups, Ann. Pure and Applied Logic 56 (1992), 313–363.
    25. (with J. Remmel) Recursively presented games and strategies, Math. Social Sciences 24 (1992), 117–139.
    24. (with J. Remmel) Polynomial‑time versus recursive models, Annals of Pure and Applied Logic 54 (1991), 17–58.
    23. (with R.L. Smith) On the ranked points of a $\\Pi^0_1$ set, J. Symbolic Logic 54 (1989), 975–991.
    22. (with P. Clote, R. Smith, R. Soare, S. Wainer) Members of countable $\\Pi^0_1$ classes, Ann. Pure and Applied Logic 31 (1986), 45–63.
    21. The stability problem, new results and counterexamples, Letters in Math. Physics 10 (1985), 367–372.
    20. (with R.D. Mauldin) Borel equivalence and isomorphism of coanalytic sets, Dissertationes Math. 228 (1984), 1–32.
    19. (with R.D. Mauldin) Monotone reducibility and the family of finite sets, J. Symbolic Logic 49 (1984), 774–782.
    18. (with R.D. Mauldin) On the Borel class of the derived‑set operator, II, Bull. Soc. Math. de France 111 (1983), 367–372.
    17. (with R.D. Mauldin) Representations of well‑founded preference orders, Canadian J. Math. 35 (1983), 496–508.
    16. (with R.D. Mauldin) On the Borel class of the derived‑set operator, Bull. Soc. Math. France 110 (1982), 357–380.
    15. (with R.D. Mauldin) Faithful extensions of analytic sets to Borel sets, Houston J. Math. 6 (1980), 19–29.
    14. Non‑generable formal languages, Fund. Informaticae 3 (1980), 95–104.
    13. (with R.D. Mauldin) Inductive definability, measure and category, Advances in Math. 38 (1980), 55–90.
    12. The stability problem for transformations of the circle, Proc. Royal Soc. Edinburgh 84A (1979), 279–281.
    11. Parametrized inductive definitions and recursive inductive operators over the continuum, Fundamenta Mathematica 100 (1978), 10–15.
    10. (with R.D. Mauldin) Measurable parametrizations and selections, Trans. Amer. Math. Soc. 245 (1978), 399–408.
    9. (with E. Howorka) On vertex k‑partitions of certain infinite graphs, Discrete Math. 23 (1978), 105–113.
    8. Non‑generable r.e. sets, in Fundamentals of Computation Theory (Proc. Conf. Posnan 1977), Springer Lecture Notes in Computer Science 56 (1977), 379–385.
    7. Inductive definitions, positive and monotone, in Set Theory and Hierarchy Theory (Proc. Conf. Bierutowice 1975), Springer‑Verdy 537 (1976), 51–63.
    6. Monotone inductive definitions over the continuum, J. Symbolic Logic 41 (1976), 188–198.
    5. Analytic inductive definitions, J. Symbolic Logic 39 (1974), 310–312.
    4. Inductively defined sets of reals, Bull. Amer. Math. Soc. 80 (1974), 485–487.
    3. (with A.R. Blass) Cores of $\\Pi^1_1$ sets of reals, J. Symbolic Logic 39 (1974), 649–654.
    2. The boundedness principle in ordinal recursion, Fund. Math. 71 (1974), 203–212.
    1. Ordinal recursion and inductive definitions, in Generalized Recursion Theory (Proc. Conf. Oslo 1972), eds. J. Fenstad & P. Hinman, North‑Holland (1974), 221–264.

    All headings are properly nested and the page has sufficient color contrast for compliance with Title II accessibility requirements. The navigation list above allows screen‑reader users to jump directly to each section.