{"id":19,"date":"2012-09-05T11:22:25","date_gmt":"2012-09-05T15:22:25","guid":{"rendered":"https:\/\/people.clas.ufl.edu\/template\/?page_id=19"},"modified":"2026-03-19T08:10:45","modified_gmt":"2026-03-19T12:10:45","slug":"publications","status":"publish","type":"page","link":"https:\/\/people.clas.ufl.edu\/cenzer\/publications\/","title":{"rendered":"Selected Publications"},"content":{"rendered":"\r\n
\r\n\t
\r\n\t\t
\r\n\t\t\t
\r\n\t\t\t\t\n

Selected Publications<\/h1>\n\n\n\n\n\n\n\n\n\n

Effectively Closed Sets (with Jeffrey B. Remmel), Perspective in Logic, Cambridge U. Press,
\n350 pages, to appear.
\n DRAFT <\/a><\/p>\n\n\n\n\n\n

Extraction Rates of Random Continuous Functionals (with Cameron Fraize and Christopher Porter), UCNC 2023, Springer Lecture Notes in Computer Science 14003 (2023),
\n 46-63.<\/p>\n\n\n\n\n\n

Generically Computable Abelian Groups (with Wesley Calvert and Valentina Harizanov), UCNC 2023, Springer Lecture Notes in Computer Science 14003 (2023), 46-63.<\/p>\n\n\n\n\n\n

Computability and Categoricity of Weakly Homogeneous Boolean Algebras and Abelian p-Groups (with Francis Adams and Selwyn Ng),
\nin emph{Aspects of Computation and Automata with Applications}, World Scientific Press IMS LNS 42 (2023), 141-158.
\nABSTRACT <\/a<\/a><\/p>\n\n\n\n\n\n

Randomness Extraction in Computability Theory (with Chris Porter), Computability 12 (2023), 1-21.
\nDOI: 10.3233\/COM-210343
\nABSTRACT, ARTICLE at ArXiv <\/a><\/p>\n\n\n\n\n\n

Complexity of Injection Structures Induced by Finite State Transducers (with Richard Krogman), J. Logic and Computation 32 (2022), 1504-1530.<\/p>\n\n\n\n\n\n

Generically and Coarsely Computable Isomorphisms (with Wesley Calvert and Valentina Harizanov),
\nComputability 11 (2022), 223-239.
\n DOI: 10.3233\/COM-210382 <\/p>\n\n\n\n\n\n

The Isomorphism Problem for FST Injection Structures (with Richard Krogman), LFCS 2022, Springer Lecture Notes in Computer Science 13137, eds. Sergei Artemov and Anil Nerode (2022), 25-36.<\/p>\n\n\n\n\n\n

Densely computable structures (with Wesley Calvert and Valentina Harizanov), J. Logic and Computation 32 (2022), 581-607.
\nDOI: 10.1093\/logcom\/exab057
\nABSTRACT <\/a><\/p>\n\n\n\n\n\n

Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic,
\nVolume 2: Foundations of Mathematics (Jean Larson, Chris Porter and Jindrich Zapletal), World Scientific Press (2022).<\/p>\n\n\n\n\n\n

Complexity and Categoricity of Injection Structures Induced by Finite State Transducers (with Richard Krogman), in emph{Connecting with Computability},
\n17th Conference on Computability in Europe, Ghent, July 2021, editors Liesbeth De Mol, Andreas Weiermann, Florin Manea and David Fernandez-Duque, Springer Lecture Notes in Computer Science 12813 (2021), 106-119.
\nABSTRACT <\/a><\/p>\n\n\n\n\n\n

Structure and Randomness in Computability and Set Theory (edited with Chris Porter and Jindrich Zapletal), World Scientific Press (2020), 366 pages.<\/p>\n\n\n\n\n\n

Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic,
\nVolume 1: Set Theory(Jean Larson, Chris Porter and Jindrich Zapletal) , World Scientific Press (2020), 209 pages<\/p>\n\n\n\n\n\n

On the complexity of index sets for finite predicate logic programs which allow function symbols (with V.W. Marek and J.B. Remmel),
\nJ. Logic and Computation 30 (2020), 107-156.
\nABSTRACT <\/a><\/p>\n\n\n\n\n\n

Effective categoricity of automatic equivalence and nested equivalence structures (with Jacob Carson and Jeffrey Remmel), Theory of Computing Systems 64 (2020), 1110-1139.
\nABSTRACT <\/a><\/p>\n\n\n\n\n\n

Logic Programming and Effectively Closed Sets (with V.W. Marek and J.B. Remmel), in Structure and Randomness in Computability and Set Theory, World Scientific Press (2020), 197-283.
\nABSTRACT <\/a><\/p>\n\n\n\n\n\n

Computability and differentiability of functions on the Cantor space (with Diego Rojas), CiE 2018, Springer Lecture Notes in Computer Science 10936 (2018), 136-145.
\nABSTRACT <\/a><\/p>\n\n\n\n\n\n

The random members of a $Pi^0_1$ class (with C. Porter), Theory of Computing Systems, 62 (2018) 1637-1671.
\nABSTRACT, ARTICLE at ArXiv <\/a><\/p>\n\n\n\n\n\n

The probability of a computable output from a random oracle (with G. Barmpalias and C. Porter), ACM Transactions on Computational Logic 18 (2017), 15 pp.
\nABSTRACT, ARTICLE at ArXiv <\/a><\/p>\n\n\n\n\n\n

Injection structures specified by finite state transducers (with S. Buss, M. Minnes, and J.B. Remmel), in Computability and Complexity (Downey Festschrift, New Zealand, 2016), Springer Lecture Notes in Computer Science, Vol. 10010 (2017), 1-24.
\nABSTRACT <\/a> and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Random numbers as probabilities of machine behaviour (with G. Barmpalias and C. Porter), Theoretical Computer Science, 673 (2017), 1-18.
\nABSTRACT, ARTICLE at ArXiv <\/a><\/p>\n\n\n\n\n\n

Computability and Categoricity of Weakly Ultrahomogeneous Structures (with F. Adams), Computability 6 (2017), 365-389.
\nABSTRACT, ARTICLE at ArXiv <\/a><\/p>\n\n\n\n\n\n

Index sets for finite normal predicate logic programs with function symbols (with V. Marek and J.B. Remmel), in Logical Foundations of Computer Science (LFCS 2016),Springer Lecture Notes in Computer Science vol. 9537 (2015), 60-75.<\/p>\n\n\n\n\n\n

Algorithmically random functions and effective capacities (with C. Porter),
\nTheory and Methods of Computation (TAMC 2015), Springer Lecture Notes in Mathematics 9076 (2015), 22-37.
\nABSTRACT, ARTICLE at ArXiv <\/a><\/p>\n\n\n\n\n\n

Computability and categoricity of ultrahomogeneous structures (with F. Adams), in emph{Language, Life, Limits (Proceedings of CiE 2014 ,Computability in Europe)}, Springer
\nLecture Notes in Computer Science 8493 (2014), 1-10.<\/p>\n\n\n\n\n\n

Sub-computable Bounded Randomness (with S. Buss and J.B. Remmel), Logical Methods in Computer Science 10 (2014).
\nABSTRACT, ARTICLE at ArXiv <\/a><\/p>\n\n\n\n\n\n

Two-to-One Structures \u00a0(with V. Harizanov and J. Remmel),\u00a0Journal of Logic and Computation 23 (2013), 1195-1223.
\nABSTRACT <\/a> and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Computability theoretic properties of injection structures \u00a0(with V. Harizanov and J. Remmel),\u00a0Algebra and Logic 53 (2014), 39-69.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Index sets for finite normal predicate logic programs \u00a0(with V.W. Marek and J.B. Remmel)
\nABSTRACT <\/a>and E-Print at arxiv <\/a><\/p>\n\n\n\n\n\n

Effective randomness of unions and intersections \u00a0(with R. Weber), Theory of Computing Systems 52(2013), 48-64.
\nABSTRACT <\/a> and ARTICLE <\/a><\/p>\n\n\n\n\n\n

A connection between the Cantor-Bendixson derivative and the well-founded semantics of logic programs (with J.B. Remmel), Annals of Mathematics and Artificial Intelligence 65 (2012), 1-24.
\nABSTRACT <\/a>and ARTICLE <\/a>
\nFirst appeared in online proceedings of ISAIM 2008, The Tenth International Symposium on Artificial Intelligence and Mathematics (Fort Lauderdale, 2008), 8 pages.<\/p>\n\n\n\n\n\n

Computability of countable subshifts in one dimension (with A. Dashti, F. Toska and S. Wyman), \u00a0Theory of Computing Systems 51 (2012), 352-371.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Algorithmic capacity and randomness of closed sets\u00a0\u00a0(with Paul Brodhead, F. Toska and S. Wyman) , Logical Methods in Computer Science 6 (2011), 1-16.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

$sigma^0_1$ and $Pi^0_1$ structures (with V. Harizanov and J.B. Remmel),
\nAnnals of Pure and Applied Logic 162 (2011), 490-503.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

A superhigh diamond in the c.e. $tt$-degrees (with J. Franklin, Jiang Lu and Guohua Wu), \u00a0Arch. Math. Logic 50 (2011), 33-44.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Immunity and non-cupping for closed sets (with T. Kihara, R. Weber and G. Wu), Tbilisi Math. Journal 2 (2009), 77-94
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Equivalence Structures and Isomorphisms in the Difference Hierarchy\u00a0(with G. LaForte and J.B. Remmel), Journal of Symbolic Logic 74 (2009), 535-556.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Effective Categoricity of Abelian p-Groups (with W. Calvert, V. Harizanov and A. Morozov) , \u00a0Annals of Pure and Applied Logic 159 (2009), 187-197.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Special Year in Logic–Model Theory and Computable Model Theory\u00a0(edited with Valentina Harizanov, David Marker and Carol Wood), Archive for Mathematical Logic 48 (2009), 1-6.
\nARTICLE <\/a><\/p>\n\n\n\n\n\n

Space Complexity of Abelian Groups (with R. Downey, J.B. Remmel and Z. Uddin) ,
\nArchive for Math. Logic 48 (2009), 63-76.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Pseudojumps and Pi-0-1 classes\u00a0 (with G. Laforte and G. Wu), J. Logic and Computation 19 (2009), 77-87.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

$K$-triviality of closed sets and continuous functions (with G. Barmpalias, J. Remmel and R. Weber) Journal of Logic and Computation 19 (2009), 3-16.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Linear orders with distinguished function symbol (with B. Csima and B. Khoussainov), Archive for Mathematical Logic 48 (2009), 115-140.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Computable symbolic dynamics (with S. Ali Dashti and J.L.F. King)
\nMathematical Logic Quarterly 54 (2008), 524-533.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Special Year in Logic–Computability and Complexity in Analysis (edited with Rebecca Weber), Archive for Mathematical Logic 45 (2008), 529-531.
\nARTICLE <\/a><\/p>\n\n\n\n\n\n

Degrees of difficulty of generalized r.e. separating classes (with Peter Hinman), Archive for Mathematical Logic 45 (2008), 629-647.
\nABSTRACT <\/a>and ARTICLE <\/a>
\nFirst appeared as Medvedev degrees of generalized r.e. separating classes
\nProc. CCA 2006, D. Cenzer, R. Dillhage, T. Grubb and Klaus Weihrauch (eds.): Third International Conference on Computability and Complexity in Analysis, Information Berichte, FernUniversit”{a}t (2006), 125-142, and Springer Electronic Notes in Computer Science 167 (2007), 203-223.<\/p>\n\n\n\n\n\n

Effectively closed sets and enumerations (with Paul Brodhead) Archive for Mathematical Logic 45 (2008), 565-582.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Algorithmic Randomness of Continuous Functions (with G. Barmpalias, P. Brodhead, J.B. Remmel and R. Weber) Archive for Mathematical Logic 45 (2008), 533-546.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Algorithmic Randomness of Closed Sets (with G. Barmpalias, P. Brodhead and A. S. Dashti and R. Weber) Journal for Logic and Computation, 17 (2007), 1041-1062.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Proceedings CCA 2006, Third International Conference on Computability and Complexity in Analysis, (edited with R. Dillhage, T. Grubb and Klaus Weihrauch)
\nInformation Berichte FernUniversit”{a}t Hagen (2006), and Springer Electronic Notes in Computer Science 167 (2007).
\n ARTICLE<\/a><\/p>\n\n\n\n\n\n

On the complexity of inductive definitions (with J. Remmel) Mathematical Structures in Computer Science 16 (2006), 763-788.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Complexity, decidability and completeness (with J. Remmel) Journal of Symbolic Logic 71 (2006), 399-424.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Effective categoricity of Equivalence Structures (with W. Calvert, V. Harizanov and A. Morozov) Annals of Pure and Applied Logic, 141 (2006), 61-78.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Logic programming with infinite sets, (with W. Marek and J. Remmel)
\nAnnals of Artificial Intelligence and Mathematics 44 (2005), 309–339.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Minimal Extensions of Pi-0-1 Classes, (with F. Riazati) Mathematical Logic Quarterly 51 (2005), 206-216.
\nABSTRACT
\n<\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Proof-Theoretic Strength of the Stable Marriage Theorem and Other Problems (with J. Remmel) “Reverse Mathematics”, edited by S. Simpson, ASL Lecture Notes in Logic 21, AK Peters (2005), 67–103.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Index sets for computable differential equations, (with J. Remmel)
\nMathematical Logic Quarterly 50 (2004), 329-344.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n

Locally determined logic programs and recursive stable models (with J. Remmel and A. Vanderbilt) Annals of Mathematics and Artificial Intelligence 40 (2004), 225-262.
\nABSTRACT <\/a>and ARTICLE <\/a><\/p>\n\n\n\n\n\n\n\n\n\r\n\t\t\t<\/div>\r\n\t\t<\/div>\r\n\t<\/div>\r\n<\/section>\r\n","protected":false},"excerpt":{"rendered":"","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-19","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/pages\/19","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=19"}],"version-history":[{"count":10,"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/pages\/19\/revisions"}],"predecessor-version":[{"id":1101,"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/pages\/19\/revisions\/1101"}],"wp:attachment":[{"href":"https:\/\/people.clas.ufl.edu\/cenzer\/wp-json\/wp\/v2\/media?parent=19"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}