|
Search the dblp DataBase
Douglas A. Cenzer:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Douglas A. Cenzer, V. Wiktor Marek, Jeffrey B. Remmel
Using Logic Programs to Reason about Infinite Sets. [Citation Graph (0, 0)][DBLP] AMAI, 2004, pp:- [Conf]
- Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
Characterizing the Set of Extensions of a Nonmonotonic Rule System with Levels. [Citation Graph (0, 0)][DBLP] AMAI, 2000, pp:- [Conf]
- Douglas A. Cenzer, Amy Vanderbilt
Common Derivations in Locally Determined Logic Programs. [Citation Graph (0, 0)][DBLP] AMAI, 2002, pp:- [Conf]
- Douglas A. Cenzer, Jeffrey B. Remmel
The Complexity of Inductive Definability. [Citation Graph (0, 0)][DBLP] CiE, 2005, pp:75-85 [Conf]
- Douglas A. Cenzer, William R. Moser
Inductive Inference of Functions on the Rationals. [Citation Graph (0, 0)][DBLP] COLT, 1995, pp:178-181 [Conf]
- Douglas A. Cenzer
Non-Generable RE Sets. [Citation Graph (0, 0)][DBLP] FCT, 1977, pp:379-385 [Conf]
- Douglas A. Cenzer, Jeffrey B. Remmel
Feasibly Categorial Models. [Citation Graph (0, 0)][DBLP] LCC, 1994, pp:300-312 [Conf]
- Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
Locally Determined Logic Programs. [Citation Graph (0, 0)][DBLP] LPNMR, 1999, pp:34-48 [Conf]
- Douglas A. Cenzer, William R. Moser
A Good Oracle Is Hard to Beat. [Citation Graph (0, 0)][DBLP] Algorithmica, 1998, v:22, n:1/2, pp:18-34 [Journal]
- Douglas A. Cenzer, Jeffrey B. Remmel, Victor W. Marek
Logic programming with infinite sets. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2005, v:44, n:4, pp:309-339 [Journal]
- Douglas A. Cenzer, Jeffrey B. Remmel, Amy Vanderbilt
Locally Determined Logic Programs and Recursive Stable Models. [Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2004, v:40, n:3-4, pp:225-262 [Journal]
- Douglas A. Cenzer, Peter G. Hinman
Density of the Medvedev lattice of Pi01 classes. [Citation Graph (0, 0)][DBLP] Arch. Math. Log., 2003, v:42, n:6, pp:583-600 [Journal]
- Douglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore
Countable Thin Pi01 Classes. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1993, v:59, n:2, pp:79-139 [Journal]
- Douglas A. Cenzer, Jeffrey B. Remmel
Polynomial-Time versus Recursive Models. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1991, v:54, n:1, pp:17-58 [Journal]
- Douglas A. Cenzer, Jeffrey B. Remmel
Polynomial-Time Abelian Groups. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1992, v:56, n:1-3, pp:313-363 [Journal]
- Douglas A. Cenzer, Jeffrey B. Remmel
Feasible Graphs with Standard Universe. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1998, v:94, n:1-3, pp:21-35 [Journal]
- Douglas A. Cenzer, Jeffrey B. Remmel
Preface. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:1-2 [Journal]
- Douglas A. Cenzer, Jeffrey B. Remmel
Index Sets for Pi01 Classes. [Citation Graph (0, 0)][DBLP] Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:3-61 [Journal]
- Douglas A. Cenzer
Non-generable formal languages. [Citation Graph (0, 0)][DBLP] Fundam. Inform., 1980, v:3, n:1, pp:95-104 [Journal]
- Douglas A. Cenzer, Jeffrey B. Remmel
Complexity and Categoricity. [Citation Graph (0, 0)][DBLP] Inf. Comput., 1998, v:140, n:1, pp:2-25 [Journal]
- Andreas Blass, Douglas A. Cenzer
Cores of pi11 Sets of Reals. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1974, v:39, n:4, pp:649-654 [Journal]
- Douglas A. Cenzer
Analytic Inductive Definitions. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1974, v:39, n:2, pp:310-312 [Journal]
- Douglas A. Cenzer
Monotone Inductive Definitions over the Continuum. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1976, v:41, n:1, pp:188-198 [Journal]
- Douglas A. Cenzer
Monotone Reducibility and the Family of Infinite Sets. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1984, v:49, n:3, pp:774-782 [Journal]
- Douglas A. Cenzer, André Nies
Initial Segments of The Lattice of PI01 Classes. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 2001, v:66, n:4, pp:1749-1765 [Journal]
- Douglas A. Cenzer, Rick L. Smith
On the Ranked Points of A pi01 Set. [Citation Graph (0, 0)][DBLP] J. Symb. Log., 1989, v:54, n:3, pp:975-991 [Journal]
- Douglas A. Cenzer, Jeffrey B. Remmel
Index sets for omega-languages. [Citation Graph (0, 0)][DBLP] Math. Log. Q., 2003, v:49, n:1, pp:22-33 [Journal]
- Jeffrey B. Remmel, Douglas A. Cenzer
Feasible Graphs and Colorings. [Citation Graph (0, 0)][DBLP] Math. Log. Q., 1995, v:41, n:, pp:327-352 [Journal]
- Douglas A. Cenzer, Jeffrey B. Remmel
Effectively closed sets and graphs of computable real functions. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2002, v:284, n:2, pp:279-318 [Journal]
- Douglas A. Cenzer, Jeffrey B. Remmel
Index Sets in Computable Analysis. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1999, v:219, n:1-2, pp:111-150 [Journal]
- George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber
K -Trivial Closed Sets and Continuous Functions. [Citation Graph (0, 0)][DBLP] CiE, 2007, pp:135-145 [Conf]
- Douglas A. Cenzer, Geoffrey LaForte, Guohua Wu
Pseudojump Operators and P01 Classes. [Citation Graph (0, 0)][DBLP] CiE, 2007, pp:146-151 [Conf]
S01 and P01 Equivalence Structures. [Citation Graph (, )][DBLP]
Computability of Countable Subshifts. [Citation Graph (, )][DBLP]
Effectively closed sets and enumerations. [Citation Graph (, )][DBLP]
Preface. [Citation Graph (, )][DBLP]
Algorithmic randomness of continuous functions. [Citation Graph (, )][DBLP]
Degrees of difficulty of generalized r.e. separating classes. [Citation Graph (, )][DBLP]
Preface. [Citation Graph (, )][DBLP]
Linear orders with distinguished function symbol. [Citation Graph (, )][DBLP]
Effective categoricity of Abelian p-groups. [Citation Graph (, )][DBLP]
Search in 0.060secs, Finished in 0.061secs
|