Cenzer, Douglas
59
papers
- 2376074
Barmpalias, George(4-LEED-SM); Brodhead, Paul(1-FL); Cenzer, Douglas(1-FL); Dashti, Seyyed(1-FL); Weber, Rebecca(1-DTM)
Algorithmic randomness of closed sets. (English summary)
J. Logic Comput. 17 (2007), no. 6, 1041--1062.
68Q30 (03D80 60C05)
- 2321789
Brodhead, Paul(1-FL); Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Random continuous functions. (English summary) Proceedings of the Third International Conference on Computability and Complexity in Analysis (CCA 2006), 275--287 (electronic),
Electron. Notes Theor. Comput. Sci., 167, Elsevier, Amsterdam, 2007.
03D80 (68Q30)
- 2321786
Brodhead, Paul(1-FL); Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Random continuous functions. (English summary) Proceedings of the Third International Conference on Computability and Complexity in Analysis (CCA 2006), 275--287 (electronic),
Electron. Notes Theor. Comput. Sci., 167, Elsevier, Amsterdam, 2007.
03D80 (68Q30)
- 2321775
Proceedings of the Third International Conference on Computability and Complexity in Analysis (CCA 2006).
Held at the University of Florida, Gainesville, FL, November 1--5, 2006. Edited by D. Cenzer, R. Dillhage, T. Grubba and K. Weihrauch. Electronic Notes in Theoretical Computer Science, 167. Elsevier Science B.V., Amsterdam, 2007. front matter+447 pp. (electronic).
03-06 (03D80 03F60)
- 2268342
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
On the complexity of inductive definitions. (English summary)
Math. Structures Comput. Sci. 16 (2006), no. 5, 763--788.
03D70 (03Fxx 68N17)
- 2229930
Calvert, Wesley(1-MRRS-MS); Cenzer, Douglas(1-FL); Harizanov, Valentina(1-GWU); Morozov, Andrei(RS-AOSSI)
Effective categoricity of equivalence structures.
(English. English summary)
Ann. Pure Appl. Logic 141 (2006), no. 1-2, 61--78.
03C57 (03D45)
- 2225885
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Complexity, decidability and completeness.
(English. English summary)
J. Symbolic Logic 71 (2006), no. 2, 399--424.
03D15 (03B25 03Cxx 03D05 68Q15)
- 2185428
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Proof-theoretic strength of the stable marriage theorem and other problems.
(English. English summary)
Reverse mathematics 2001,
67--103,
Lect. Notes Log.,
Assoc. Symbol. Logic, La Jolla, CA, 2005.
03F35
- 2185699
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD); Marek, Victor W.(1-KY)
Logic programming with infinite sets.
(English. English summary)
Ann. Math. Artif. Intell. 44 (2005), no. 4, 309--339.
68T27 (03B70 68N17)
- 2121214
Cenzer, Douglas(1-FL); Riazati, Farzan(1-FL)
Minimal extensions of $\Pi\sp 0\sb 1$ classes.
(English. English summary)
MLQ Math. Log. Q. 51 (2005), no. 2, 206--216.
03D25 (03D30)
- 2090381
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Index sets for computable differential equations.
(English. English summary)
MLQ Math. Log. Q. 50 (2004), no. 4-5, 329--344.
03D80 (03D55 03F60 34A05 34A12)
- 2037479
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD); Vanderbilt, Amy
Locally determined logic programs and recursive stable models.
(English. English summary)
Ann. Math. Artif. Intell. 40 (2004), no. 3-4, 225--262.
68N17 (68Q55)
- 2021268
Cenzer, Douglas(1-FL); Nies, André(1-CHI)
Global properties of the lattice of $\Pi\sp 0\sb 1$ classes.
(English. English summary)
Proc. Amer. Math. Soc. 132 (2004), no. 1, 239--249 (electronic).
03D25
- 2001061
Cenzer, Douglas(1-FL); Hinman, Peter G.(1-MI)
Density of the Medvedev lattice of $\Pi\sp 0\sb 1$ classes.
(English. English summary)
Arch. Math. Logic 42 (2003), no. 6, 583--600.
03D30 (03D25)
- 1923903
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Effectively closed sets and graphs of computable real functions.
(English. English summary)
Computability and complexity in analysis (Castle Dagstuhl, 1999).
Theoret. Comput. Sci. 284 (2002), no. 2, 279--318.
03F60 (03D15 68Q05)
- 1877019
Cenzer, Douglas(1-FL); Nies, Andre(1-CHI)
Initial segments of the lattice of $\Pi\sp 0\sb 1$ classes.
(English. English summary)
J. Symbolic Logic 66 (2001), no. 4, 1749--1765.
03D55 (03D25 03D45)
- 1770733
Cenzer, Douglas(1-FL); Jockusch, Carl G., Jr.(1-IL)
$\Pi\sb 1\sp 0$ classes---structure and applications.
(English. English summary)
Computability theory and its applications (Boulder, CO, 1999),
39--59,
Contemp. Math., 257,
Amer. Math. Soc., Providence, RI, 2000.
03D30 (03C62 03D25 03E15 03F35 03F60)
- 1786881
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD); Vanderbilt, Amy(1-FL)
Locally determined logic programs.
(English. English summary)
Logic programming and nonmonotonic reasoning (El Paso, TX, 1999),
34--48,
Lecture Notes in Comput. Sci., 1730,
Springer, Berlin, 1999.
68N17
- 1724930
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Polynomial-time versus computable Boolean algebras.
Recursion theory and complexity (Kazan, 1997),
15--53,
de Gruyter Ser. Log. Appl., 2,
de Gruyter, Berlin, 1999.
03D45 (03D15)
- 1720779
Cenzer, Douglas(1-FL)
$\Pi\sp 0\sb 1$ classes in computability theory.
Handbook of computability theory,
37--85,
Stud. Logic Found. Math., 140,
North-Holland, Amsterdam, 1999.
03D55 (03D25 03D35 03D80)
- 1694429
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Index sets in computable analysis.
(English. English summary)
Computability and complexity in analysis (Castle Dagstuhl, 1997).
Theoret. Comput. Sci. 219 (1999), no. 1-2, 111--150.
03F60
- 1673586
Cenzer, D.(1-FL); Remmel, J. B.(1-UCSD)
$\Pi\sp 0\sb 1$ classes in mathematics.
Handbook of recursive mathematics, Vol. 2,
623--821,
Stud. Logic Found. Math., 139,
North-Holland, Amsterdam, 1998.
03D45
- 1673574
Cenzer, D.(1-FL); Remmel, J. B.(1-UCSD)
Complexity-theoretic model theory and algebra.
Handbook of recursive mathematics, Vol. 1,
381--513,
Stud. Logic Found. Math., 138,
North-Holland, Amsterdam, 1998.
03C57 (03D15 03D45)
- 1638579
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Feasible graphs with standard universe.
(English. English summary)
Conference on Computability Theory (Oberwolfach, 1996).
Ann. Pure Appl. Logic 94 (1998), no. 1-3, 21--35.
03D45 (03C57 03D15 68R10)
- 1635598
Cenzer, Douglas(1-FL); Remmel, Jeffrey(1-UCSD)
Index sets for $\Pi\sp 0\sb 1$ classes.
(English. English summary)
Computability theory.
Ann. Pure Appl. Logic 93 (1998), no. 1-3, 3--61.
03D25 (03D55 03D80)
- 1635597
Computability theory.
Edited by Douglas Cenzer and Jeffrey B. Remmel.
Ann. Pure Appl. Logic 93 (1998), no. 1-3.
North-Holland Publishing Co., Amsterdam, 1998. pp. iii--iv and 1--263.
03Dxx (03-06)
- 1637471
Cenzer, D. A.(1-FL); Moser, W. R.
A good oracle is hard to beat.
(English. English summary)
Algorithmica 22 (1998), no. 1-2, 18--34.
03D25 (03D20 68Q99 68T05)
- 1492843
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Complexity and categoricity.
(English. English summary)
Inform. and Comput. 140 (1998), no. 1, 2--25.
03C57 (03D15 03D45 68Q15)
- 1449668
Cenzer, Douglas(1-FL); Remmel, Jeffrey B.(1-UCSD)
Feasibly categorical models.
(English. English summary)
Logic and computational complexity (Indianapolis, IN, 1994),
300--312,
Lecture Notes in Comput. Sci., 960,
Springer, Berlin, 1995.
03C57 (03D15 68Q15 68Q25)
- 1373118
Cenzer, Douglas(1-FL); Remmel, Jeffrey(1-UCSD)
Feasible graphs and colorings.
(English. English summary)
Math. Logic Quart. 41 (1995), no. 3, 327--352.
05C15 (03D15 05C85 68Q25)
- 1322275
Cenzer, Douglas(1-FL); Remmel, Jeffrey(1-UCSD)
Feasibly categorical abelian groups.
Feasible mathematics, II (Ithaca, NY, 1992),
91--153,
Progr. Comput. Sci. Appl. Logic, 13,
Birkhäuser Boston, Boston, MA, 1995.
03D45
- 1281151
Cenzer, Douglas(1-FL)
Effective real dynamics.
Logical methods (Ithaca, NY, 1992),
162--177,
Progr. Comput. Sci. Appl. Logic, 12,
Birkhäuser Boston, Boston, MA, 1993.
03F60 (03D80)
- 1197208
Cenzer, Douglas(1-FL); Downey, Rodney(NZ-VCTR); Jockusch, Carl(1-IL); Shore, Richard A.(1-CRNL)
Countable thin $\Pi\sp 0\sb 1$ classes.
(English. English summary)
Ann. Pure Appl. Logic 59 (1993), no. 2, 79--139.
03D30 (03D25 03D45)
- 1189721
Cenzer, Douglas(1-FL); Remmel, Jeffrey(1-UCSD)
Recursively presented games and strategies.
(English. English summary)
Math. Social Sci. 24 (1992), no. 2-3, 117--139.
03D45 (03D25 03D35 04A15 90D44)
- 1167697
Cenzer, Douglas(1-FL); Remmel, Jeffrey(1-UCSD)
Polynomial-time abelian groups.
Ann. Pure Appl. Logic 56 (1992), no. 1-3, 313--363.
03D45 (03D15 20K99)
- 1130218
Cenzer, Douglas(1-FL); Remmel, Jeffrey(1-UCSD)
Polynomial-time versus recursive models.
Ann. Pure Appl. Logic 54 (1991), no. 1, 17--58.
03C57 (03D15)
- 1011184
Cenzer, Douglas(1-FL); Smith, Rick L.(1-FL)
On the ranked points of a $\Pi\sp 0\sb 1$ set.
J. Symbolic Logic 54 (1989), no. 3, 975--991.
03E15 (03D70 03F60)
- 854290
Cenzer, Douglas(1-FL); Clote, Peter(1-BSTC); Smith, Rick L.(1-FL); Soare, Robert I.(1-CHI); Wainer, Stanley S.(4-LEED)
Members of countable $\Pi\sp 0\sb 1$ classes.
Special issue: second Southeast Asian logic conference (Bangkok, 1984).
Ann. Pure Appl. Logic 31 (1986), no. 2-3, 145--163.
03D55
- 815238
Cenzer, Douglas(1-FL)
The stability problem: new results and counterexamples.
Lett. Math. Phys. 10 (1985), no. 2-3, 155--160.
39B40 (58F08 58F11)
- 758928
Cenzer, Douglas(1-FL)
Monotone reducibility and the family of infinite sets.
J. Symbolic Logic 49 (1984), no. 3, 774--782.
03E15 (03D30 04A15)
- 741751
Cenzer, Douglas; Mauldin, R. Daniel
Borel equivalence and isomorphism of coanalytic sets.
Dissertationes Math. (Rozprawy Mat.) 228 (1984), 28 pp.
04A15 (03E15 03E45 03E60 28A05 54H05)
- 763550
Cenzer, Douglas(1-FL); Mauldin, R. Daniel(1-NTXS)
On the Borel class of the derived set operator. II.
(English. French summary)
Bull. Soc. Math. France 111 (1983), no. 4, 367--372.
54H05 (04A15)
- 717265
Cenzer, Douglas(1-FL); Mauldin, R. Daniel(1-NTXS)
Representations of well-founded preference orders.
Canad. J. Math. 35 (1983), no. 3, 496--508.
90A06 (06A99)
- 694756
Cenzer, Douglas; Mauldin, R. Daniel
On the Borel class of the derived set operator.
(English. French summary)
Bull. Soc. Math. France 110 (1982), no. 4, 357--380.
54H05 (03E15 04A15)
- 588059
Cenzer, Douglas
Nongenerable formal languages.
Fund. Inform. (4) 3 (1980), no. 1, 95--103.
03D25 (03D30 03D70 68F05)
- 594994
Cenzer, Douglas; Mauldin, R. Daniel
Inductive definability: measure and category.
Adv. in Math. 38 (1980), no. 1, 55--90.
03D70 (03E15 28A05 54H05)
- 575911
Cenzer, D.; Mauldin, R. D.
Faithful extensions of analytic sets to Borel sets.
Houston J. Math. 6 (1980), no. 1, 19--29.
54H05
- 559673
Cenzer, Douglas
The stability problem for transformations of the circle.
Proc. Roy. Soc. Edinburgh Sect. A 84 (1979), no. 3-4, 279--281.
58F10 (22A99 39B99)
- 511418
Cenzer, Douglas; Mauldin, R. Daniel
Measurable parametrizations and selections.
Trans. Amer. Math. Soc. 245 (1978), 399--408.
28A20 (04A15 54H05)
- 523406
Cenzer, Douglas; Howorka, Edward
On vertex $k$-partitions of certain infinite graphs.
Discrete Math. 23 (1978), no. 2, 105--113.
05C38 (05C40)
- 479986
Cenzer, Douglas
Parametric inductive definitions and recursive operators over the continuum.
Fund. Math. 100 (1978), no. 1, 9--15.
02F35
- 498047
Cenzer, Douglas
Non-generable RE sets.
Fundamentals of computation theory (Proc. Internat. Conf., Pozna\'n-Kórnik, 1977),
pp. 379--385. Lecture Notes in Comput. Sci., Vol. 56,
Springer, Berlin, 1977.
02F25
- 457175
Cenzer, Douglas
Inductive definitions: positive and monotone.
Set theory and hierarchy theory (Proc. Second Conf., Bierutowice, 1975),
pp. 51--63. Lecture Notes in Math., Vol. 537,
Springer, Berlin, 1976.
02F29 (02K30)
- 427054
Cenzer, Douglas
Monotone inductive definitions over the continuum.
J. Symbolic Logic 41 (1976), no. 1, 188--198.
02F27
- 429522
Cenzer, Douglas
Ordinal recursion and inductive definitions.
Generalized recursion theory (Proc. Sympos., Oslo, 1972),
pp. 221--264. Studies in Logic and the Foundations of Math., Vol. 79,
North-Holland, Amsterdam, 1974.
02F27 (02D05)
- 406782
Cenzer, Douglas
Inductively defined sets of reals.
Bull. Amer. Math. Soc. 80 (1974), 485--487.
02F29
- 392526
Cenzer, Douglas
The boundedness principle in ordinal recursion.
Collection of articles dedicated to Andrzej Mostowski on the occasion of his sixtieth birthday, III.
Fund. Math. 81 (1974), 203--212.
02F27
- 376350
Blass, Andreas; Cenzer, Douglas
Cores of $\Pi \sb{1}\sp{1}$ sets of reals.
J. Symbolic Logic 39 (1974), 649--654.
02K30 (02F35 04A15)
- 357089
Cenzer, Douglas
Analytic inductive definitions.
J. Symbolic Logic 39 (1974), 310--312.
02F27 (02F35)
Last update made
Fri Mar 21 14:00:42 EDT 2008