- RECURSIVELY PRESENTED GAMES AND STRATEGIES Douglas Cenzer and Jeffrey Remmel
- Archive for Mathematical Logic manuscript No. (will be inserted by the editor)
- POLYNOMIAL-TIME ABELIAN GROUPS Douglas Cenzer and Jeffrey Remmel
- EFFECTIVE REAL DYNAMICS Douglas Cenzer
- Index sets for \Pi 0 1 classes ?
- Using logic programs to reason about infinite sets J.B. Remmel
- Common Derivations in Locally Determined Logic Programs
- FEASIBLE GRAPHS AND COLORINGS Douglas Cenzer and Jeffrey Remmel
- A Connection between the Cantor-Bendixson Derivative and the Well-Founded Semantics of
- Algorithmic Randomness of Closed Sets George Barmpalias
- Under consideration for publication in Math. Struct. in Comp. Science On the Complexity of Inductive Definitions
- Locally Determined Logic Programs and Recursive Stable A. Douglas Cenzer (cenzer@ufl.edu)
- Archive for Mathematical Logic manuscript No. (will be inserted by the editor)
- Complexity, Decidability and Completeness Douglas Cenzer
- Computability of Countable Subshifts Douglas Cenzer, Ali Dashti, Ferit Toska and Sebastian Wyman
- LINEAR ORDERS WITH DISTINGUISHED FUNCTION DOUGLAS CENZER, BARBARA F. CSIMA, AND BAKHADYR KHOUSSAINOV
- Archive for Mathematical Logic manuscript No. (will be inserted by the editor)
- Random Closed Sets Paul Brodhead, Douglas Cenzer, and Seyyed Dashti
- Logspace Complexity of Functions and Structures
- The Complexity of Inductive Definability Douglas Cenzer1
- Math. Log. Quart. 51, No. 2, 206 216 (2005) / DOI 10.1002/malq.200410021 / www.mlq-journal.org Minimal extensions of 0
- 1 Classes and pseudojump operators Douglas Cenzer, Geoffrey LaForte, Guohua Wu
- Space Complexity of Abelian Groups Douglas Cenzer
- Proof-Theoretic Strength of the Stable Marriage Theorem and Other Problems
- Initial segments of the lattice of 0 Douglas Cenzer
- POLYNOMIAL-TIME VERSUS RECURSIVE MODELS Douglas Cenzer and Jeffrey Remmel*
- Effective Categoricity of Abelian p-Groups Wesley Calvert
- Special Year In Logic Computability and Complexity in Analysis 2006
- Contemporary Mathematics 1 Classes { Structure and Applications
- PolynomialTime versus Computable Boolean Douglas Cenzer
- Effective Categoricity of Equivalence Structures Wesley Calvert
- Computable Symbolic Dynamics Douglas Cenzer, S. Ali Dashti and Jonathan L.F. King
- COUNTABLE THIN 0 Douglas Cenzer, Rodney Downey,
- Degrees of difficulty of generalized r.e. separating Douglas Cenzer and Peter G. Hinman
- Index Sets for Computable Real Functions Douglas Cenzer
- Logic Programming with Infinite Sets Douglas Cenzer (cenzer@ufl.edu)
- The Complexity of the Set of Extensions of a Locally Determined Nonmonotonic Rule System
- A GOOD ORACLE IS HARD TO BEAT DOUGLAS A. CENZER AND WILLIAM R. MOSER
- Equivalence structures and isomorphisms in the difference hierarchy
- Pseudojump Operators and 0 Douglas Cenzer1
- Effectively Closed Sets PARTIAL DRAFT
- Medvedev degrees of generalized r.e. separating classes
- 1 Classes in Mathematics Douglas Cenzer
- The Third International Conference on Computability and Complexity in Analysis, CCA 2006, took place on November 15, 2006 at the University
- Complexity and Categoricity Douglas Cenzer and Je rey B. Remmel
- Feasibly Categorical Abelian Groups DOUGLAS CENZER and JEFFREY REMMEL
- Equivalence Structures and Isomorphisms in the Difference Hierarchy
- Feasibly Categorical Models Douglas Cenzer 1 and Je rey B. Remmel 2
- Series Logo Volume 00, 19xx
- Index Sets for Finite Predicate Logic Programs Douglas Cenzer 1 , Victor W. Marek 2 , and Je rey B. Remmel 3
- Medvedev degrees of generalized r.e. separating D. Cenzer and P.G. Hinman
- Index Sets for !-languages Douglas Cenzer
- Feasible graphs with standard universe Douglas Cenzer
- Effectively Closed Sets and Graphs of Computable Real Functions
- The Complexity of the Set of Extensions of a Locally Determined Nonmonotonic Rule System
- Complexity Theoretic Model Theory and Algebra Douglas Cenzer
- Embedding the Diamond Lattice in the c.e. tt-Degrees with Superhigh Atoms
- Math. Log. Quart. 50, No. 4/5, 329 344 (2004) / DOI 10.1002/malq.200310102 / www.mlq-journal.org Index sets for computable differential equations
- Index Sets in Computable Analysis Special Issue on CCA
- 1 classes in recursion theory: DRAFT Douglas Cenzer
- The nonisolating degrees are nowhere dense in the computably enumerable
