Curriculum Vitae \u2013 Douglas Cenzer<\/title> \n<meta name=\"viewport\" content=\"width=device-width, initial-scale=1\"><\/p>\n<style>\n body{font-family:serif;font-size:1.1rem;line-height:1.6;margin:1rem;padding:20px;}\n h1{font-size:2rem;margin-top:1.5rem;}\n h2{font-size:1.6rem;margin-top:1.3rem;}\n h3{font-size:1.3rem;margin-top:1.2rem;}\n section{margin-bottom:1.8rem;}\n ul,ol{margin:0 0 1rem 1.8rem;}\n li{margin-bottom:.4rem;}\n li {\n padding-left: 20px; \/* Adjust this value for more or less space *\/\n}\n .address p{margin:0;}\n .contact a{text-decoration:none;color:inherit;}\n .contact a:hover{text-decoration:underline;}\n .accessibility-note{font-size:.9rem;color:#555;}\n<\/style>\n<\/head><\/p>\n<body><\/p>\n<nav aria-label=\"Primary navigation\">\n<ul>\n<li> <a href=\"#bio\">Biography<\/a><\/li>\n<li> <a href=\"#education\">Education<\/a><\/li>\n<li> <a href=\"#experience\">Professional Experience<\/a><\/li>\n<li> <a href=\"#awards\">Awards<\/a><\/li>\n<li> <a href=\"#grants\">Grants<\/a><\/li>\n<li> <a href=\"#listing\"> Listing and Organizations <\/a><\/li>\n<li> <a href=\"#service\">Service<\/a><\/li>\n<li> <a href=\"#theses-and-disseminations\">Theses<\/a><\/li>\n<li> <a href=\"#lectures\">Selected Lectures<\/a><\/li>\n<li> <a href=\"#publications\">Publications<\/a><\/li>\n<li> <a href=\"#contact\">Contact<\/a><\/li>\n<\/ul>\n<\/nav>\n<header>\n<h1 id=\"bio\">CURRICULUM VITAE<\/strong><\/h1>\n<h2>Douglas Cenzer<\/h2>\nPRESENT POSITION:<\/strong> Emeritus Professor, University of Florida<\/p>\n<section class=\"address\" aria-label=\"address\">\n<section style=\"padding-left: 2em;\">\n<h3>Address<\/h3>\nDepartment of Mathematics, University of Florida<\/p>\nP.O. Box\u00a0118105<\/p>\n358 Little Hall, Gainesville, FL\u00a032611\u20118105<\/p>\nemail:<\/strong> <a href=\"mailto:cenzer@ufl.edu\">cenzer@ufl.edu<\/a><\/p>\nURL:<\/strong> <a href=\"https:\/\/people.clas.ufl.edu\/cenzer\/\">https:\/\/people.clas.ufl.edu\/cenzer\/<\/a><\/p>\nphone:<\/strong> 352\u2011294\u20112350<\/p>\n<\/section>\n<\/header>\n<section id=\"education\">\n<section style=\"padding-left: 2em;\">\n<h2>Education<\/h2>\n<li> University of Michigan \u2013 Ph.D., Mathematics, 1972 (NSF Graduate Fellow)<\/li>\n<li> Michigan State University \u2013 B.S., Mathematics, 1968 (Ford Motor Co. Fund Scholar)<\/li>\n<\/section>\n<section id=\"experience\">\n<section style=\"padding-left: 2em;\">\n<h2>Professional Experience<\/h2>\n<li> Professor of Mathematics, University of Florida, 1987\u20132023<\/li>\n<li> Research Member, Math. Sciences Research Institute, Berkeley, Fall\u00a02020<\/li>\n<li> Chair, Department of Mathematics, University of Florida, 2013\u20132018<\/li>\n<li> Visiting Fellow, Newton Institute, Cambridge, Spring\u00a02012<\/li>\n<li> Visiting Fellow, Mathematical Science Institute, Singapore, Summer\u00a02011<\/li>\n<li> Visiting Scholar, University of California at San Diego, 2002<\/li>\n<li> Member, Math. Sciences Research Institute, Berkeley, 1989\u20131990<\/li>\n<li> Visiting Professor, University of Michigan (Summer\u00a01989,\u00a01998,\u00a02000,\u00a02005)<\/li>\n<li> Associate Professor, University of Florida, 1977\u20131987<\/li>\n<li> Visiting Associate Professor, North Texas State University, 1981\u20131982<\/li>\n<li> Assistant Professor, University of Florida, 1972\u20131977<\/li>\n<li> NSF Graduate Fellow, University of Michigan, 1968\u20131972<\/li>\n<li> Research Assistant, National Security Administration, 1967<\/li>\n<\/section>\n<section id=\"awards\">\n<section style=\"padding-left: 2em;\">\n<h2>Awards<\/h2>\n<li> University Term Professorship, 2021\u20132024<\/li>\n<li> Anderson Scholar, CLAS, 1995, 1999, 2000, 2005, 2007<\/li>\n<li> Exemplary Mentor Award from SEAGEP (Southeastern Alliance for Graduate Education and the Professoriate), 2006.<\/li>\n<li> STEP (Sustained Performance Award), University of Florida, 2001 and 2009<\/li>\n<li> CLAS Bonus Award, University of Florida, 1997<\/li>\n<li> TIP Teaching Award, University of Florida, 1998<\/li>\n<\/section>\n<section id=\"grants\">\n<section style=\"padding-left: 2em;\">\n<h2>Grants<\/h2>\n<li> NSF Conference grant \u2013 SEALS, Co\u2011PI, $90,000, 2024\u20132027<\/li>\n<li> NSF Conference grant \u2013 SEALS, Co\u2011PI, $48,000, 2020\u20132023<\/li>\n<li> NSF Conference grant \u2013 SEALS, Co\u2011PI, $45,000, 2014\u20132018<\/li>\n<li> NSF Computability in Europe 2011 (Conference Grant), PI $20,000<\/li>\n<li> NSF Focused Research Group, PI, $580,000 (UF $65,000), 2007\u20132011<\/li>\n<li> NSF Collaboration in Computability \u2013 Binational Travel Grant with Russia and Kazakhstan, co\u2011PI (Julia Knight, Notre Dame PI), 2000\u20132004 ($30,000); renewed 2006\u20132009 ($75,000); renewed 2011\u20132014 ($75,000)<\/li>\n<li> Effectively Closed Sets, UF Faculty Enhancement Opportunity, PI, $22,824, 2010\u20112011<\/li>\n<li> DSR Award, University of Florida 1978 ($5,000) and 1991 ($8,000)<\/li>\n<li> NSF Special Year in Logic Award, Co\u2011PI, 2005\u20112008 $138,000 (NSF DMS\u00a00532644)<\/li>\n<\/section>\n<section id=\"listing\">\n<section style=\"padding-left: 2em;\">\n<h2>Listing<\/h2>\n<li> American\u202fMen\u202fand\u202fWomen\u202fof\u202fScience<\/li>\n<li> Who’s\u202fWho\u202fin\u202fAmerica<\/li>\n<li> Who’s\u202fWho\u202fin\u202fFrontier\u202fScience<\/li>\n<li> Who’s\u202fWho\u202fin\u202fAmerican\u202fTeachers<\/li>\n<h3>Organisations<\/h3>\n<li> Association for Symbolic Logic \u2013 Chair, Membership Committee, 2001\u20132007<\/li>\n<li> Phi Beta Kappa \u2013 Chapter President, 1994<\/li>\n<li> CCA (Network for Computability and Complexity in Analysis)<\/li>\n<li> CiE (Association for Computability in Europe)<\/li>\n<li> American Mathematical Society; Pi Mu Epsilon<\/li>\n<\/section>\n<section id=\"service\">\n<section style=\"padding-left: 2em;\">\n<h2>Service<\/h2>\n<h3>Editorial Activities<\/h3>\n<li> Archive for Mathematical Logic (Springer-Verlag) Editorial Board, 2002\u2013\u2026<\/li>\n<li> Chinese Journal of Mathematics, Editorial Board, 2013\u20132019<\/li>\n<li> The Scientific World Journal, 2013\u20132019<\/li>\n<li> Edited special issue of Annals of Pure and Applied Logic, vol.\u00a093 (1998)<\/li>\n<li> Referee for numerous journals (e.g., Amer. Math. Monthly, Ann. Pure and Appl. Logic, Trans. Amer. Math. Soc., and many more)<\/li>\n<h3>Program Reviews<\/h3>\n<li> Program Review for Mathematics Department at Southern Illinois\u202fUniversity, Spring 2019<\/li>\n<li> Reviewed proposed Ph.D. program at Charleston College, Spring 2019<\/li>\n<\/ol>\n<h3>Other Professional Activities<\/h3>\n<li> Mathematics Program Review at Southern Illinois (2019)<\/li>\n<li> Reviewed Ph.D. Program Proposal at College of Charleston (2019)<\/li>\n<li> Reviewer for funding agencies: National Science Foundation; National Research Council of Canada; Marsden Fund (New\u202fZealand); Research Foundation \u2013 Flanders (FWO); France\u2011Berkeley Foundation; Nazarbayev University via Oak Ridge<\/li>\n<li> Reviewed dissertation for Ackermann Award of European Association of Computer Science Logic; External reference for hiring, tenure and promotion at U.\u202fMichigan, Penn State, U.\u202fSan\u202fFrancisco, U.\u202fConnecticut; George Washington U., National U.\u202fAustralia, U.\u202fWest\u202fFlorida, U.\u202fCincinnati, Arcadia University, Kenyon College, Auckland U. (New\u202fZealand)<\/li>\n<h3>Conferences Organized<\/h3>\n<li> Program Committee for CCA 2022 (USA), 2010 (China), 2007 (Siena, Italy), 2004 (Cincinnati)<\/li>\n<li> Program Committee for Colloquium Logicum 2020 and 2022<\/li>\n<li> Organized Special Session on Computability at ASL annual meeting, New\u202fYork, May 2019<\/li>\n<li> Co\u2011organized 10 recent SEALS Symposia (SEALS 2015\u20112026) in Gainesville<\/li>\n<li> Program Committee for CiE 2016 (Paris) and 2012 (Cambridge)<\/li>\n<li> Organizing Committee for joint AMS\u2011ASL special session on Probability and Logic, Joint Math Meetings, Baltimore, January 2014<\/li>\n<li> Organized Special Session at AMS Regional Meeting in Washington, D.C., March 2012<\/li>\n<li> Organizing Committee and Chair of Special Session on Classical Computability Theory at CIE 2011 (Sofia)<\/li>\n<li> Organizing Committee, 5th Conference on Logic, Computability and Randomness, Notre\u202fDame, May 24\u201128 2010, with NSF support<\/li>\n<li> Organized Summer School in Algorithmic Randomness, Gainesville, June 2008<\/li>\n<li> Local Organizing Committee, Association for Symbolic Logic, Annual Meeting, March 2007<\/li>\n<li> Co\u2011organized Workshop on Model Theory and Computable Model Theory, Gainesville, February 2006<\/li>\n<li> Organized Computability and Complexity in Analysis (CCA 2006), Gainesville, November 2006<\/li>\n<li> Organized AMS Special Session on Computability and Models, Annual Meeting, Baltimore, January 2003<\/li>\n<li> Organized AMS Special Session on Computability Theory, Annual Meeting, San\u202fDiego, January 2002<\/li>\n<li> Organized AMS Special Session on Computability Theory, Gainesville, Florida, March 1999<\/li>\n<li> Organized AMS Special Session on Recursive and Feasible Mathematics, Orlando, Florida, January 1996<\/li>\n<li> Local Organizing Committee, ASL Annual Meeting, Gainesville, Spring 1994<\/li>\n<h3>University Service<\/h3>\n<li> Council on Academic Freedom, Faculty Quality and Faculty Welfare, 2004\u20132007 and 2014\u2013\u2026<\/li>\n<li> Faculty Senate Nominating Committee, 2005\u20132007<\/li>\n<li> Committee on Academic Freedom, Tenure, Professional Relations and Standards, 2004\u20132007<\/li>\n<li> Goldwater Scholarship Committee, 2006\u201309<\/li>\n<li> University Library Committee, 1976\u201380<\/li>\n<li> CLAS Tenure and Promotion Committee, 1980\u201381, 2007\u20132009<\/li>\n<h3>Department Service<\/h3>\n<li> Department Chair, July\u00a02013 \u2013 August\u00a02018<\/li>\n<li> Tenure and Promotion Committee (Chair 1993\u20132013, 2019)<\/li>\n<li> Library Committee (Chair 1975\u20132021)<\/li>\n<li> Hiring Plan Committee<\/li>\n<li> Steering Committee: 1983\u201385, 1986\u201388, 1998\u20132000, 2009\u20132011<\/li>\n<li> Townsend Award Committee: 2022\u20132025<\/li>\n<\/section>\n<section id=\"theses-and-disseminations\">\n<section style=\"padding-left: 2em;\">\n<h2>Theses and Dissertations<\/h2>\n<li> Cameron Fraize, 2023 (Co\u2011directed with Dana Bartosova), Ph.D. Dissertation \u2013 \u201cAspects of Algorithmically Random Objects\u201d<\/li>\n<li> Richard Krogman, 2022, Ph.D. Dissertation \u2013 \u201cInjection Structures Specified by Finite State Machines\u201d<\/li>\n<li> John Hester, 2021, Ph.D. Dissertation \u2013 \u201cNovel Methods for Automated First\u2011Order Theorem Proving\u201d<\/li>\n<li> Thomas Winckler, 2021, Ph.D. Dissertation \u2013 \u201cSome Results Using Weak Axioms of Choice\u201d<\/li>\n<li> Francis Adams, 2017 (Co\u2011directed with J.\u202fZapletal), Ph.D. Dissertation \u2013 \u201cAnticliques in Borel Graphs on Polish Spaces and Computable Ultrahomogeneous Structures\u201d<\/li>\n<li> Ferit Toska, 2013 Ph.D. Dissertation \u2013 \u201cEffective Symbolic Dynamics and Complexity\u201d<\/li>\n<li> Sebastian Wyman, 2013 Ph.D. Dissertation \u2013 \u201cClosed Sets, Continuous Functions and Symbolic Dynamics in the Arithmetic Hierarchy\u201d<\/li>\n<li> Paul Brodhead, 2008 Ph.D. Dissertation \u2013 \u201cComputable Aspects of Closed Sets\u201d<\/li>\n<li> S.\u202fAli\u202fDashti, 2008 Ph.D. Dissertation \u2013 \u201cEffective Symbolic Dynamics\u201d<\/li>\n<li> Zia Uddin, 2004 Ph.D. Dissertation \u2013 \u201cStructures Subject to Space Complexity\u201d<\/li>\n<li> Farzan Riazati, 2001 Ph.D. Dissertation \u2013 \u201cOn the Lattice of $\\\\Pi^0_1$ Classes\u201d<\/li>\n<li> Amy Vanderbilt, 2000 Ph.D. Dissertation \u2013 \u201cCommon Derivations in Locally Determined Nonmonotonic Rule Systems and their Complexity\u201d<\/li>\n<li> William Moser, 1996 Ph.D. Dissertation \u2013 \u201cApproximation Methods in Inductive Inference\u201d<\/li>\n<li> (Undergraduate) Diego Rojas, McNair Scholar and NSF Graduate Fellow \u2013 \u201cComputability and Differentiability of Functions on the Cantor Space\u201d, 2017<\/li>\n<li> (Undergraduate) Marc Betinsky, 1995 Senior Honors Thesis \u2013 \u201cImplications and Explorations of the Wronskian\u201d, Undergraduate Research Symposium winner 1995<\/li>\n<li> Reviewer for Habilitations at U.\u202fHeidelberg (Germany), U.\u202fVienna (Austria), U.\u202fBundeswehr (Germany)<\/li>\n<li> External Member of Ph.D. Committees at Auckland U. (New\u202fZealand), Nanyang T.U. (Singapore), Notre\u202fDame U., U.\u202fWaterloo (Canada)<\/li>\n<li> Reviewer for Habilitation: U.\u202fVienna (Austria); Universit\u00e4t Bundeswehr, Munich, Germany<\/li>\n<\/section>\n<section id=\"lectures\">\n<h2>Selected Lectures (since\u00a01992)<\/h2>\n<section style=\"padding-left: 2em;\">\n<li> “Homogeneous Linear Orderings”, JMM\u00a02026, Washington\u00a0DC, ASL Special Session, January\u00a02026<\/li>\n<li> “Decidability and Computability of Homogeneous Linear Orderings”, Hausdorff Institute of Mathematics, Bonn, Germany, September\u00a02025<\/li>\n<li> “Generically Computable Structures”, JMM\u00a02024, San\u00a0Francisco<\/li>\n<li> “Generically Computable Abelian Groups”, UCNC\u00a02023, UNF Jacksonville<\/li>\n<li> “Densely Computable Structures and Isomorphisms”, MSRI conference on Number Theory and Decidability, July\u2013August\u00a02022<\/li>\n<li> “Extraction Rates for Random Functions”, Computability Conference, Luminy, France, March\u00a02022<\/li>\n<li> (with Richard Krogman) The Isomorphism Problem for FST Injection Structures, Logical Foundations of Computer Science, January\u00a02022<\/li>\n<li> (with Richard Krogman) Complexity and Categoricity of FST Injection Structures Induced by Finite State Transducers, 17th Conference on Computability in Europe, Ghent, July\u00a02021<\/li>\n<li> “Generically Computable Structures”, Math. Sci. Research Institute Seminar, October\u00a02020<\/li>\n<li> “Extraction Rate for Random Functionals”, CCA\u00a02020 (Computability and Complexity in Analysis), Bologna, Italy, September\u00a02020<\/li>\n<li> “Extraction Rate for Almost Total Functionals”, Special Session on Computability, Canadian Math. Society Winter Meeting, Toronto, CA, December\u00a02109<\/li>\n<li> “Generically Computable Structures”, Special Session on Computability, AMS sectional meeting, Hartford, CT, April\u00a02019.<\/li>\n<li> “Extraction Rates for Turing Functionals”, Special Session on Computability, AMS sectional meeting, Honolulu, Hawaii, March\u00a02019.<\/li>\n<li> “Computability and Complexity in Structure Theory”, Special Session on Computability in honor of Jeffrey B. Remmel, Joint Math Meetings, Baltimore, January\u00a02019.<\/li>\n<li> “Weakly Homogeneous Structures”, ASL Hour Talk at Joint Math Meetings, Baltimore, January\u00a02019.<\/li>\n<li> “Complexity of Automatic Structures and Isomorphisms”, Colloquium talk, College of Charleston, October\u00a02018.<\/li>\n<li> “Automatic Structures and Isomorphisms”, Keynote Address, Colloquium Logicum, Bayreuth, Germany, September\u00a02018.<\/li>\n<li> “Generically Computable Structures”, Workshop on Computability Theory and Its Applications, Waterloo, Canada, June\u00a02018, sponsored by Fields Institute.<\/li>\n<li> “Random and Online Continuous Functions”, Keynote Speaker at LMU (Munich) workshop on constructive mathematics, April\u00a02018.<\/li>\n<li> “Weakly Ultrahomogeneous Structures”, Aspects of Computation, National University of Singapore, September\u00a02017.<\/li>\n<li> “Injection structures specified by finite state transducers”, Computability and Complexity 2017, Raumati, New\u00a0Zealand, January\u00a02017<\/li>\n<li> “Random members of $\\\\Pi^0_1$ classes”, AMS Sectional Meeting, Minneapollis, October\u00a02016<\/li>\n<li> “Random numbers as probabilities of machine behaviour”, Computability, Randomness and Applications, CIRM, Luminy, France, June\u00a02016<\/li>\n<li> “Index sets for Logic Programming”, Logical Foundations of Computer Science (LFCS 2016), Los Gatos, CA, February\u00a02016<\/li>\n<li> “Algorithmically random functions and effective capacities”, Universit\u00e9 de Sherbrooke, January\u00a02016<\/li>\n<li> “Compressibility of closed sets”, CCR\u00a02015, Heidelberg, June\u00a02015<\/li>\n<li> “Randomness and capacity”, TAMC 2015, Singapore, May\u00a02015<\/li>\n<li> “Weakly ultrahomogeneous structrues”, Special Session on Computable Structure Theory, AMS Sectional Meeting, Washington, D.C., March\u00a02015<\/li>\n<li> “Algorithmically random functions and effective capacities”, Winter Meeting of Canadian Math. Society, Hamilton, Ontario, December\u00a02014.<\/li>\n<li> “Ultrahomogeneous structures”, Colloquium Talk, College of Charleston, November\u00a02014.<\/li>\n<li> “Automatic Injection Structures”, Computability in Europe (CiE 2014), Budapest, June\u00a02014<\/li>\n<li> “Computability and Categoricity of Ultrahomogeneous Structures”, Computability in Europe (CiE 2014), Budapest, June\u00a02014<\/li>\n<li> “Effective Symbolic Dynamics and Complexity”, AMS Special Session, Ames, Iowa, April\u00a02013.<\/li>\n<li> “Finite-to-one Structures”, AMS\u2013ASL Special Session, San Diego, January\u00a02013.<\/li>\n<li> “Sub-computable Bounded Randomness”, LFCS\u00a02013 (Logical Foundations of Computer Science, San Diego, January\u00a02013.<\/li>\n<li> “Conservatively Approximable Functions”, CCA\u00a02012, Cambridge, England, June\u00a02013<\/li>\n<li> “Bounded Randomness”, Computability in Europe\u00a02012, Cambridge, UK, June\u00a02012<\/li>\n<li> “Effective Injection Structures”, Workshop on Incomputability, Newton Institute, Cambridge, England, June\u00a02012<\/li>\n<li> “$\\\\Pi^0_1$ structures”, Logic Seminar, George Washington University, March\u00a02012<\/li>\n<li> “Random Sets”, Recursion Theory Workshop, Computational Prospects for Infinity, National University of Singapore, August\u00a02011<\/li>\n<li> “Effective Categoricity of Injection Structures”, CiE\u00a02011, Bulgaria, June\u00a02011<\/li>\n<li> “Structures and Isomorphisms in the Difference Hierarchy”, Workshop on Computability (Annual ASL meeting), March\u00a02011<\/li>\n<li> “Effective Randomness and Capacity”, Algorithmic Randomness Conference, Notre Dame, May\u00a02010.<\/li>\n<li> “Effective Symbolic Dynamics”, Colloquium Talk, College of Charleston, October\u00a02009.<\/li>\n<li> “Algorithmic Randomness”, Pi Mu Epsilon Talk, University of Florida, September\u00a02009.<\/li>\n<li> “$\\\\Sigma^0_1$ and $\\\\Pi^0_1$ Equivalence Structures”, Computability in Europe (CIE 2009), Heidelberg, July\u00a02009<\/li>\n<li> “Immunity of Closed Sets”, Computability in Europe (CIE 2009), Heidelberg, July\u00a02009<\/li>\n<li> “Effective randomness and Capacity of Closed Sets”, Computability in Europe (CIE 2009), Heidelberg, July\u00a02009<\/li>\n<li> “Random Union, Intersection and Membership”, Fourth International Conference on Algorithmic Randomness, Luminy, France, June\u00a02009<\/li>\n<li> “$\\\\mu$-randomness of Closed Sets and Elements”, Algorithmic Randomness Workshop, Madison, Wisconsin, May\u00a02009.<\/li>\n<li> “Structures in the Difference Hierarchy”, Logic Seminar, Notre Dame University, April\u00a02009.<\/li>\n<li> “Randomness and Capacity”, Informal Random Gathering, UC Berkeley, March\u00a02009.<\/li>\n<li> “Countable Subshifts”, AMS Special Session on Computable Dynamics, January\u00a02009.<\/li>\n<li> “Complexity Theory in Algebra and Combinatorics”, Computability, Reverse Mathematics and Combinatorics, Banff Research Station, December\u00a02008<\/li>\n<li> “Algorithmic Randomness”, Colloquium Talk, College of Charleston, April\u00a02008<\/li>\n<li> “The Cantor\u2011Bendixson Derivative and the Well\u2011founded Semantics of Logic Programming”, Tenth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January\u00a02008.<\/li>\n<li> “Algorithmic Methods for Equivalence Relations”, AMS Special Session on Algorithmic Methods for Algebraic Structures, Murfreesboro, Tennessee, November\u00a02007<\/li>\n<li> “Random Closed Sets and Continuous Functions”, Workshop on Effective Randomness, Chicago, September\u00a02007<\/li>\n<li> “Effective Symbolic Dynamics”, CCA 2007 (Computability and Complexity in Analysis), Siena, July\u00a02007<\/li>\n<li> “$K$\u2011Trivial Closed Sets and Continuous Functions”, CIE 2007 (Computability in Europe), Siena, July\u00a02007<\/li>\n<li> “Pseudojump Operators and $\\\\Pi^0_1$ Classes”, CIE 2007 (Computability in Europe), Siena, July\u00a02007<\/li>\n<li> “Random Closed Sets and Continuous Functions”, Special Session on Computability, AMS Regional Meeting, Storrs, November\u00a02006.<\/li>\n<li> “Random Closed Sets and Continuous Functions”, American Institute of Mathematics workshop on algorithmic randomness, August\u00a02006<\/li>\n<li> “Random Closed Sets”, Computability in Europe, Swansea, July\u00a02006<\/li>\n<li> “Space Complexity of Structures”, Computability in Europe, Swansea, July\u00a02006<\/li>\n<li> “Effectively Closed Sets”, ASL Winter Meeting, January\u00a02006, invited hour talk<\/li>\n<li> “Complexity of Inductive Definability”, Computability in Europe, Amsterdam, June\u00a02005.<\/li>\n<li> “Reverse Mathematics and the Stable Marriage Problem”, Special Session on Reverse Mathematics, AMS Annual Meeting, Atlanta, January\u00a02005.<\/li>\n<li> “Logic Progamming and Computabililty”, Special Session on Computability Theory and Applications, AMS Regional Meeting, Chicago, October\u00a02004.<\/li>\n<li> “Logic programming with infinite sets”, 8th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January\u00a02004<\/li>\n<li> “Index Sets for Computable Differential Equations”, International Conference on Computability and Complexity in Analysis, Cincinnati, August\u00a02003<\/li>\n<li> “Well\u2011ordered intervals in the lattice of $\\\\Pi^0_1$ classes”, Workshop on Computability and Logic, Heidelberg, June\u00a02003<\/li>\n<li> “Effectively Closed Sets”, Colloquium Talk, East Carolina University, March\u00a02003<\/li>\n<li> “Categoricity of Equivalence Structures”, Special Session on Computability and Models, Annual AMS Meeting, Baltimore, January\u00a02003<\/li>\n<li> “$\\\\Delta^0_2$-categoricity of $p$\u2011groups”, Special Session on Effectiveness Questions in Model Theory, AMS Sectional Meeting, Madison, Wisconsin, October\u00a02002.<\/li>\n<li> “On the Lattice of $\\\\Pi^0_1$ Classes”, Logic Seminar \u2013 University of Michigan, May\u00a02002.<\/li>\n<li> “Minimal and Thin Extensions of $\\\\Pi^0_1$ Classes”, Special Session on Computability Theory with Applications, Annual AMS Meeting, San Diego, January\u00a02002.<\/li>\n<li> “Index Sets for $\\\\omega$\u2011languages”, Workshop on Computability and Complexity in Analysis, Schloss Dagstuhl, Germany, November\u00a02001.<\/li>\n<li> “Degrees of Difficulty of $\\\\Pi^0_1$ Classes”, ASL Special Session on Reverse Mathematics, Annual Meeting of the Association for Symbolic Logic, Philadelphia, March\u00a02001<\/li>\n<li> “The lattice of $\\\\Pi^0_1$ classes”, Computability Theory Meeting, Oberwolfach, January\u00a02001<\/li>\n<li> “Locally Determined Nonmonotonic Rule Systems”, Colloquium, UC San Diego, May\u00a011, 2000.<\/li>\n<li> “The Lattice of $\\\\Pi^0_1$ Classes”, ASL Special Session on Computable Model Theory, Winter Meeting of Association for Symbolic Logic, Washington, January\u00a023, 2000.<\/li>\n<li> Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January\u00a02000.<\/li>\n<li> “Logic Programming and Nonmonotonic Reasoning”, El Paso, December\u00a01999.<\/li>\n<li> Workshop on Computability and Complexity in Analysis, Schloss Dagstuhl, Germany, November\u00a01999.<\/li>\n<li> Special Session on Artificial Intelligence, Federated Logic Meeting, Trento, Italy, July\u00a01999.<\/li>\n<li> AMS\u2011IMS\u2011SIAM Joint Summer Research Conference on Computability Theory and Applications, Boulder, Colorado, June\u00a01999.<\/li>\n<li> Special Session on Computability \u2013 Annual ASL Meeting, San Diego, March\u00a01999.<\/li>\n<li> Logic Seminar \u2013 University of Michigan, July\u00a01998.<\/li>\n<li> Logic Seminar (2 talks) \u2013 University of Chicago, May\u00a01998.<\/li>\n<li> Special Session in Computability Theory with applications \u2013 Annual AMS Meeting, Baltimore, January\u00a01998.<\/li>\n<li> Special Session in Computability \u2013 Regional AMS Meeting, Milwaukee, October\u00a01997.<\/li>\n<li> Recursion Theory meeting \u2013 Kazan, July\u00a01997.<\/li>\n<li> Computability and Complexity in Analysis, Schloss Dagstuhl, Saarbrucken, April\u00a01997.<\/li>\n<li> Colloquium \u2013 George Washington U., March\u00a028, 1997.<\/li>\n<li> Logic Seminar \u2013 University of Maryland, College Park, March\u00a027, 1997.<\/li>\n<li> Recursion Theory Meeting, Oberwolfach, January\u00a01996.<\/li>\n<li> Special Session on Recursive and Feasible Mathematics, Annual AMS Meeting, Orlando, January\u00a01996.<\/li>\n<li> Association for Symbolic Logic Annual Meeting, Irvine, April\u00a01995.<\/li>\n<li> Logic and Computational Complexity Workshop, Indiana U., October\u00a01994.<\/li>\n<li> Recursion Theory Workshop, Uppsala, Sweden, June\u00a01994.<\/li>\n<li> Special Session on Recursion Theory, AMS\u2011DMV Meeting, Heidelberg, October\u00a01993.<\/li>\n<li> Special Session on Recursion Theory, AMS Meeting, Washington, D.C., April\u00a01993.<\/li>\n<li> Logical Methods (in honor of A. Nerode), Cornell, June\u00a01992.<\/li>\n<li> Feasible Mathematics II, MSI, Cornell, May\u00a01992.<\/li>\n<\/section>\n<section id=\"publications\">\n<section style=\"padding-left: 2em;\">\n<h2>Publications<\/h2>\n\n 135.<\/strong> (with J. Remmel) Effectively Closed Sets ($\\\\Pi^0_1$ Classes), draft of 350 pages, Perspectives in Mathematical Logic, Cambridge University Press (2023). \n 134.<\/strong> (with Wesley Calvert, David Gonzalez, and Valentina Harizanov) Generically computable linear orderings, Ann. Pure and Appl. Logic 176 (2025) \n 133.<\/strong> (with Wesley Calvert and Valentina Harizanov) Generically computable abelian groups and isomorphisms, J. Logic and Computation 35 (2025) \n 132.<\/strong> (with\u00a0Chris Porter and Jindrich Zapletal) Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic, Volume\u00a01: Set Theory, World Scientific Press, Second Edition (2025). \n 130.<\/strong> (with Cameron Fraize and Christopher Porter) Extraction Rates of Algorithmically Random Continuous Functionals, Natural Computing (2025) 17-28. \n 129.<\/strong> (with Wesley Calvert and Valentina Harizanov) Generically Computable Abelian Groups, UCNC 2023, Springer Lecture Notes in Computer Science 14003 (2023), 46-63. \n 128.<\/strong> (with Cameron Fraize and Christopher Porter) Extraction Rates of Random Continuous Functionals, UCNC 2023, Springer Lecture Notes in Computer Science 14003 (2023), 46-63. \n 127.<\/strong> (with Richard Krogman) Complexity of Injection Structures Induced by Finite State Transducers, J. Logic and Computation 32 (2022), 1504-1530. \n 126.<\/strong> (with Wesley Calvert and Valentina Harizanov) Generically and Coarsely Computable Isomorphisms, Computability 11 (2022), 223-239. DOI: 10.3233\/COM-210382 (2022) \n 125.<\/strong> 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. \n 124.<\/strong> (with Richard Krogman) Computability and Categoricity of FST Injection Structures, CiE 2021, 17th Conference on Computability in Europe, Ghent, July\u00a02021, editors Liesbeth De Mol, Andreas Weiermann, Florin Manea and David Fernandez\u2011Duque, Springer Lecture Notes in Computer Science 12813 (2021), 106-119. \n 123.<\/strong> (with Chris Porter) Randomness extraction in computability theory, Computability 12 (2023), 1-21. DOI: 10.3233\/COM-210333. \n 122.<\/strong> (with Wesley Calvert and Valentina Harizanov) Densely computable structures, Journal of Logic and Computation 32 (2022), 581-607. \n 121.<\/strong> (with Jean Larson, Chris Porter and Jindrich Zapletal) Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic, Volume\u00a02: Foundations of Mathematics, World Scientific Press (2022), ISBN:\u00a0978-981-124-384-4. \n 120.<\/strong> (edited with Chris Porter and Jindrich Zapletal) Structure and Randomness in Computability and Set Theory, World Scientific Press (2020), 366 pages. \n 119.<\/strong> (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. \n 118.<\/strong> (Jean Larson, Chris Porter and Jindrich Zapletal) Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic, Volume\u00a01: Set Theory, World Scientific Press (2020). \n 117.<\/strong> (with Jacob Carson and Jeffrey Remmel) Effective categoricity of automatic equivalence and nested equivalence structures, Theory of Computing Systems 64 (2020), 1110-1139. \n 116.<\/strong> (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 \n 115.<\/strong> (with Francis Adams and Selwyn Ng) Computability and Categoricity of Weakly Homogeneous Boolean Algebras and Abelian p\u2011Groups, in Aspects of Computation and Automata with Applications (2024), World Scientific Press IMS LNS 42, 141-158. \n 114.<\/strong> (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. \n 113.<\/strong> (number omitted in original; placeholder)<\/em> \n 111.<\/strong> (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). \n 112.<\/strong> (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 \n 111.<\/strong> (with G. Barmpalias and C. Porter) Random numbers as probabilities of machine behaviour, Theoretical Computer Science 673 (2017), 1\u201318. https:\/\/arxiv.org\/abs\/1605.05838 \n 110.<\/strong> (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. \n 109.<\/strong> (with Francis Adams) Computability and Categoricity of Weakly Ultrahomogeneous Structures, Computability 6 (2017), 365-389. https:\/\/arxiv.org\/abs\/1608.01254 \n 108.<\/strong> 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.\u00a09537 (2015), 60-75. \n 107.<\/strong> (with Chris Porter) Algorithmically random functions and effective capacities. Theory and Methods of Computation (TAMC 2015), Springer Lecture Notes in Mathematics\u00a09076 (2015), 22-37. \n 106.<\/strong> (with S. Buss and J. Remmel) Sub\u2011comparable Bounded Randomness, Logical Methods in Computer Science 10 (2014). \n 105.<\/strong> (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. \n 104.<\/strong> (with M. Minnes and J. Remmel), Injection structures specified by finite state transducers, CiE\u00a02014, Electronic Proceedings. \n 103.<\/strong> (with V. Harizanov and J. Remmel) Two\u2011to\u2011One Structures, Journal of Logic and Computation 23 (2013), 1195-1223. \n 102.<\/strong> (with V. Harizanov and J. Remmel) Computability\u2011theoretic properties of injection structures, Algebra and Logic\u00a053 (2014), 39-69. \n 101.<\/strong> Various papers on $\\\\Pi^0_1$ classes (Review), Bulletin for Symbolic Logic 18 (2012), 409-412. \n 100.<\/strong> (with J. Remmel) Subcomputable bounded pseudorandomness, in LFCS\u00a02013 (Logical Foundations of Computer Science), San Diego, January\u00a02013, Springer Lecture Notes in Computer Science 7734 (2013), 104-118. \n 99.<\/strong> (with R. Weber) Effective randomness of unions and intersections, Theory of Computing Systems 52 (2013), 48-64. \n 98.<\/strong> (with J.B. Remmel) A connection between the Cantor\u2011Bendixson derivative and the well\u2011founded semantics of finite logic programs, Ann.Math. and Artificial Intelligence 65 (2012), pp.\u00a01-24. \n 97.<\/strong> (with A. Dashti, F. Toska and S. Wyman) Computability of countable subshifts in one dimension, Theory of Computing Systems 51 (2012), pp.\u00a0352-371. \n 96.<\/strong> (with P. Brodhead, F. Toska and S. Wyman) Algorithmic randomness and capacity of closed sets, Logical Methods in Computer Science 6 (2011), 1-16. \n 95.<\/strong> (with V. Harizanov and J. Remmel) Effective categoricity of injection structures, CiE\u00a02011, Springer Lecture Notes in Computer Science (2011), 51-60. \n 94.<\/strong> (with V. Harizanov and J. Remmel) $\\\\Sigma^0_1$ and $\\\\Pi^0_1$ structures, Annals of Pure and Applied Logic 162 (2011), 490-503. \n 93.<\/strong> (with J. Franklin, Jiang Lu, and Guohua Wu) A superhigh diamond in the c.e.\u00a0tt\u2011degrees, Arch. Math. Logic 50 (2011), 33-44. \n 92.<\/strong> (with J.B. Remmel) A connection between the Cantor\u2011Bendixson derivative and the well\u2011founded semantics of finite logic programs, Nonmon@30 (30 Years of Nonmonotonic Reasoning), Lexington, Kentucky, October\u00a02010, URL: http:\/\/www.cs.uky.edu\/~marek\/nonmonat30.dir\/cenzerRemmel.pdf \n 91.<\/strong> (with A. Dashti, F. Toska and S. Wyman) Computability of countable subshifts, in Programs, Proofs and Processes, CIE\u00a02010, eds. F. Ferreira et al., Springer Lecture Notes in Computer Science 6158 (2010) 88-97. \n 90.<\/strong> (with Paul Brodhead) Effective capacity and randomness of closed sets, in Computability and Complexity in Analysis, CCA\u00a02010, eds. X. Zheng and N. Zhong, Springer Electronic Proceedings in Theoretical Computer Science 24 (2010), 67-76. \n 89.<\/strong> (with G. LaForte and J. Remmel) Equivalence structures and isomorphisms in the difference hierarchy, J. Symbolic Logic 74 (2009), 535-556. \n 88.<\/strong> (with G. Laforte and G. Wu) Pseudojumps and $\\\\Pi^0_1$ classes, J. Logic and Computation 19 (2009), 77-87. \n 87.<\/strong> (with G. Barmpalias, J. Remmel and R. Weber) $K$\u2011triviality of closed sets and continuous functions, J. Logic and Computation 19 (2009), 3-16. \n 86.<\/strong> (with T. Kihara, R. Weber and G. Wu) Immunity and non\u2011cupping for closed sets, Tbilisi Math. Journal 2 (2009), 79-96. \n 85.<\/strong> (with R. Downey, J. Remmel and Z. Uddin) Space Complexity of Abelian Groups, Archive for Math. Logic 48 (2009), 63-76. \n 84.<\/strong> (Editor, with Valentina Harizanov, David Marker and Carol Wood) Proceedings of the Model Theory and Computable Model Theory Workshop, Gainesville, February\u00a02007, Archive for Math. Logic 48 (2009), 1-6. \n 83.<\/strong> (with W. Calvert, V. Harizanov and A. Morozov) Effective categoricity of Abelian\u00a0$p$\u2011groups, Ann. Pure and Applied Logic\u00a059 (2009), 187-197. \n 82.<\/strong> (with B. Csima and B. Khoussainov) Linear orders with distinguished function symbols, Archive for Math. Logic\u00a048 (2009), 115-140. \n 81.<\/strong> (with V. Harizanov and J.B. Remmel) $\\\\Sigma^0_1$ and $\\\\Pi^0_1$ equivalence structures, in CIE\u00a02009, K. Ambos\u2011Spies, B. Lowe and W. Merkle (eds.) Springer Lecture Notes in Computer Science\u00a05635 (2009), 99-108. \n 80.<\/strong> (with R. Weber and G. Wu) Immunity for closed sets, Springer Lecture Notes in Computer Science, in CIE\u00a02009, K. Ambos\u2011Spies, B. Lowe and W. Merkle (eds.) Springer Lecture Notes in Computer Science\u00a05635 (2009), 109-117. \n 79.<\/strong> (with J. Franklin, Jiang Lu and Guohua Wu) Embedding the diamond lattice in the c.e.\u00a0tt\u2011degrees with superhigh atoms, TAMC\u00a02009 (Theory and Applications of Models of Computation), J. Chen and S.B. Cooper (Eds.), Springer Lecture Notes in Computer Science\u00a05532 (2009), 420-429. \n 78.<\/strong> (with S. Ali Dashti and Jonathan L.F. King) Computable Symbolic Dynamics, Math. Logic Quarterly\u00a054 (2008), 524-533. \n 77.<\/strong> (with P. Brodhead) Effectively closed sets and enumerations, Archive for Mathematical Logic\u00a045 (2008), 565-582. \n 76.<\/strong> (with Peter Hinman) Degrees of difficulty of generalized r.e. separating classes, Archive for Mathematical Logic\u00a045 (2008), 629-647. \n 75.<\/strong> (with J.B. Remmel) A connection between Cantor\u2011Bendixson derivatives and the well\u2011founded semantics of logic programs, ISAIM\u00a02008, The Tenth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January\u00a02008. \n 74.<\/strong> (with Rebecca Weber) Preface to Special Issue of Archive for Math. Logic (Proceedings of CCA\u00a02006) 45 (2008), 529-531. \n 73.<\/strong> (with G. Barmpalias, P. Brodhead, J. Remmel and R. Weber) Algorithmic randomness of continuous functions, Archive for Mathematical Logic\u00a045 (2008), 533-546. \n 72.<\/strong> (with S. Ali Dashti and Jonathan L.F. King) Effective Symbolic Dynamics, CCA\u00a02007 (Computability and Complexity in Analysis), Siena, June\u00a02007, Eds. R. Dillhage, T. Grubb, A. Sorbi, K. Weihrauch and N. Zhong, Springer Electronic Notes in Computer Science\u00a0202 (2008), 89-99. \n 71.<\/strong> (with G. Barmpalias, P. Brodhead, A. Dashti and R. Weber) Algorithmically random functions and effective capacities, Journal for Logic and Computation\u00a017 (2007), 1041-1062. \n 70.<\/strong> (with George Barmpalias, Jeffrey Remmel and Rebecca Weber) $K$\u2011trivial closed sets and continuous functions, in Computation and Logic in the Real World \u2013 Proceedings CIE\u00a02007, Editors S.B. Cooper, B. Loewe and A. Sorbi, Springer Lecture Notes in Computer Science\u00a04497 (2007), 135-145. \n 69.<\/strong> (with G. Laforte, and G. Wu) Pseudojumps and $\\\\Pi^0_1$ classes, in Computation and Logic in the Real World \u2013 Proceedings CIE\u00a02007, Editors S.B. Cooper, B. Loewe and A. Sorbi, Springer Lecture Notes in Computer Science\u00a04497 (2007), 146-151. \n 68.<\/strong> (Editor, with R. Dillhage, T. Grubb and K. Weihrauch) Third International Conference on Computability and Complexity in Analysis, Information Berichte, FernUniversit\u00e4t, 366 pages, and Springer Electronic Notes in Computer Science\u00a0167 (2007). \n 67.<\/strong> (with Peter Hinman) Medvedev degrees of generalized r.e. separating classes, Proc. CCA\u00a02006, D. Cenzer, R. Dillhage, T. Grubb and Klaus Weihrauch (eds.): Third International Conference on Computability and Complexity in Analysis, Information Berichte, FernUniversit\u00e4t (2006), 125-142, and Springer Electronic Notes in Computer Science\u00a0167 (2007). \n 66.<\/strong> (with Paul Brodhead and Jeffrey Remmel) Random continuous functions, Proc. CCA\u00a02006, D. Cenzer, R. Dillhage, T. Grubb and Klaus Weihrauch (eds.): Third International Conference on Computability and Complexity in Analysis, Information Berichte, FernUniversit\u00e4t (2006), 76-89, and Springer Electronic Notes in Computer Science\u00a0167 (2007). \n 65.<\/strong> (with J. Remmel) On the complexity of inductive definitions, Mathematical Structures in Computer Science\u00a016 (2006), 763-788. \n 64.<\/strong> (with Zia Uddin) Space complexity of structures, in Logical Approaches to Computational Barriers, Proc. CIE\u00a02006, A. Beckmann, U. Berger, B. Loewe and J.Tucker (eds.) Springer Lecture Notes in Computer Science\u00a03988 (2006), 76-85. \n 63.<\/strong> (with P. Brodhead and S. Dashti) Random closed sets, in Logical Approaches to Computational Barriers, Proc. CIE\u00a02006, A. Beckmann, U. Berger, B. Loewe and J.Tucker (eds.) Springer Lecture Notes in Computer Science\u00a03988 (2006), 55-64. \n 62.<\/strong> (with W. Calvert, V. Harizanov and A. Morozov) Effective categoricity of Equivalence Structures, Annals of Pure and Applied Logic\u00a0141 (2006), 61-78. \n 61.<\/strong> Decidability, completeness and complexity, Journal of Symbolic Logic\u00a071 (2006), 399-424. \n 60.<\/strong> (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.\u00a03526 (2005), 75-85. \n 59.<\/strong> (with F. Riazati) Minimal extensions of $\\\\Pi^0_1$ classes, Mathematical Logic Quarterly\u00a051 (2005), 206-216. \n 58.<\/strong> (with W. Marek and J. Remmel) Logic programming with infinite sets, Annals of Artificial Intelligence and Mathematics\u00a044 (2005), 309-339. \n 57.<\/strong> (with J. Remmel) Proof\u2011Theoretic Strength of the Stable Marriage Theorem and Other Problems, in \u201cReverse Mathematics 2001\u201d, edited by S. Simpson, ASL Lecture Notes in Logic vol.\u00a021, A.K. Peters (2005), 67-103. \n 56.<\/strong> (with J. Remmel) Index sets for computable differential equations, pages, Math. Logic Quarterly\u00a050 (2004), 329-344. \n 55.<\/strong> (with J. Remmel and A. Vanderbilt) Complexity of Locally Determined Logic Programs and Recursive Stable Models, Annals of Mathematics and Artificial Intelligence\u00a040 (2004), 225-262. \n 54.<\/strong> (with A. Nies) Global properties of the lattice of $\\\\Pi^0_1$ classes, Proceedings Amer. Math. Society\u00a0132 (2004), 239-249. \n 53.<\/strong> (with W. Marek and J. Remmel) Using logic programs to reason about infinite sets, 8th International Symposium on Artificial Intelligence and Mathematics (2004), <a href=\"http:\/\/rutcor.rutgers.edu\/~amai\/aimath04\">http:\/\/rutcor.rutgers.edu\/~amai\/aimath04<\/a>. \n 52.<\/strong> (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\u2013182. \n 51.<\/strong> (with P. Hinman) Density of the Medvedev Lattice of $\\\\Pi^0_1$ classes, Archive for Mathematical Logic\u00a042 (2003), 583-600. \n 50.<\/strong> (with J. Remmel) Index sets in $\\\\omega$\u2011languages, Mathematical Logic Quarterly\u00a049 (2003), 22\u201333. \n 49.<\/strong> (with J. Remmel) Effectively closed sets and graphs of computable real functions, Theoretical Computer Science\u00a0284 (2002), pp.\u00a0279\u2013318. \n 48.<\/strong> (with A. Vanderbilt) Common Derivations in Locally Determined Logic Programs, conference paper, 7th International Symposium on AI and Mathematics, December\u00a02001, URL:\u00a0http:\/\/rutcor.rutgers.edu\/~amai\/aimath02 \n 47.<\/strong> (with A. Nies) Initial segments of the lattice of Pi\u20110\u20111 Classes, Journal of Symbolic Logic\u00a066 (2001), 1749\u20131765. \n 46.<\/strong> (with C. Jockusch) $\\\\Pi^0_1$ Classes \u2013 Structure and Applications, in Computability Theory and Its Applications, eds. P. Cholak, S. Lempp, M. Lerman and R. Shore, Contemporary Mathematics\u00a0257 (2000), 39\u201359. \n45.<\/strong> (with J. Remmel and A. Vanderbilt) The complexity of the set of \nthe extensions of nonmonotonic rule systems, Artificial Intelligence \nand Mathematics conference paper, Fort Lauderdale, January 2000, \n<a href=\"http:\/\/rutcor.rutgers.edu\/~amai\/aimath00\">http:\/\/rutcor.rutgers.edu\/~amai\/aimath00<\/a>. \n44.<\/strong> (with J. Remmel and A. Vanderbilt) Locally Determined Logic Programs, in Logic Programming and Nonmonotonic Reasoning, El\u202fPaso, December\u202f1999, Springer Lecture Notes in Artificial Intelligence 1730 (1999), 34\u201348. \n 43.<\/strong> (with J. Remmel) Polynomial time versus computable Boolean algebras, in \u201cRecursion Theory and Complexity\u201d (Proc.\u202f1997\u202fKazan Workshop), eds. M.\u202fArslanov &\u202fS.\u202fLempp, de\u202fGruyter (1999), pp.\u202f15\u201353. \n 42.<\/strong>\u202f$\\\\Pi^0_1$ Classes in Computability Theory, in Handbook of Computability<\/em> (ed.\u202fE.\u202fGriffor), North\u2011Holland Studies in Logic 140 (1999), pp.\u202f37\u201385. \n 41.<\/strong> (with V.\u202fMarek &\u202fJ.\u202fRemmel) Index Sets for Finite Predicate Logic Programs, FLOC \u201999 Workshop on \u201cComplexity\u2011theoretic and Recursion\u2011theoretic methods in Databases, Artificial Intelligence and Finite Model Theory\u201d, (1999), pp.\u202f72\u201380. \n 40.<\/strong> (with J.\u202fRemmel) Index Sets in Computable Analysis, Theoretical Computer Science 219 (Special Issue for 1997 Dagstuhl meeting on Computability and Complexity in Analysis) (1999), pp.\u202f111\u2013150. \n 39.<\/strong> (with J.\u202fRemmel) Feasible graphs with standard universe, Proceedings Recursion Theory Week, Oberwolfach\u202f1996, Annals of Pure and Applied Logic 94 (1998), pp.\u202f21\u201335. \n 38.<\/strong> (with J.\u202fRemmel) Index Sets for $\\\\Pi^0_1$ classes, Proceedings of AMS Special Session, Orlando\u202f1996, Annals of Pure and Applied Logic 93 (1998), pp.\u202f3\u201361. \n 37.<\/strong> (with J.\u202fRemmel) $\\\\Pi^0_1$ Classes in Mathematics, \u201cHandbook of Recursive Mathematics\u201d, Vol.\u202f2 (eds.\u202fY.\u202fErsov,\u202fS.\u202fGoncharov,\u202fW.\u202fMarek,\u202fA.\u202fNerode,\u202fJ.\u202fRemmel), North\u2011Holland Studies in Logic 139 (1998), pp.\u202f623\u2013821. \n 36.<\/strong> (with J.\u202fRemmel) Complexity theoretic model theory and algebra, \u201cHandbook of Recursive Mathematics\u201d, Vol.\u202f1 (eds.\u202fY.\u202fErsov,\u202fS.\u202fGoncharov,\u202fW.\u202fMarek,\u202fA.\u202fNerode,\u202fJ.\u202fRemmel), North\u2011Holland Studies in Logic 138 (1998), pp.\u202f381\u2013513. \n 35.<\/strong> (Editor, with J.\u202fRemmel) Proceedings of AMS Special Session (Orlando\u202f1996), Annals of Pure and Applied Logic 93 (1998), pp.\u202f1\u20132. \n 34.<\/strong> (with W.\u202fMoser) A Good Oracle is Hard to Beat, Algorithmica 22 (1998), pp.\u202f18\u201334. \n 33.<\/strong> (with J.\u202fRemmel) Complexity and Categoricity, Information and Computation 140 (1998), 2\u201325. \n 32.<\/strong> (with J.\u202fRemmel) Feasibly categorical Abelian groups, in Proc. Feasible Math II<\/em> (eds.\u202fP.\u202fClote &\u202fJ.\u202fRemmel), Birkh\u00e4user (1995), 91\u2013153. \n 31.<\/strong> (with J.\u202fRemmel) Feasibly Categorical Models, in Logic and Computer Science<\/em> (Proc.\u202fLCC \u201994), Springer\u2011Verlag Lecture Notes in Computer Science 960 (1995), 300\u2013312. \n 30.<\/strong> (with W.\u202fMoser) Inductive inference of functions on the rationals, in COLT \u201995 (Proc.\u202f8th Annual Conf. Computational Learning Theory), ACM (1995), 178\u2013181. \n 29.<\/strong> (with J.\u202fRemmel) Feasible graphs and colorings, Math. Logic Quarterly 41 (1995), 327\u2013352. \n 28.<\/strong> (with R.\u202fDowney,\u202fC.\u202fJockusch,\u202fR.\u202fShore) Countable thin $\\\\Pi^0_1$ classes, Ann. Pure and Applied Logic 59 (1993), 79\u2013139. \n 27.<\/strong> Effective Dynamics, in Logical Methods<\/em> (in honor of A.\u202fNerode), eds.\u202fJ.\u202fCrossley,\u202fJ.\u202fRemmel,\u202fR.\u202fShore,\u202fM.\u202fSweedler, Birkh\u00e4user (1993), 162\u2013177. \n 26.<\/strong> (with J.\u202fRemmel) Polynomial\u2011time Abelian groups, Ann. Pure and Applied Logic 56 (1992), 313\u2013363. \n 25.<\/strong> (with J.\u202fRemmel) Recursively presented games and strategies, Math. Social Sciences 24 (1992), 117\u2013139. \n 24.<\/strong> (with J.\u202fRemmel) Polynomial\u2011time versus recursive models, Annals of Pure and Applied Logic 54 (1991), 17\u201358. \n 23.<\/strong> (with R.L.\u202fSmith) On the ranked points of a $\\\\Pi^0_1$ set, J. Symbolic Logic 54 (1989), 975\u2013991. \n 22.<\/strong> (with P.\u202fClote,\u202fR.\u202fSmith,\u202fR.\u202fSoare,\u202fS.\u202fWainer) Members of countable $\\\\Pi^0_1$ classes, Ann. Pure and Applied Logic 31 (1986), 45\u201363. \n 21.<\/strong> The stability problem, new results and counterexamples, Letters in Math. Physics 10 (1985), 367\u2013372. \n 20.<\/strong> (with R.D.\u202fMauldin) Borel equivalence and isomorphism of coanalytic sets, Dissertationes Math. 228 (1984), 1\u201332. \n 19.<\/strong> (with R.D.\u202fMauldin) Monotone reducibility and the family of finite sets, J. Symbolic Logic 49 (1984), 774\u2013782. \n 18.<\/strong> (with R.D.\u202fMauldin) On the Borel class of the derived\u2011set operator, II, Bull. Soc. Math. de France 111 (1983), 367\u2013372. \n 17.<\/strong> (with R.D.\u202fMauldin) Representations of well\u2011founded preference orders, Canadian J. Math. 35 (1983), 496\u2013508. \n 16.<\/strong> (with R.D.\u202fMauldin) On the Borel class of the derived\u2011set operator, Bull. Soc. Math. France 110 (1982), 357\u2013380. \n 15.<\/strong> (with R.D.\u202fMauldin) Faithful extensions of analytic sets to Borel sets, Houston J. Math. 6 (1980), 19\u201329. \n 14.<\/strong> Non\u2011generable formal languages, Fund. Informaticae 3 (1980), 95\u2013104. \n 13.<\/strong> (with R.D.\u202fMauldin) Inductive definability, measure and category, Advances in Math. 38 (1980), 55\u201390. \n 12.<\/strong> The stability problem for transformations of the circle, Proc. Royal Soc. Edinburgh 84A (1979), 279\u2013281. \n 11.<\/strong> Parametrized inductive definitions and recursive inductive operators over the continuum, Fundamenta Mathematica 100 (1978), 10\u201315. \n 10.<\/strong> (with R.D.\u202fMauldin) Measurable parametrizations and selections, Trans. Amer. Math. Soc. 245 (1978), 399\u2013408. \n 9.<\/strong> (with E.\u202fHoworka) On vertex k\u2011partitions of certain infinite graphs, Discrete Math. 23 (1978), 105\u2013113. \n 8.<\/strong> Non\u2011generable r.e. sets, in Fundamentals of Computation Theory (Proc.\u202fConf. Posnan\u202f1977), Springer Lecture Notes in Computer Science 56 (1977), 379\u2013385. \n 7.<\/strong> Inductive definitions, positive and monotone, in Set Theory and Hierarchy Theory (Proc. Conf.\u202fBierutowice\u202f1975), Springer\u2011Verdy 537 (1976), 51\u201363. \n 6.<\/strong> Monotone inductive definitions over the continuum, J. Symbolic Logic 41 (1976), 188\u2013198. \n 5.<\/strong> Analytic inductive definitions, J. Symbolic Logic 39 (1974), 310\u2013312. \n 4.<\/strong> Inductively defined sets of reals, Bull. Amer. Math. Soc. 80 (1974), 485\u2013487. \n 3.<\/strong> (with A.R.\u202fBlass) Cores of $\\\\Pi^1_1$ sets of reals, J. Symbolic Logic 39 (1974), 649\u2013654. \n 2.<\/strong> The boundedness principle in ordinal recursion, Fund. Math. 71 (1974), 203\u2013212. \n 1.<\/strong> Ordinal recursion and inductive definitions, in Generalized Recursion Theory (Proc.\u202fConf. Oslo\u202f1972), eds.\u202fJ.\u202fFenstad &\u202fP.\u202fHinman, North\u2011Holland (1974), 221\u2013264.<\/p>\n<\/section>\n<footer class=\"accessibility-note\">\n 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\u2011reader users to jump directly to each section. \n <\/footer>\n<\/body> \n<\/html> <\/p>\n","protected":false},"excerpt":{"rendered":"Curriculum Vitae \u2013 Douglas Cenzer Biography Education Professional Experience Awards Grants Listing and Organizations Service Theses Selected Lectures Publications Contact CURRICULUM VITAE Douglas Cenzer PRESENT POSITION: Emeritus Professor, University of Florida Address Department of Mathematics, University of Florida P.O. Box\u00a0118105 358 Little Hall, Gainesville, FL\u00a032611\u20118105 email: cenzer@ufl.edu URL: https:\/\/people.clas.ufl.edu\/cenzer\/ phone: 352\u2011294\u20112350 Education University of Michigan […]<\/p>\n","protected":false},"author":144,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"featured_post":"","footnotes":"","_links_to":"","_links_to_target":""},"class_list":["post-1108","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/pages\/1108","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/users\/144"}],"replies":[{"embeddable":true,"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/comments?post=1108"}],"version-history":[{"count":8,"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/pages\/1108\/revisions"}],"predecessor-version":[{"id":1123,"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/pages\/1108\/revisions\/1123"}],"wp:attachment":[{"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/media?parent=1108"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}

{"id":1108,"date":"2026-04-07T15:33:25","date_gmt":"2026-04-07T19:33:25","guid":{"rendered":"https:\/\/people.clas.ufl.edu\/cenzer\/?page_id=1108"},"modified":"2026-04-14T11:24:31","modified_gmt":"2026-04-14T15:24:31","slug":"vitae","status":"publish","type":"page","link":"https:\/\/people.clas.ufl.edu\/cenzer\/vitae\/","title":{"rendered":"VITAE"},"content":{"rendered":"

\n
\n
\n
\nCurriculum Vitae \u2013 Douglas Cenzer<\/title> \n<meta name=\"viewport\" content=\"width=device-width, initial-scale=1\"><\/p>\n<style>\n body{font-family:serif;font-size:1.1rem;line-height:1.6;margin:1rem;padding:20px;}\n h1{font-size:2rem;margin-top:1.5rem;}\n h2{font-size:1.6rem;margin-top:1.3rem;}\n h3{font-size:1.3rem;margin-top:1.2rem;}\n section{margin-bottom:1.8rem;}\n ul,ol{margin:0 0 1rem 1.8rem;}\n li{margin-bottom:.4rem;}\n li {\n padding-left: 20px; \/* Adjust this value for more or less space *\/\n}\n .address p{margin:0;}\n .contact a{text-decoration:none;color:inherit;}\n .contact a:hover{text-decoration:underline;}\n .accessibility-note{font-size:.9rem;color:#555;}\n<\/style>\n<\/head><\/p>\n<body><\/p>\n<nav aria-label=\"Primary navigation\">\n<ul>\n<li> <a href=\"#bio\">Biography<\/a><\/li>\n<li> <a href=\"#education\">Education<\/a><\/li>\n<li> <a href=\"#experience\">Professional Experience<\/a><\/li>\n<li> <a href=\"#awards\">Awards<\/a><\/li>\n<li> <a href=\"#grants\">Grants<\/a><\/li>\n<li> <a href=\"#listing\"> Listing and Organizations <\/a><\/li>\n<li> <a href=\"#service\">Service<\/a><\/li>\n<li> <a href=\"#theses-and-disseminations\">Theses<\/a><\/li>\n<li> <a href=\"#lectures\">Selected Lectures<\/a><\/li>\n<li> <a href=\"#publications\">Publications<\/a><\/li>\n<li> <a href=\"#contact\">Contact<\/a><\/li>\n<\/ul>\n<\/nav>\n<header>\n<h1 id=\"bio\">CURRICULUM VITAE<\/strong><\/h1>\n<h2>Douglas Cenzer<\/h2>\nPRESENT POSITION:<\/strong> Emeritus Professor, University of Florida<\/p>\n<section class=\"address\" aria-label=\"address\">\n<section style=\"padding-left: 2em;\">\n<h3>Address<\/h3>\nDepartment of Mathematics, University of Florida<\/p>\nP.O. Box\u00a0118105<\/p>\n358 Little Hall, Gainesville, FL\u00a032611\u20118105<\/p>\nemail:<\/strong> <a href=\"mailto:cenzer@ufl.edu\">cenzer@ufl.edu<\/a><\/p>\nURL:<\/strong> <a href=\"https:\/\/people.clas.ufl.edu\/cenzer\/\">https:\/\/people.clas.ufl.edu\/cenzer\/<\/a><\/p>\nphone:<\/strong> 352\u2011294\u20112350<\/p>\n<\/section>\n<\/header>\n<section id=\"education\">\n<section style=\"padding-left: 2em;\">\n<h2>Education<\/h2>\n<li> University of Michigan \u2013 Ph.D., Mathematics, 1972 (NSF Graduate Fellow)<\/li>\n<li> Michigan State University \u2013 B.S., Mathematics, 1968 (Ford Motor Co. Fund Scholar)<\/li>\n<\/section>\n<section id=\"experience\">\n<section style=\"padding-left: 2em;\">\n<h2>Professional Experience<\/h2>\n<li> Professor of Mathematics, University of Florida, 1987\u20132023<\/li>\n<li> Research Member, Math. Sciences Research Institute, Berkeley, Fall\u00a02020<\/li>\n<li> Chair, Department of Mathematics, University of Florida, 2013\u20132018<\/li>\n<li> Visiting Fellow, Newton Institute, Cambridge, Spring\u00a02012<\/li>\n<li> Visiting Fellow, Mathematical Science Institute, Singapore, Summer\u00a02011<\/li>\n<li> Visiting Scholar, University of California at San Diego, 2002<\/li>\n<li> Member, Math. Sciences Research Institute, Berkeley, 1989\u20131990<\/li>\n<li> Visiting Professor, University of Michigan (Summer\u00a01989,\u00a01998,\u00a02000,\u00a02005)<\/li>\n<li> Associate Professor, University of Florida, 1977\u20131987<\/li>\n<li> Visiting Associate Professor, North Texas State University, 1981\u20131982<\/li>\n<li> Assistant Professor, University of Florida, 1972\u20131977<\/li>\n<li> NSF Graduate Fellow, University of Michigan, 1968\u20131972<\/li>\n<li> Research Assistant, National Security Administration, 1967<\/li>\n<\/section>\n<section id=\"awards\">\n<section style=\"padding-left: 2em;\">\n<h2>Awards<\/h2>\n<li> University Term Professorship, 2021\u20132024<\/li>\n<li> Anderson Scholar, CLAS, 1995, 1999, 2000, 2005, 2007<\/li>\n<li> Exemplary Mentor Award from SEAGEP (Southeastern Alliance for Graduate Education and the Professoriate), 2006.<\/li>\n<li> STEP (Sustained Performance Award), University of Florida, 2001 and 2009<\/li>\n<li> CLAS Bonus Award, University of Florida, 1997<\/li>\n<li> TIP Teaching Award, University of Florida, 1998<\/li>\n<\/section>\n<section id=\"grants\">\n<section style=\"padding-left: 2em;\">\n<h2>Grants<\/h2>\n<li> NSF Conference grant \u2013 SEALS, Co\u2011PI, $90,000, 2024\u20132027<\/li>\n<li> NSF Conference grant \u2013 SEALS, Co\u2011PI, $48,000, 2020\u20132023<\/li>\n<li> NSF Conference grant \u2013 SEALS, Co\u2011PI, $45,000, 2014\u20132018<\/li>\n<li> NSF Computability in Europe 2011 (Conference Grant), PI $20,000<\/li>\n<li> NSF Focused Research Group, PI, $580,000 (UF $65,000), 2007\u20132011<\/li>\n<li> NSF Collaboration in Computability \u2013 Binational Travel Grant with Russia and Kazakhstan, co\u2011PI (Julia Knight, Notre Dame PI), 2000\u20132004 ($30,000); renewed 2006\u20132009 ($75,000); renewed 2011\u20132014 ($75,000)<\/li>\n<li> Effectively Closed Sets, UF Faculty Enhancement Opportunity, PI, $22,824, 2010\u20112011<\/li>\n<li> DSR Award, University of Florida 1978 ($5,000) and 1991 ($8,000)<\/li>\n<li> NSF Special Year in Logic Award, Co\u2011PI, 2005\u20112008 $138,000 (NSF DMS\u00a00532644)<\/li>\n<\/section>\n<section id=\"listing\">\n<section style=\"padding-left: 2em;\">\n<h2>Listing<\/h2>\n<li> American\u202fMen\u202fand\u202fWomen\u202fof\u202fScience<\/li>\n<li> Who’s\u202fWho\u202fin\u202fAmerica<\/li>\n<li> Who’s\u202fWho\u202fin\u202fFrontier\u202fScience<\/li>\n<li> Who’s\u202fWho\u202fin\u202fAmerican\u202fTeachers<\/li>\n<h3>Organisations<\/h3>\n<li> Association for Symbolic Logic \u2013 Chair, Membership Committee, 2001\u20132007<\/li>\n<li> Phi Beta Kappa \u2013 Chapter President, 1994<\/li>\n<li> CCA (Network for Computability and Complexity in Analysis)<\/li>\n<li> CiE (Association for Computability in Europe)<\/li>\n<li> American Mathematical Society; Pi Mu Epsilon<\/li>\n<\/section>\n<section id=\"service\">\n<section style=\"padding-left: 2em;\">\n<h2>Service<\/h2>\n<h3>Editorial Activities<\/h3>\n<li> Archive for Mathematical Logic (Springer-Verlag) Editorial Board, 2002\u2013\u2026<\/li>\n<li> Chinese Journal of Mathematics, Editorial Board, 2013\u20132019<\/li>\n<li> The Scientific World Journal, 2013\u20132019<\/li>\n<li> Edited special issue of Annals of Pure and Applied Logic, vol.\u00a093 (1998)<\/li>\n<li> Referee for numerous journals (e.g., Amer. Math. Monthly, Ann. Pure and Appl. Logic, Trans. Amer. Math. Soc., and many more)<\/li>\n<h3>Program Reviews<\/h3>\n<li> Program Review for Mathematics Department at Southern Illinois\u202fUniversity, Spring 2019<\/li>\n<li> Reviewed proposed Ph.D. program at Charleston College, Spring 2019<\/li>\n<\/ol>\n<h3>Other Professional Activities<\/h3>\n<li> Mathematics Program Review at Southern Illinois (2019)<\/li>\n<li> Reviewed Ph.D. Program Proposal at College of Charleston (2019)<\/li>\n<li> Reviewer for funding agencies: National Science Foundation; National Research Council of Canada; Marsden Fund (New\u202fZealand); Research Foundation \u2013 Flanders (FWO); France\u2011Berkeley Foundation; Nazarbayev University via Oak Ridge<\/li>\n<li> Reviewed dissertation for Ackermann Award of European Association of Computer Science Logic; External reference for hiring, tenure and promotion at U.\u202fMichigan, Penn State, U.\u202fSan\u202fFrancisco, U.\u202fConnecticut; George Washington U., National U.\u202fAustralia, U.\u202fWest\u202fFlorida, U.\u202fCincinnati, Arcadia University, Kenyon College, Auckland U. (New\u202fZealand)<\/li>\n<h3>Conferences Organized<\/h3>\n<li> Program Committee for CCA 2022 (USA), 2010 (China), 2007 (Siena, Italy), 2004 (Cincinnati)<\/li>\n<li> Program Committee for Colloquium Logicum 2020 and 2022<\/li>\n<li> Organized Special Session on Computability at ASL annual meeting, New\u202fYork, May 2019<\/li>\n<li> Co\u2011organized 10 recent SEALS Symposia (SEALS 2015\u20112026) in Gainesville<\/li>\n<li> Program Committee for CiE 2016 (Paris) and 2012 (Cambridge)<\/li>\n<li> Organizing Committee for joint AMS\u2011ASL special session on Probability and Logic, Joint Math Meetings, Baltimore, January 2014<\/li>\n<li> Organized Special Session at AMS Regional Meeting in Washington, D.C., March 2012<\/li>\n<li> Organizing Committee and Chair of Special Session on Classical Computability Theory at CIE 2011 (Sofia)<\/li>\n<li> Organizing Committee, 5th Conference on Logic, Computability and Randomness, Notre\u202fDame, May 24\u201128 2010, with NSF support<\/li>\n<li> Organized Summer School in Algorithmic Randomness, Gainesville, June 2008<\/li>\n<li> Local Organizing Committee, Association for Symbolic Logic, Annual Meeting, March 2007<\/li>\n<li> Co\u2011organized Workshop on Model Theory and Computable Model Theory, Gainesville, February 2006<\/li>\n<li> Organized Computability and Complexity in Analysis (CCA 2006), Gainesville, November 2006<\/li>\n<li> Organized AMS Special Session on Computability and Models, Annual Meeting, Baltimore, January 2003<\/li>\n<li> Organized AMS Special Session on Computability Theory, Annual Meeting, San\u202fDiego, January 2002<\/li>\n<li> Organized AMS Special Session on Computability Theory, Gainesville, Florida, March 1999<\/li>\n<li> Organized AMS Special Session on Recursive and Feasible Mathematics, Orlando, Florida, January 1996<\/li>\n<li> Local Organizing Committee, ASL Annual Meeting, Gainesville, Spring 1994<\/li>\n<h3>University Service<\/h3>\n<li> Council on Academic Freedom, Faculty Quality and Faculty Welfare, 2004\u20132007 and 2014\u2013\u2026<\/li>\n<li> Faculty Senate Nominating Committee, 2005\u20132007<\/li>\n<li> Committee on Academic Freedom, Tenure, Professional Relations and Standards, 2004\u20132007<\/li>\n<li> Goldwater Scholarship Committee, 2006\u201309<\/li>\n<li> University Library Committee, 1976\u201380<\/li>\n<li> CLAS Tenure and Promotion Committee, 1980\u201381, 2007\u20132009<\/li>\n<h3>Department Service<\/h3>\n<li> Department Chair, July\u00a02013 \u2013 August\u00a02018<\/li>\n<li> Tenure and Promotion Committee (Chair 1993\u20132013, 2019)<\/li>\n<li> Library Committee (Chair 1975\u20132021)<\/li>\n<li> Hiring Plan Committee<\/li>\n<li> Steering Committee: 1983\u201385, 1986\u201388, 1998\u20132000, 2009\u20132011<\/li>\n<li> Townsend Award Committee: 2022\u20132025<\/li>\n<\/section>\n<section id=\"theses-and-disseminations\">\n<section style=\"padding-left: 2em;\">\n<h2>Theses and Dissertations<\/h2>\n<li> Cameron Fraize, 2023 (Co\u2011directed with Dana Bartosova), Ph.D. Dissertation \u2013 \u201cAspects of Algorithmically Random Objects\u201d<\/li>\n<li> Richard Krogman, 2022, Ph.D. Dissertation \u2013 \u201cInjection Structures Specified by Finite State Machines\u201d<\/li>\n<li> John Hester, 2021, Ph.D. Dissertation \u2013 \u201cNovel Methods for Automated First\u2011Order Theorem Proving\u201d<\/li>\n<li> Thomas Winckler, 2021, Ph.D. Dissertation \u2013 \u201cSome Results Using Weak Axioms of Choice\u201d<\/li>\n<li> Francis Adams, 2017 (Co\u2011directed with J.\u202fZapletal), Ph.D. Dissertation \u2013 \u201cAnticliques in Borel Graphs on Polish Spaces and Computable Ultrahomogeneous Structures\u201d<\/li>\n<li> Ferit Toska, 2013 Ph.D. Dissertation \u2013 \u201cEffective Symbolic Dynamics and Complexity\u201d<\/li>\n<li> Sebastian Wyman, 2013 Ph.D. Dissertation \u2013 \u201cClosed Sets, Continuous Functions and Symbolic Dynamics in the Arithmetic Hierarchy\u201d<\/li>\n<li> Paul Brodhead, 2008 Ph.D. Dissertation \u2013 \u201cComputable Aspects of Closed Sets\u201d<\/li>\n<li> S.\u202fAli\u202fDashti, 2008 Ph.D. Dissertation \u2013 \u201cEffective Symbolic Dynamics\u201d<\/li>\n<li> Zia Uddin, 2004 Ph.D. Dissertation \u2013 \u201cStructures Subject to Space Complexity\u201d<\/li>\n<li> Farzan Riazati, 2001 Ph.D. Dissertation \u2013 \u201cOn the Lattice of $\\\\Pi^0_1$ Classes\u201d<\/li>\n<li> Amy Vanderbilt, 2000 Ph.D. Dissertation \u2013 \u201cCommon Derivations in Locally Determined Nonmonotonic Rule Systems and their Complexity\u201d<\/li>\n<li> William Moser, 1996 Ph.D. Dissertation \u2013 \u201cApproximation Methods in Inductive Inference\u201d<\/li>\n<li> (Undergraduate) Diego Rojas, McNair Scholar and NSF Graduate Fellow \u2013 \u201cComputability and Differentiability of Functions on the Cantor Space\u201d, 2017<\/li>\n<li> (Undergraduate) Marc Betinsky, 1995 Senior Honors Thesis \u2013 \u201cImplications and Explorations of the Wronskian\u201d, Undergraduate Research Symposium winner 1995<\/li>\n<li> Reviewer for Habilitations at U.\u202fHeidelberg (Germany), U.\u202fVienna (Austria), U.\u202fBundeswehr (Germany)<\/li>\n<li> External Member of Ph.D. Committees at Auckland U. (New\u202fZealand), Nanyang T.U. (Singapore), Notre\u202fDame U., U.\u202fWaterloo (Canada)<\/li>\n<li> Reviewer for Habilitation: U.\u202fVienna (Austria); Universit\u00e4t Bundeswehr, Munich, Germany<\/li>\n<\/section>\n<section id=\"lectures\">\n<h2>Selected Lectures (since\u00a01992)<\/h2>\n<section style=\"padding-left: 2em;\">\n<li> “Homogeneous Linear Orderings”, JMM\u00a02026, Washington\u00a0DC, ASL Special Session, January\u00a02026<\/li>\n<li> “Decidability and Computability of Homogeneous Linear Orderings”, Hausdorff Institute of Mathematics, Bonn, Germany, September\u00a02025<\/li>\n<li> “Generically Computable Structures”, JMM\u00a02024, San\u00a0Francisco<\/li>\n<li> “Generically Computable Abelian Groups”, UCNC\u00a02023, UNF Jacksonville<\/li>\n<li> “Densely Computable Structures and Isomorphisms”, MSRI conference on Number Theory and Decidability, July\u2013August\u00a02022<\/li>\n<li> “Extraction Rates for Random Functions”, Computability Conference, Luminy, France, March\u00a02022<\/li>\n<li> (with Richard Krogman) The Isomorphism Problem for FST Injection Structures, Logical Foundations of Computer Science, January\u00a02022<\/li>\n<li> (with Richard Krogman) Complexity and Categoricity of FST Injection Structures Induced by Finite State Transducers, 17th Conference on Computability in Europe, Ghent, July\u00a02021<\/li>\n<li> “Generically Computable Structures”, Math. Sci. Research Institute Seminar, October\u00a02020<\/li>\n<li> “Extraction Rate for Random Functionals”, CCA\u00a02020 (Computability and Complexity in Analysis), Bologna, Italy, September\u00a02020<\/li>\n<li> “Extraction Rate for Almost Total Functionals”, Special Session on Computability, Canadian Math. Society Winter Meeting, Toronto, CA, December\u00a02109<\/li>\n<li> “Generically Computable Structures”, Special Session on Computability, AMS sectional meeting, Hartford, CT, April\u00a02019.<\/li>\n<li> “Extraction Rates for Turing Functionals”, Special Session on Computability, AMS sectional meeting, Honolulu, Hawaii, March\u00a02019.<\/li>\n<li> “Computability and Complexity in Structure Theory”, Special Session on Computability in honor of Jeffrey B. Remmel, Joint Math Meetings, Baltimore, January\u00a02019.<\/li>\n<li> “Weakly Homogeneous Structures”, ASL Hour Talk at Joint Math Meetings, Baltimore, January\u00a02019.<\/li>\n<li> “Complexity of Automatic Structures and Isomorphisms”, Colloquium talk, College of Charleston, October\u00a02018.<\/li>\n<li> “Automatic Structures and Isomorphisms”, Keynote Address, Colloquium Logicum, Bayreuth, Germany, September\u00a02018.<\/li>\n<li> “Generically Computable Structures”, Workshop on Computability Theory and Its Applications, Waterloo, Canada, June\u00a02018, sponsored by Fields Institute.<\/li>\n<li> “Random and Online Continuous Functions”, Keynote Speaker at LMU (Munich) workshop on constructive mathematics, April\u00a02018.<\/li>\n<li> “Weakly Ultrahomogeneous Structures”, Aspects of Computation, National University of Singapore, September\u00a02017.<\/li>\n<li> “Injection structures specified by finite state transducers”, Computability and Complexity 2017, Raumati, New\u00a0Zealand, January\u00a02017<\/li>\n<li> “Random members of $\\\\Pi^0_1$ classes”, AMS Sectional Meeting, Minneapollis, October\u00a02016<\/li>\n<li> “Random numbers as probabilities of machine behaviour”, Computability, Randomness and Applications, CIRM, Luminy, France, June\u00a02016<\/li>\n<li> “Index sets for Logic Programming”, Logical Foundations of Computer Science (LFCS 2016), Los Gatos, CA, February\u00a02016<\/li>\n<li> “Algorithmically random functions and effective capacities”, Universit\u00e9 de Sherbrooke, January\u00a02016<\/li>\n<li> “Compressibility of closed sets”, CCR\u00a02015, Heidelberg, June\u00a02015<\/li>\n<li> “Randomness and capacity”, TAMC 2015, Singapore, May\u00a02015<\/li>\n<li> “Weakly ultrahomogeneous structrues”, Special Session on Computable Structure Theory, AMS Sectional Meeting, Washington, D.C., March\u00a02015<\/li>\n<li> “Algorithmically random functions and effective capacities”, Winter Meeting of Canadian Math. Society, Hamilton, Ontario, December\u00a02014.<\/li>\n<li> “Ultrahomogeneous structures”, Colloquium Talk, College of Charleston, November\u00a02014.<\/li>\n<li> “Automatic Injection Structures”, Computability in Europe (CiE 2014), Budapest, June\u00a02014<\/li>\n<li> “Computability and Categoricity of Ultrahomogeneous Structures”, Computability in Europe (CiE 2014), Budapest, June\u00a02014<\/li>\n<li> “Effective Symbolic Dynamics and Complexity”, AMS Special Session, Ames, Iowa, April\u00a02013.<\/li>\n<li> “Finite-to-one Structures”, AMS\u2013ASL Special Session, San Diego, January\u00a02013.<\/li>\n<li> “Sub-computable Bounded Randomness”, LFCS\u00a02013 (Logical Foundations of Computer Science, San Diego, January\u00a02013.<\/li>\n<li> “Conservatively Approximable Functions”, CCA\u00a02012, Cambridge, England, June\u00a02013<\/li>\n<li> “Bounded Randomness”, Computability in Europe\u00a02012, Cambridge, UK, June\u00a02012<\/li>\n<li> “Effective Injection Structures”, Workshop on Incomputability, Newton Institute, Cambridge, England, June\u00a02012<\/li>\n<li> “$\\\\Pi^0_1$ structures”, Logic Seminar, George Washington University, March\u00a02012<\/li>\n<li> “Random Sets”, Recursion Theory Workshop, Computational Prospects for Infinity, National University of Singapore, August\u00a02011<\/li>\n<li> “Effective Categoricity of Injection Structures”, CiE\u00a02011, Bulgaria, June\u00a02011<\/li>\n<li> “Structures and Isomorphisms in the Difference Hierarchy”, Workshop on Computability (Annual ASL meeting), March\u00a02011<\/li>\n<li> “Effective Randomness and Capacity”, Algorithmic Randomness Conference, Notre Dame, May\u00a02010.<\/li>\n<li> “Effective Symbolic Dynamics”, Colloquium Talk, College of Charleston, October\u00a02009.<\/li>\n<li> “Algorithmic Randomness”, Pi Mu Epsilon Talk, University of Florida, September\u00a02009.<\/li>\n<li> “$\\\\Sigma^0_1$ and $\\\\Pi^0_1$ Equivalence Structures”, Computability in Europe (CIE 2009), Heidelberg, July\u00a02009<\/li>\n<li> “Immunity of Closed Sets”, Computability in Europe (CIE 2009), Heidelberg, July\u00a02009<\/li>\n<li> “Effective randomness and Capacity of Closed Sets”, Computability in Europe (CIE 2009), Heidelberg, July\u00a02009<\/li>\n<li> “Random Union, Intersection and Membership”, Fourth International Conference on Algorithmic Randomness, Luminy, France, June\u00a02009<\/li>\n<li> “$\\\\mu$-randomness of Closed Sets and Elements”, Algorithmic Randomness Workshop, Madison, Wisconsin, May\u00a02009.<\/li>\n<li> “Structures in the Difference Hierarchy”, Logic Seminar, Notre Dame University, April\u00a02009.<\/li>\n<li> “Randomness and Capacity”, Informal Random Gathering, UC Berkeley, March\u00a02009.<\/li>\n<li> “Countable Subshifts”, AMS Special Session on Computable Dynamics, January\u00a02009.<\/li>\n<li> “Complexity Theory in Algebra and Combinatorics”, Computability, Reverse Mathematics and Combinatorics, Banff Research Station, December\u00a02008<\/li>\n<li> “Algorithmic Randomness”, Colloquium Talk, College of Charleston, April\u00a02008<\/li>\n<li> “The Cantor\u2011Bendixson Derivative and the Well\u2011founded Semantics of Logic Programming”, Tenth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January\u00a02008.<\/li>\n<li> “Algorithmic Methods for Equivalence Relations”, AMS Special Session on Algorithmic Methods for Algebraic Structures, Murfreesboro, Tennessee, November\u00a02007<\/li>\n<li> “Random Closed Sets and Continuous Functions”, Workshop on Effective Randomness, Chicago, September\u00a02007<\/li>\n<li> “Effective Symbolic Dynamics”, CCA 2007 (Computability and Complexity in Analysis), Siena, July\u00a02007<\/li>\n<li> “$K$\u2011Trivial Closed Sets and Continuous Functions”, CIE 2007 (Computability in Europe), Siena, July\u00a02007<\/li>\n<li> “Pseudojump Operators and $\\\\Pi^0_1$ Classes”, CIE 2007 (Computability in Europe), Siena, July\u00a02007<\/li>\n<li> “Random Closed Sets and Continuous Functions”, Special Session on Computability, AMS Regional Meeting, Storrs, November\u00a02006.<\/li>\n<li> “Random Closed Sets and Continuous Functions”, American Institute of Mathematics workshop on algorithmic randomness, August\u00a02006<\/li>\n<li> “Random Closed Sets”, Computability in Europe, Swansea, July\u00a02006<\/li>\n<li> “Space Complexity of Structures”, Computability in Europe, Swansea, July\u00a02006<\/li>\n<li> “Effectively Closed Sets”, ASL Winter Meeting, January\u00a02006, invited hour talk<\/li>\n<li> “Complexity of Inductive Definability”, Computability in Europe, Amsterdam, June\u00a02005.<\/li>\n<li> “Reverse Mathematics and the Stable Marriage Problem”, Special Session on Reverse Mathematics, AMS Annual Meeting, Atlanta, January\u00a02005.<\/li>\n<li> “Logic Progamming and Computabililty”, Special Session on Computability Theory and Applications, AMS Regional Meeting, Chicago, October\u00a02004.<\/li>\n<li> “Logic programming with infinite sets”, 8th International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January\u00a02004<\/li>\n<li> “Index Sets for Computable Differential Equations”, International Conference on Computability and Complexity in Analysis, Cincinnati, August\u00a02003<\/li>\n<li> “Well\u2011ordered intervals in the lattice of $\\\\Pi^0_1$ classes”, Workshop on Computability and Logic, Heidelberg, June\u00a02003<\/li>\n<li> “Effectively Closed Sets”, Colloquium Talk, East Carolina University, March\u00a02003<\/li>\n<li> “Categoricity of Equivalence Structures”, Special Session on Computability and Models, Annual AMS Meeting, Baltimore, January\u00a02003<\/li>\n<li> “$\\\\Delta^0_2$-categoricity of $p$\u2011groups”, Special Session on Effectiveness Questions in Model Theory, AMS Sectional Meeting, Madison, Wisconsin, October\u00a02002.<\/li>\n<li> “On the Lattice of $\\\\Pi^0_1$ Classes”, Logic Seminar \u2013 University of Michigan, May\u00a02002.<\/li>\n<li> “Minimal and Thin Extensions of $\\\\Pi^0_1$ Classes”, Special Session on Computability Theory with Applications, Annual AMS Meeting, San Diego, January\u00a02002.<\/li>\n<li> “Index Sets for $\\\\omega$\u2011languages”, Workshop on Computability and Complexity in Analysis, Schloss Dagstuhl, Germany, November\u00a02001.<\/li>\n<li> “Degrees of Difficulty of $\\\\Pi^0_1$ Classes”, ASL Special Session on Reverse Mathematics, Annual Meeting of the Association for Symbolic Logic, Philadelphia, March\u00a02001<\/li>\n<li> “The lattice of $\\\\Pi^0_1$ classes”, Computability Theory Meeting, Oberwolfach, January\u00a02001<\/li>\n<li> “Locally Determined Nonmonotonic Rule Systems”, Colloquium, UC San Diego, May\u00a011, 2000.<\/li>\n<li> “The Lattice of $\\\\Pi^0_1$ Classes”, ASL Special Session on Computable Model Theory, Winter Meeting of Association for Symbolic Logic, Washington, January\u00a023, 2000.<\/li>\n<li> Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January\u00a02000.<\/li>\n<li> “Logic Programming and Nonmonotonic Reasoning”, El Paso, December\u00a01999.<\/li>\n<li> Workshop on Computability and Complexity in Analysis, Schloss Dagstuhl, Germany, November\u00a01999.<\/li>\n<li> Special Session on Artificial Intelligence, Federated Logic Meeting, Trento, Italy, July\u00a01999.<\/li>\n<li> AMS\u2011IMS\u2011SIAM Joint Summer Research Conference on Computability Theory and Applications, Boulder, Colorado, June\u00a01999.<\/li>\n<li> Special Session on Computability \u2013 Annual ASL Meeting, San Diego, March\u00a01999.<\/li>\n<li> Logic Seminar \u2013 University of Michigan, July\u00a01998.<\/li>\n<li> Logic Seminar (2 talks) \u2013 University of Chicago, May\u00a01998.<\/li>\n<li> Special Session in Computability Theory with applications \u2013 Annual AMS Meeting, Baltimore, January\u00a01998.<\/li>\n<li> Special Session in Computability \u2013 Regional AMS Meeting, Milwaukee, October\u00a01997.<\/li>\n<li> Recursion Theory meeting \u2013 Kazan, July\u00a01997.<\/li>\n<li> Computability and Complexity in Analysis, Schloss Dagstuhl, Saarbrucken, April\u00a01997.<\/li>\n<li> Colloquium \u2013 George Washington U., March\u00a028, 1997.<\/li>\n<li> Logic Seminar \u2013 University of Maryland, College Park, March\u00a027, 1997.<\/li>\n<li> Recursion Theory Meeting, Oberwolfach, January\u00a01996.<\/li>\n<li> Special Session on Recursive and Feasible Mathematics, Annual AMS Meeting, Orlando, January\u00a01996.<\/li>\n<li> Association for Symbolic Logic Annual Meeting, Irvine, April\u00a01995.<\/li>\n<li> Logic and Computational Complexity Workshop, Indiana U., October\u00a01994.<\/li>\n<li> Recursion Theory Workshop, Uppsala, Sweden, June\u00a01994.<\/li>\n<li> Special Session on Recursion Theory, AMS\u2011DMV Meeting, Heidelberg, October\u00a01993.<\/li>\n<li> Special Session on Recursion Theory, AMS Meeting, Washington, D.C., April\u00a01993.<\/li>\n<li> Logical Methods (in honor of A. Nerode), Cornell, June\u00a01992.<\/li>\n<li> Feasible Mathematics II, MSI, Cornell, May\u00a01992.<\/li>\n<\/section>\n<section id=\"publications\">\n<section style=\"padding-left: 2em;\">\n<h2>Publications<\/h2>\n\n 135.<\/strong> (with J. Remmel) Effectively Closed Sets ($\\\\Pi^0_1$ Classes), draft of 350 pages, Perspectives in Mathematical Logic, Cambridge University Press (2023). \n 134.<\/strong> (with Wesley Calvert, David Gonzalez, and Valentina Harizanov) Generically computable linear orderings, Ann. Pure and Appl. Logic 176 (2025) \n 133.<\/strong> (with Wesley Calvert and Valentina Harizanov) Generically computable abelian groups and isomorphisms, J. Logic and Computation 35 (2025) \n 132.<\/strong> (with\u00a0Chris Porter and Jindrich Zapletal) Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic, Volume\u00a01: Set Theory, World Scientific Press, Second Edition (2025). \n 130.<\/strong> (with Cameron Fraize and Christopher Porter) Extraction Rates of Algorithmically Random Continuous Functionals, Natural Computing (2025) 17-28. \n 129.<\/strong> (with Wesley Calvert and Valentina Harizanov) Generically Computable Abelian Groups, UCNC 2023, Springer Lecture Notes in Computer Science 14003 (2023), 46-63. \n 128.<\/strong> (with Cameron Fraize and Christopher Porter) Extraction Rates of Random Continuous Functionals, UCNC 2023, Springer Lecture Notes in Computer Science 14003 (2023), 46-63. \n 127.<\/strong> (with Richard Krogman) Complexity of Injection Structures Induced by Finite State Transducers, J. Logic and Computation 32 (2022), 1504-1530. \n 126.<\/strong> (with Wesley Calvert and Valentina Harizanov) Generically and Coarsely Computable Isomorphisms, Computability 11 (2022), 223-239. DOI: 10.3233\/COM-210382 (2022) \n 125.<\/strong> 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. \n 124.<\/strong> (with Richard Krogman) Computability and Categoricity of FST Injection Structures, CiE 2021, 17th Conference on Computability in Europe, Ghent, July\u00a02021, editors Liesbeth De Mol, Andreas Weiermann, Florin Manea and David Fernandez\u2011Duque, Springer Lecture Notes in Computer Science 12813 (2021), 106-119. \n 123.<\/strong> (with Chris Porter) Randomness extraction in computability theory, Computability 12 (2023), 1-21. DOI: 10.3233\/COM-210333. \n 122.<\/strong> (with Wesley Calvert and Valentina Harizanov) Densely computable structures, Journal of Logic and Computation 32 (2022), 581-607. \n 121.<\/strong> (with Jean Larson, Chris Porter and Jindrich Zapletal) Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic, Volume\u00a02: Foundations of Mathematics, World Scientific Press (2022), ISBN:\u00a0978-981-124-384-4. \n 120.<\/strong> (edited with Chris Porter and Jindrich Zapletal) Structure and Randomness in Computability and Set Theory, World Scientific Press (2020), 366 pages. \n 119.<\/strong> (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. \n 118.<\/strong> (Jean Larson, Chris Porter and Jindrich Zapletal) Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic, Volume\u00a01: Set Theory, World Scientific Press (2020). \n 117.<\/strong> (with Jacob Carson and Jeffrey Remmel) Effective categoricity of automatic equivalence and nested equivalence structures, Theory of Computing Systems 64 (2020), 1110-1139. \n 116.<\/strong> (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 \n 115.<\/strong> (with Francis Adams and Selwyn Ng) Computability and Categoricity of Weakly Homogeneous Boolean Algebras and Abelian p\u2011Groups, in Aspects of Computation and Automata with Applications (2024), World Scientific Press IMS LNS 42, 141-158. \n 114.<\/strong> (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. \n 113.<\/strong> (number omitted in original; placeholder)<\/em> \n 111.<\/strong> (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). \n 112.<\/strong> (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 \n 111.<\/strong> (with G. Barmpalias and C. Porter) Random numbers as probabilities of machine behaviour, Theoretical Computer Science 673 (2017), 1\u201318. https:\/\/arxiv.org\/abs\/1605.05838 \n 110.<\/strong> (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. \n 109.<\/strong> (with Francis Adams) Computability and Categoricity of Weakly Ultrahomogeneous Structures, Computability 6 (2017), 365-389. https:\/\/arxiv.org\/abs\/1608.01254 \n 108.<\/strong> 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.\u00a09537 (2015), 60-75. \n 107.<\/strong> (with Chris Porter) Algorithmically random functions and effective capacities. Theory and Methods of Computation (TAMC 2015), Springer Lecture Notes in Mathematics\u00a09076 (2015), 22-37. \n 106.<\/strong> (with S. Buss and J. Remmel) Sub\u2011comparable Bounded Randomness, Logical Methods in Computer Science 10 (2014). \n 105.<\/strong> (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. \n 104.<\/strong> (with M. Minnes and J. Remmel), Injection structures specified by finite state transducers, CiE\u00a02014, Electronic Proceedings. \n 103.<\/strong> (with V. Harizanov and J. Remmel) Two\u2011to\u2011One Structures, Journal of Logic and Computation 23 (2013), 1195-1223. \n 102.<\/strong> (with V. Harizanov and J. Remmel) Computability\u2011theoretic properties of injection structures, Algebra and Logic\u00a053 (2014), 39-69. \n 101.<\/strong> Various papers on $\\\\Pi^0_1$ classes (Review), Bulletin for Symbolic Logic 18 (2012), 409-412. \n 100.<\/strong> (with J. Remmel) Subcomputable bounded pseudorandomness, in LFCS\u00a02013 (Logical Foundations of Computer Science), San Diego, January\u00a02013, Springer Lecture Notes in Computer Science 7734 (2013), 104-118. \n 99.<\/strong> (with R. Weber) Effective randomness of unions and intersections, Theory of Computing Systems 52 (2013), 48-64. \n 98.<\/strong> (with J.B. Remmel) A connection between the Cantor\u2011Bendixson derivative and the well\u2011founded semantics of finite logic programs, Ann.Math. and Artificial Intelligence 65 (2012), pp.\u00a01-24. \n 97.<\/strong> (with A. Dashti, F. Toska and S. Wyman) Computability of countable subshifts in one dimension, Theory of Computing Systems 51 (2012), pp.\u00a0352-371. \n 96.<\/strong> (with P. Brodhead, F. Toska and S. Wyman) Algorithmic randomness and capacity of closed sets, Logical Methods in Computer Science 6 (2011), 1-16. \n 95.<\/strong> (with V. Harizanov and J. Remmel) Effective categoricity of injection structures, CiE\u00a02011, Springer Lecture Notes in Computer Science (2011), 51-60. \n 94.<\/strong> (with V. Harizanov and J. Remmel) $\\\\Sigma^0_1$ and $\\\\Pi^0_1$ structures, Annals of Pure and Applied Logic 162 (2011), 490-503. \n 93.<\/strong> (with J. Franklin, Jiang Lu, and Guohua Wu) A superhigh diamond in the c.e.\u00a0tt\u2011degrees, Arch. Math. Logic 50 (2011), 33-44. \n 92.<\/strong> (with J.B. Remmel) A connection between the Cantor\u2011Bendixson derivative and the well\u2011founded semantics of finite logic programs, Nonmon@30 (30 Years of Nonmonotonic Reasoning), Lexington, Kentucky, October\u00a02010, URL: http:\/\/www.cs.uky.edu\/~marek\/nonmonat30.dir\/cenzerRemmel.pdf \n 91.<\/strong> (with A. Dashti, F. Toska and S. Wyman) Computability of countable subshifts, in Programs, Proofs and Processes, CIE\u00a02010, eds. F. Ferreira et al., Springer Lecture Notes in Computer Science 6158 (2010) 88-97. \n 90.<\/strong> (with Paul Brodhead) Effective capacity and randomness of closed sets, in Computability and Complexity in Analysis, CCA\u00a02010, eds. X. Zheng and N. Zhong, Springer Electronic Proceedings in Theoretical Computer Science 24 (2010), 67-76. \n 89.<\/strong> (with G. LaForte and J. Remmel) Equivalence structures and isomorphisms in the difference hierarchy, J. Symbolic Logic 74 (2009), 535-556. \n 88.<\/strong> (with G. Laforte and G. Wu) Pseudojumps and $\\\\Pi^0_1$ classes, J. Logic and Computation 19 (2009), 77-87. \n 87.<\/strong> (with G. Barmpalias, J. Remmel and R. Weber) $K$\u2011triviality of closed sets and continuous functions, J. Logic and Computation 19 (2009), 3-16. \n 86.<\/strong> (with T. Kihara, R. Weber and G. Wu) Immunity and non\u2011cupping for closed sets, Tbilisi Math. Journal 2 (2009), 79-96. \n 85.<\/strong> (with R. Downey, J. Remmel and Z. Uddin) Space Complexity of Abelian Groups, Archive for Math. Logic 48 (2009), 63-76. \n 84.<\/strong> (Editor, with Valentina Harizanov, David Marker and Carol Wood) Proceedings of the Model Theory and Computable Model Theory Workshop, Gainesville, February\u00a02007, Archive for Math. Logic 48 (2009), 1-6. \n 83.<\/strong> (with W. Calvert, V. Harizanov and A. Morozov) Effective categoricity of Abelian\u00a0$p$\u2011groups, Ann. Pure and Applied Logic\u00a059 (2009), 187-197. \n 82.<\/strong> (with B. Csima and B. Khoussainov) Linear orders with distinguished function symbols, Archive for Math. Logic\u00a048 (2009), 115-140. \n 81.<\/strong> (with V. Harizanov and J.B. Remmel) $\\\\Sigma^0_1$ and $\\\\Pi^0_1$ equivalence structures, in CIE\u00a02009, K. Ambos\u2011Spies, B. Lowe and W. Merkle (eds.) Springer Lecture Notes in Computer Science\u00a05635 (2009), 99-108. \n 80.<\/strong> (with R. Weber and G. Wu) Immunity for closed sets, Springer Lecture Notes in Computer Science, in CIE\u00a02009, K. Ambos\u2011Spies, B. Lowe and W. Merkle (eds.) Springer Lecture Notes in Computer Science\u00a05635 (2009), 109-117. \n 79.<\/strong> (with J. Franklin, Jiang Lu and Guohua Wu) Embedding the diamond lattice in the c.e.\u00a0tt\u2011degrees with superhigh atoms, TAMC\u00a02009 (Theory and Applications of Models of Computation), J. Chen and S.B. Cooper (Eds.), Springer Lecture Notes in Computer Science\u00a05532 (2009), 420-429. \n 78.<\/strong> (with S. Ali Dashti and Jonathan L.F. King) Computable Symbolic Dynamics, Math. Logic Quarterly\u00a054 (2008), 524-533. \n 77.<\/strong> (with P. Brodhead) Effectively closed sets and enumerations, Archive for Mathematical Logic\u00a045 (2008), 565-582. \n 76.<\/strong> (with Peter Hinman) Degrees of difficulty of generalized r.e. separating classes, Archive for Mathematical Logic\u00a045 (2008), 629-647. \n 75.<\/strong> (with J.B. Remmel) A connection between Cantor\u2011Bendixson derivatives and the well\u2011founded semantics of logic programs, ISAIM\u00a02008, The Tenth International Symposium on Artificial Intelligence and Mathematics, Fort Lauderdale, January\u00a02008. \n 74.<\/strong> (with Rebecca Weber) Preface to Special Issue of Archive for Math. Logic (Proceedings of CCA\u00a02006) 45 (2008), 529-531. \n 73.<\/strong> (with G. Barmpalias, P. Brodhead, J. Remmel and R. Weber) Algorithmic randomness of continuous functions, Archive for Mathematical Logic\u00a045 (2008), 533-546. \n 72.<\/strong> (with S. Ali Dashti and Jonathan L.F. King) Effective Symbolic Dynamics, CCA\u00a02007 (Computability and Complexity in Analysis), Siena, June\u00a02007, Eds. R. Dillhage, T. Grubb, A. Sorbi, K. Weihrauch and N. Zhong, Springer Electronic Notes in Computer Science\u00a0202 (2008), 89-99. \n 71.<\/strong> (with G. Barmpalias, P. Brodhead, A. Dashti and R. Weber) Algorithmically random functions and effective capacities, Journal for Logic and Computation\u00a017 (2007), 1041-1062. \n 70.<\/strong> (with George Barmpalias, Jeffrey Remmel and Rebecca Weber) $K$\u2011trivial closed sets and continuous functions, in Computation and Logic in the Real World \u2013 Proceedings CIE\u00a02007, Editors S.B. Cooper, B. Loewe and A. Sorbi, Springer Lecture Notes in Computer Science\u00a04497 (2007), 135-145. \n 69.<\/strong> (with G. Laforte, and G. Wu) Pseudojumps and $\\\\Pi^0_1$ classes, in Computation and Logic in the Real World \u2013 Proceedings CIE\u00a02007, Editors S.B. Cooper, B. Loewe and A. Sorbi, Springer Lecture Notes in Computer Science\u00a04497 (2007), 146-151. \n 68.<\/strong> (Editor, with R. Dillhage, T. Grubb and K. Weihrauch) Third International Conference on Computability and Complexity in Analysis, Information Berichte, FernUniversit\u00e4t, 366 pages, and Springer Electronic Notes in Computer Science\u00a0167 (2007). \n 67.<\/strong> (with Peter Hinman) Medvedev degrees of generalized r.e. separating classes, Proc. CCA\u00a02006, D. Cenzer, R. Dillhage, T. Grubb and Klaus Weihrauch (eds.): Third International Conference on Computability and Complexity in Analysis, Information Berichte, FernUniversit\u00e4t (2006), 125-142, and Springer Electronic Notes in Computer Science\u00a0167 (2007). \n 66.<\/strong> (with Paul Brodhead and Jeffrey Remmel) Random continuous functions, Proc. CCA\u00a02006, D. Cenzer, R. Dillhage, T. Grubb and Klaus Weihrauch (eds.): Third International Conference on Computability and Complexity in Analysis, Information Berichte, FernUniversit\u00e4t (2006), 76-89, and Springer Electronic Notes in Computer Science\u00a0167 (2007). \n 65.<\/strong> (with J. Remmel) On the complexity of inductive definitions, Mathematical Structures in Computer Science\u00a016 (2006), 763-788. \n 64.<\/strong> (with Zia Uddin) Space complexity of structures, in Logical Approaches to Computational Barriers, Proc. CIE\u00a02006, A. Beckmann, U. Berger, B. Loewe and J.Tucker (eds.) Springer Lecture Notes in Computer Science\u00a03988 (2006), 76-85. \n 63.<\/strong> (with P. Brodhead and S. Dashti) Random closed sets, in Logical Approaches to Computational Barriers, Proc. CIE\u00a02006, A. Beckmann, U. Berger, B. Loewe and J.Tucker (eds.) Springer Lecture Notes in Computer Science\u00a03988 (2006), 55-64. \n 62.<\/strong> (with W. Calvert, V. Harizanov and A. Morozov) Effective categoricity of Equivalence Structures, Annals of Pure and Applied Logic\u00a0141 (2006), 61-78. \n 61.<\/strong> Decidability, completeness and complexity, Journal of Symbolic Logic\u00a071 (2006), 399-424. \n 60.<\/strong> (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.\u00a03526 (2005), 75-85. \n 59.<\/strong> (with F. Riazati) Minimal extensions of $\\\\Pi^0_1$ classes, Mathematical Logic Quarterly\u00a051 (2005), 206-216. \n 58.<\/strong> (with W. Marek and J. Remmel) Logic programming with infinite sets, Annals of Artificial Intelligence and Mathematics\u00a044 (2005), 309-339. \n 57.<\/strong> (with J. Remmel) Proof\u2011Theoretic Strength of the Stable Marriage Theorem and Other Problems, in \u201cReverse Mathematics 2001\u201d, edited by S. Simpson, ASL Lecture Notes in Logic vol.\u00a021, A.K. Peters (2005), 67-103. \n 56.<\/strong> (with J. Remmel) Index sets for computable differential equations, pages, Math. Logic Quarterly\u00a050 (2004), 329-344. \n 55.<\/strong> (with J. Remmel and A. Vanderbilt) Complexity of Locally Determined Logic Programs and Recursive Stable Models, Annals of Mathematics and Artificial Intelligence\u00a040 (2004), 225-262. \n 54.<\/strong> (with A. Nies) Global properties of the lattice of $\\\\Pi^0_1$ classes, Proceedings Amer. Math. Society\u00a0132 (2004), 239-249. \n 53.<\/strong> (with W. Marek and J. Remmel) Using logic programs to reason about infinite sets, 8th International Symposium on Artificial Intelligence and Mathematics (2004), <a href=\"http:\/\/rutcor.rutgers.edu\/~amai\/aimath04\">http:\/\/rutcor.rutgers.edu\/~amai\/aimath04<\/a>. \n 52.<\/strong> (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\u2013182. \n 51.<\/strong> (with P. Hinman) Density of the Medvedev Lattice of $\\\\Pi^0_1$ classes, Archive for Mathematical Logic\u00a042 (2003), 583-600. \n 50.<\/strong> (with J. Remmel) Index sets in $\\\\omega$\u2011languages, Mathematical Logic Quarterly\u00a049 (2003), 22\u201333. \n 49.<\/strong> (with J. Remmel) Effectively closed sets and graphs of computable real functions, Theoretical Computer Science\u00a0284 (2002), pp.\u00a0279\u2013318. \n 48.<\/strong> (with A. Vanderbilt) Common Derivations in Locally Determined Logic Programs, conference paper, 7th International Symposium on AI and Mathematics, December\u00a02001, URL:\u00a0http:\/\/rutcor.rutgers.edu\/~amai\/aimath02 \n 47.<\/strong> (with A. Nies) Initial segments of the lattice of Pi\u20110\u20111 Classes, Journal of Symbolic Logic\u00a066 (2001), 1749\u20131765. \n 46.<\/strong> (with C. Jockusch) $\\\\Pi^0_1$ Classes \u2013 Structure and Applications, in Computability Theory and Its Applications, eds. P. Cholak, S. Lempp, M. Lerman and R. Shore, Contemporary Mathematics\u00a0257 (2000), 39\u201359. \n45.<\/strong> (with J. Remmel and A. Vanderbilt) The complexity of the set of \nthe extensions of nonmonotonic rule systems, Artificial Intelligence \nand Mathematics conference paper, Fort Lauderdale, January 2000, \n<a href=\"http:\/\/rutcor.rutgers.edu\/~amai\/aimath00\">http:\/\/rutcor.rutgers.edu\/~amai\/aimath00<\/a>. \n44.<\/strong> (with J. Remmel and A. Vanderbilt) Locally Determined Logic Programs, in Logic Programming and Nonmonotonic Reasoning, El\u202fPaso, December\u202f1999, Springer Lecture Notes in Artificial Intelligence 1730 (1999), 34\u201348. \n 43.<\/strong> (with J. Remmel) Polynomial time versus computable Boolean algebras, in \u201cRecursion Theory and Complexity\u201d (Proc.\u202f1997\u202fKazan Workshop), eds. M.\u202fArslanov &\u202fS.\u202fLempp, de\u202fGruyter (1999), pp.\u202f15\u201353. \n 42.<\/strong>\u202f$\\\\Pi^0_1$ Classes in Computability Theory, in Handbook of Computability<\/em> (ed.\u202fE.\u202fGriffor), North\u2011Holland Studies in Logic 140 (1999), pp.\u202f37\u201385. \n 41.<\/strong> (with V.\u202fMarek &\u202fJ.\u202fRemmel) Index Sets for Finite Predicate Logic Programs, FLOC \u201999 Workshop on \u201cComplexity\u2011theoretic and Recursion\u2011theoretic methods in Databases, Artificial Intelligence and Finite Model Theory\u201d, (1999), pp.\u202f72\u201380. \n 40.<\/strong> (with J.\u202fRemmel) Index Sets in Computable Analysis, Theoretical Computer Science 219 (Special Issue for 1997 Dagstuhl meeting on Computability and Complexity in Analysis) (1999), pp.\u202f111\u2013150. \n 39.<\/strong> (with J.\u202fRemmel) Feasible graphs with standard universe, Proceedings Recursion Theory Week, Oberwolfach\u202f1996, Annals of Pure and Applied Logic 94 (1998), pp.\u202f21\u201335. \n 38.<\/strong> (with J.\u202fRemmel) Index Sets for $\\\\Pi^0_1$ classes, Proceedings of AMS Special Session, Orlando\u202f1996, Annals of Pure and Applied Logic 93 (1998), pp.\u202f3\u201361. \n 37.<\/strong> (with J.\u202fRemmel) $\\\\Pi^0_1$ Classes in Mathematics, \u201cHandbook of Recursive Mathematics\u201d, Vol.\u202f2 (eds.\u202fY.\u202fErsov,\u202fS.\u202fGoncharov,\u202fW.\u202fMarek,\u202fA.\u202fNerode,\u202fJ.\u202fRemmel), North\u2011Holland Studies in Logic 139 (1998), pp.\u202f623\u2013821. \n 36.<\/strong> (with J.\u202fRemmel) Complexity theoretic model theory and algebra, \u201cHandbook of Recursive Mathematics\u201d, Vol.\u202f1 (eds.\u202fY.\u202fErsov,\u202fS.\u202fGoncharov,\u202fW.\u202fMarek,\u202fA.\u202fNerode,\u202fJ.\u202fRemmel), North\u2011Holland Studies in Logic 138 (1998), pp.\u202f381\u2013513. \n 35.<\/strong> (Editor, with J.\u202fRemmel) Proceedings of AMS Special Session (Orlando\u202f1996), Annals of Pure and Applied Logic 93 (1998), pp.\u202f1\u20132. \n 34.<\/strong> (with W.\u202fMoser) A Good Oracle is Hard to Beat, Algorithmica 22 (1998), pp.\u202f18\u201334. \n 33.<\/strong> (with J.\u202fRemmel) Complexity and Categoricity, Information and Computation 140 (1998), 2\u201325. \n 32.<\/strong> (with J.\u202fRemmel) Feasibly categorical Abelian groups, in Proc. Feasible Math II<\/em> (eds.\u202fP.\u202fClote &\u202fJ.\u202fRemmel), Birkh\u00e4user (1995), 91\u2013153. \n 31.<\/strong> (with J.\u202fRemmel) Feasibly Categorical Models, in Logic and Computer Science<\/em> (Proc.\u202fLCC \u201994), Springer\u2011Verlag Lecture Notes in Computer Science 960 (1995), 300\u2013312. \n 30.<\/strong> (with W.\u202fMoser) Inductive inference of functions on the rationals, in COLT \u201995 (Proc.\u202f8th Annual Conf. Computational Learning Theory), ACM (1995), 178\u2013181. \n 29.<\/strong> (with J.\u202fRemmel) Feasible graphs and colorings, Math. Logic Quarterly 41 (1995), 327\u2013352. \n 28.<\/strong> (with R.\u202fDowney,\u202fC.\u202fJockusch,\u202fR.\u202fShore) Countable thin $\\\\Pi^0_1$ classes, Ann. Pure and Applied Logic 59 (1993), 79\u2013139. \n 27.<\/strong> Effective Dynamics, in Logical Methods<\/em> (in honor of A.\u202fNerode), eds.\u202fJ.\u202fCrossley,\u202fJ.\u202fRemmel,\u202fR.\u202fShore,\u202fM.\u202fSweedler, Birkh\u00e4user (1993), 162\u2013177. \n 26.<\/strong> (with J.\u202fRemmel) Polynomial\u2011time Abelian groups, Ann. Pure and Applied Logic 56 (1992), 313\u2013363. \n 25.<\/strong> (with J.\u202fRemmel) Recursively presented games and strategies, Math. Social Sciences 24 (1992), 117\u2013139. \n 24.<\/strong> (with J.\u202fRemmel) Polynomial\u2011time versus recursive models, Annals of Pure and Applied Logic 54 (1991), 17\u201358. \n 23.<\/strong> (with R.L.\u202fSmith) On the ranked points of a $\\\\Pi^0_1$ set, J. Symbolic Logic 54 (1989), 975\u2013991. \n 22.<\/strong> (with P.\u202fClote,\u202fR.\u202fSmith,\u202fR.\u202fSoare,\u202fS.\u202fWainer) Members of countable $\\\\Pi^0_1$ classes, Ann. Pure and Applied Logic 31 (1986), 45\u201363. \n 21.<\/strong> The stability problem, new results and counterexamples, Letters in Math. Physics 10 (1985), 367\u2013372. \n 20.<\/strong> (with R.D.\u202fMauldin) Borel equivalence and isomorphism of coanalytic sets, Dissertationes Math. 228 (1984), 1\u201332. \n 19.<\/strong> (with R.D.\u202fMauldin) Monotone reducibility and the family of finite sets, J. Symbolic Logic 49 (1984), 774\u2013782. \n 18.<\/strong> (with R.D.\u202fMauldin) On the Borel class of the derived\u2011set operator, II, Bull. Soc. Math. de France 111 (1983), 367\u2013372. \n 17.<\/strong> (with R.D.\u202fMauldin) Representations of well\u2011founded preference orders, Canadian J. Math. 35 (1983), 496\u2013508. \n 16.<\/strong> (with R.D.\u202fMauldin) On the Borel class of the derived\u2011set operator, Bull. Soc. Math. France 110 (1982), 357\u2013380. \n 15.<\/strong> (with R.D.\u202fMauldin) Faithful extensions of analytic sets to Borel sets, Houston J. Math. 6 (1980), 19\u201329. \n 14.<\/strong> Non\u2011generable formal languages, Fund. Informaticae 3 (1980), 95\u2013104. \n 13.<\/strong> (with R.D.\u202fMauldin) Inductive definability, measure and category, Advances in Math. 38 (1980), 55\u201390. \n 12.<\/strong> The stability problem for transformations of the circle, Proc. Royal Soc. Edinburgh 84A (1979), 279\u2013281. \n 11.<\/strong> Parametrized inductive definitions and recursive inductive operators over the continuum, Fundamenta Mathematica 100 (1978), 10\u201315. \n 10.<\/strong> (with R.D.\u202fMauldin) Measurable parametrizations and selections, Trans. Amer. Math. Soc. 245 (1978), 399\u2013408. \n 9.<\/strong> (with E.\u202fHoworka) On vertex k\u2011partitions of certain infinite graphs, Discrete Math. 23 (1978), 105\u2013113. \n 8.<\/strong> Non\u2011generable r.e. sets, in Fundamentals of Computation Theory (Proc.\u202fConf. Posnan\u202f1977), Springer Lecture Notes in Computer Science 56 (1977), 379\u2013385. \n 7.<\/strong> Inductive definitions, positive and monotone, in Set Theory and Hierarchy Theory (Proc. Conf.\u202fBierutowice\u202f1975), Springer\u2011Verdy 537 (1976), 51\u201363. \n 6.<\/strong> Monotone inductive definitions over the continuum, J. Symbolic Logic 41 (1976), 188\u2013198. \n 5.<\/strong> Analytic inductive definitions, J. Symbolic Logic 39 (1974), 310\u2013312. \n 4.<\/strong> Inductively defined sets of reals, Bull. Amer. Math. Soc. 80 (1974), 485\u2013487. \n 3.<\/strong> (with A.R.\u202fBlass) Cores of $\\\\Pi^1_1$ sets of reals, J. Symbolic Logic 39 (1974), 649\u2013654. \n 2.<\/strong> The boundedness principle in ordinal recursion, Fund. Math. 71 (1974), 203\u2013212. \n 1.<\/strong> Ordinal recursion and inductive definitions, in Generalized Recursion Theory (Proc.\u202fConf. Oslo\u202f1972), eds.\u202fJ.\u202fFenstad &\u202fP.\u202fHinman, North\u2011Holland (1974), 221\u2013264.<\/p>\n<\/section>\n<footer class=\"accessibility-note\">\n 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\u2011reader users to jump directly to each section. \n <\/footer>\n<\/body> \n<\/html> <\/p>\n","protected":false},"excerpt":{"rendered":"Curriculum Vitae \u2013 Douglas Cenzer Biography Education Professional Experience Awards Grants Listing and Organizations Service Theses Selected Lectures Publications Contact CURRICULUM VITAE Douglas Cenzer PRESENT POSITION: Emeritus Professor, University of Florida Address Department of Mathematics, University of Florida P.O. Box\u00a0118105 358 Little Hall, Gainesville, FL\u00a032611\u20118105 email: cenzer@ufl.edu URL: https:\/\/people.clas.ufl.edu\/cenzer\/ phone: 352\u2011294\u20112350 Education University of Michigan […]<\/p>\n","protected":false},"author":144,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_acf_changed":false,"featured_post":"","footnotes":"","_links_to":"","_links_to_target":""},"class_list":["post-1108","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/pages\/1108","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/users\/144"}],"replies":[{"embeddable":true,"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/comments?post=1108"}],"version-history":[{"count":8,"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/pages\/1108\/revisions"}],"predecessor-version":[{"id":1123,"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/pages\/1108\/revisions\/1123"}],"wp:attachment":[{"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/media?parent=1108"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}