97. A connection between the Cantor-Bendixson derivative and the
well-founded semantics of logic programs (with Jeffrey B. Remmel)
Annals of Mathematics and Artificial Intelligence, to appear
ABSTRACT
and
ARTICLE
96. (with A. Dashti, F. Toska and S. Wyman)
Computability of countable
subshifts in one dimension
Theory of Computing Systems, to appear
ABSTRACT
and
ARTICLE
95. (with Paul Brodhead, F. Toska and S. Wyman)
Effective capacity and randomness of closed
sets
Logical Methods in Computer
Science 6 (2011), 1-16.
ABSTRACT
and
ARTICLE
94. (with V. Harizanov and J.B. Remmel) $\Sigma^0_1$ and $\Pi^0_1$
structures
Annals of Pure and Applied Logic 162 (2011), 490-503.
ABSTRACT
and
ARTICLE
93. (with V. Harizanov and J.B. Remmel) Effective categoricity of
injection structures
Models of Computation in Context (CiE 2011), eds. B. Loewe,
D. Normann, I. Soskov and A. Soskova, Springer Lecture Notes
in Computer Science Vol. 6735 (2011), 51-60.
ABSTRACT
and
ARTICLE
92. (with J. Franklin, Jiang Lu and Guohua Wu)
A superhigh diamond in the c.e.\ $tt$-degrees
Arch. Math. Logic 50 (2011), 33-44.
ABSTRACT
and
ARTICLE
91. Computability of countable subshifts (with S. Ali Dashti, Ferit
Toska, and Sebastian Wyman)
Programs, Proofs and Processes (CIE 2010)
eds. F. Ferreira et al., Springer Lecture Notes in Computer Science
6158 (2010) 88-97.
ABSTRACT
and
ARTICLE
90. (with Paul Brodhead) Effective capacity and randomness of closed
sets
Computability and Complexity in Analysis (CCA 2010), eds. X. Zheng and N. Zhong,
Electronic Proceedings in Theoretical Computer Science (2010), 65-74.
ABSTRACT
and
ARTICLE
89. (with V. Harizanov and J.B. Remmel) $\Sigma^0_1$ and $\Pi^0_1$
equivalence structures
Mathematical Theory and Computational Practice (CIE 2009), eds. K. Ambos-Spies,
B. Loewe and W. Merkle, Springer Lecture Notes in Computer Science 5635 (2009), 99-108.
ABSTRACT
and
ARTICLE
88. (with R. Weber and G. Wu) Immunity of closed sets
Mathematical Theory and Computational Practice (CIE 2009), eds. K. Ambos-Spies,
B. Loewe and W. Merkle, Springer Lecture Notes in Computer Science 5635 (2009), 109-117.
ABSTRACT
and
ARTICLE
87. (with G. LaForte and G. Wu) The nonisolating degrees are nowhere
dense
Annals of Pure and Applied Logic, to appear.
ABSTRACT
and
ARTICLE
86. (with J. Franklin, Jiang Lu and Guohua Wu)
Embedding the diamond lattice in the c.e. tt-degrees with superhigh atoms
Theory and Applications of Models of Computation (TAMC 2009),
eds. J. Chen and S.B. Cooper,
Springer Lecture Notes in Computer Science 5532 (2009), 420-429.
ABSTRACT
and
ARTICLE
85. Equivalence Structures and Isomorphisms in the Difference Hierarchy
(with G. LaForte and J.B. Remmel)
Journal of Symbolic Logic 74 (2009), 535-556.
ABSTRACT
and
ARTICLE
84. Effective Categoricity of Abelian p-Groups
(with W. Calvert, V. Harizanov and A. Morozov)
Annals of Pure and Applied Logic 159 (2009), 187-197.
ABSTRACT
and
ARTICLE
83. Special Year in Logic--Model Theory and Computable Model Theory
(edited with Valentina Harizanov, David Marker and Carol Wood)
Archive for Mathematical Logic 48 (2009), 1-6.
82. Space Complexity of Abelian Groups (with R. Downey, J.B. Remmel
and Z. Uddin)
Archive for Math. Logic 48 (2009), 63-76.
ABSTRACT
and
ARTICLE
81. Pi-0-1 classes and pseudojump operators (with G. Laforte and G. Wu)
J. Logic and Computation 19 (2009), 77-87.
ABSTRACT
and
ARTICLE
80. $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.
ABSTRACT
and
ARTICLE
79. Linear orders with distinguished function symbol
(with B. Csima and B. Khoussainov), Archive for Mathematical Logic 48
(2009), 115-140.
ABSTRACT
and
ARTICLE
78. Computable symbolic dynamics (with S. Ali Dashti and J.L.F. King)
Mathematical Logic Quarterly 54 (2008), 524-533.
ABSTRACT
and
ARTICLE
77. Special Year in Logic--Computability and Complexity in Analysis
(edited with Rebecca Weber),
Archive for Mathematical Logic 45 (2008), 529-531.
ARTICLE
76. Degrees of difficulty of generalized r.e. separating classes
(with Peter Hinman),
Archive for Mathematical Logic 45 (2008), 629-647.
ABSTRACT
and
ARTICLE
75. Effectively closed sets and enumerations (with Paul Brodhead)
Archive for Mathematical Logic 45 (2008), 565-582.
ABSTRACT
and
ARTICLE
74. A connection between Cantor-Bendixson derivatives and the
well-founded semantics of logic programs (with Jeffrey B. Remmel)
ISAIM 2008,
The Tenth International Symposium on Artificial Intelligence and
Mathematics (Fort Lauderdale, 2008), 8 pages.
URL
ABSTRACT
and
ARTICLE
73. Algorithmic Randomness of Continuous Functions
(with G. Barmpalias, P. Brodhead, J.B. Remmel and R. Weber)
Archive for Mathematical Logic 45 (2008), 533-546.
ABSTRACT
and
ARTICLE
72. Effective symbolic dynamics (with S. Ali Dashti and J.L.F. King)
CCA 2007, Fourth International Conference on Computability
and Complexity in Analysis, Information Berichte, Universitat Hagen
(2007), 79-89.
and Springer Electronic Lecture Notes in Computer Science 202 2008, 89-99.
ABSTRACT
and
ARTICLE
71. $K$-trivial closed sets and continuous functions
(with G. Barmpalias, J. Remmel and R. Weber)
CIE 2007, Computation and Logic in the Real World, Third Conference on
Computability in Europe, Siena, Italy, June 2007,
S.B. Cooper, B. Loewe and A. Sorbi (Eds.),
Springer Lecture Notes in Computer Science 4497 (2007), 135-145.
ABSTRACT
and
ARTICLE
70. Pseudojump operators and Pi-0-1 classes
(with G. Laforte and G. Wu)
CIE 2007, Computation and Logic in the Real World, Third Conference on
Computability in Europe, Siena, Italy, June 2007,
S.B. Cooper, B. Loewe and A. Sorbi (Eds.),
Springer Lecture Notes in Computer Science 4497 (2007), 146-151.
ABSTRACT
and
ARTICLE
69. 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.
ABSTRACT
and
ARTICLE
68. Medvedev degrees of generalized r.e. separating classes
(with Peter Hinman)
Proc. 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.
ABSTRACT
and
ARTICLE
67. Random continuous functions
(with Paul Brodhead and Jeffrey Remmel)
Proc. 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), 76-89, and
Springer Electronic Notes in Computer Science 167 (2007).
PDF FILE
66. Proceedings CCA 2006, Third International Conference on Computability
and Complexity in Analysis,
(edited with R. Dillhage, T. Grubb and Klaus Weihrauch)
Information Berichte FernUniversit\"{a}t Hagen (2006),
and
Springer Electronic Notes in Computer Science 167 (2007).
PDF FILE
65. Random Closed Sets (with P. Brodhead and Ali S. Dashti)
Proc. CIE 2006,
A. Beckmann, U. Berger, B. Loewe, and J.Tucker (eds.):
Logical Approaches to Computational Barriers, Proc. CIE 2006,
Springer Lecture Notes in Computer Science, Vol. 3988 (2006), 55-64.
PDF FILE
64. Space complexity of structures
(with Zia Uddin)
Proc. CIE 2006,
A. Beckmann, U. Berger, B. Loewe, and J.Tucker (eds.):
Logical Approaches to Computational Barriers, Proc. CIE 2006,
Springer Lecture Notes in Computer Science, Vol. 3988 (2006), 76-85.
to appear.
PDF FILE
63. On the complexity of inductive definitions (with J. Remmel)
Mathematical Structures in Computer Science 16 (2006), 763-788.
PDF FILE
62. Decidability, completeness and complexity (with J. Remmel)
Journal of Symbolic Logic 71 (2006), 399-424.
PDF FILE
61. $\Delta^0_2$-categoricity of Equivalence Structures
(with W. Calvert, V. Harizanov and A. Morozov)
Annals of Pure and Applied Logic, 141 (2006), 61-78.
PDF FILE
60. The complexity of inductive definability,
(with J.Remmel)
``New Computational Paradigms, CiE 2005'', edited by S. Cooper,
B. Lowe and L. Torenvliet,
Springer Lecture Notes in Computer Science, vol. 3526 (2005), 75--85.
PDF FILE
59. Logic programming with infinite sets,
(with W. Marek and J. Remmel)
Annals of Artificial Intelligence and Mathematics 44 (2005), 309--339.
PDF FILE
58. Minimal Extensions of Pi-0-1 Classes,
(with F. Riazati)
Mathematical Logic Quarterly 51 (2005), 206-216.
PDF FILE
57. 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.
POSTCRIPT FILE
56. Index sets for computable differential equations,
(with J. Remmel)
Mathematical Logic Quarterly 50 (2004), 329-344.
POSTCRIPT FILE
55. Using logic programs to reason about
infinite sets, 8th International Symposium on
Artificial Intelligence and Mathematics (with W. Marek and J. Remmel)
8th International Symposium on Artificial Intelligence and
Mathematics, Fort Lauderdale, January 2004.
PDF FILE
54. Locally determined logic programs and recursive stable models
(with J. Remmel and A. Vanderbilt)
Annals of Mathematics and Artificial Intelligence 40 (2004), 225-262.
POSTCRIPT FILE
53. Global properties of the lattice of Pi-0-1 classes
(with A. Nies)
Proceedings American Mathematical Society 132 (2004), 239-249.
POSTCRIPT FILE
52. Index sets for computable real functions,
(with J. Remmel)
Proceedings of CCA03, Cincinnati, July 2003.
POSTCRIPT FILE
51. The Medvedev Lattice of $\Pi^0_1$ classes
(with P. Hinman)
Archive for Mathematical Logic 42 (2003), 583-600.
POSTCRIPT FILE
50. Index sets for $\omega$-languages
(with J. Remmel)
Mathematical Logic Quarterly 49 (2003), pp. 22--33 (2003).
POSTCRIPT FILE
49. Effectively closed sets and graphs of computable real functions
(with J. Remmel)
Theoretical Computer Science 284 (2002), 279--318.
POSTCRIPT FILE
48. Common Derivations in Locally Determined Logic Programs
(with A. Vanderbilt)
Artificial Intelligence and Mathematics conference paper, Fort
Lauderdale, January 2002, 10 pages.
POSTCRIPT FILE
47. Initial segments of the lattice of Pi-0-1 Classes (with A. Nies)
Journal of Symbolic Logic 66 (2001), 749--765.
POSTCRIPT FILE
46. Pi-0-1 Classes -- Structure and Applications (with C. Jockusch)
Contemporary Mathematics (Proc. 1999 AMS Summer Institute on
Computability Theory and Applications, Amer. Math. Soc. (2000)
POSTCRIPT FILE
45. The complexity of the set of the extensions of nonmonotonic rule systems
(with J. Remmel and A. Vanderbilt)
Artificial Intelligence and Mathematics conference paper, Fort
Lauderdale, January 2000, 10 pages.
POSTCRIPT FILE
44. Locally Determined Logic Programs (with J. Remmel and A. Vanderbilt)
Logic Programming and Nonmonotonic Reasoning, El Paso,
December 1999, eds. M. Gelfond, N. Leone and G. Pfeifer, Springer
Lectures Notes in Artificial Intelligence, vol. 1730 (1999), 34-48.
POSTSCRIPT FILE
43. Polynomial time versus computable Boolean algebras (with J. Remmel)
Recursion Theory and Complexity (Proc. 1997 Kazan
Workshop) eds. M. Arslanov and S. Lempp, de Gruyter (1999), 15-53.
POSTCRIPT FILE
42. Pi-0-1 Classes in Computability Theory
Handbook of Computability (ed. E. Griffor), North-Holland Studies in Logic 140
(1999), 37-85.
POSTCRIPT FILE
41. Index Sets for Finite Predicate Logic Programs (with V. Marek
and J. Remmel)
FLOC '99 Workshop on Complexity-theoretic and
Recursion-theoretic methods in Databases, Artificial Intelligence and
Finite Model Theory, eds. T. Eiter and G. Gottlob (1999), 72-80.
POSTCRIPT FILE
40. Index Sets in Computable Analysis (with J. Remmel)
Theoretical Computer Science, vol. 219
(Special Issue for 1997 Dagstuhl meeting on
Computability and Complexity in Analysis), (1999), pp. 111-150.
POSTCRIPT FILE
39. Feasible graphs with standard universe (with J. Remmel)
Annals of Pure and Applied Logic, vol. 94
(Proceedings Recursion Theory Week, Oberwolfach 1996), (1998), pp. 21-35.
POSTCRIPT FILE
38. Index sets for Pi-0-1 classes (with J. Remmel)
Annals of Pure and Applied Logic, vol. 93 (1998), pp. 3-61.
POSTCRIPT FILE
37. Pi-0-1 Classes in Mathematics (with J. Remmel)
Handbook of Recursive Mathematics, Vol. 2 (eds. Y. Ersov, S. Goncharov,
W. Marek, A. Nerode, J. Remmel), North-Holland Studies in Logic, vol.
139 (1998), pp. 623-821.
POSTCRIPT FILE
36. Complexity theoretic model theory and algebra (with J. Remmel)
Handbook of Recursive Mathematics, Vol. 1 (eds. Y. Ersov, S. Goncharov,
W. Marek, A. Nerode, J. Remmel), North-Holland Studies in Logic,
vol. 138 (1998), pp. 381--513.
POSTCRIPT FILE
35. Computability Theory, Proceedings 1996 Orlando AMS Special Session
(with J. Remmel)
Annals of Pure and Applied Logic, vol. 93 (1998) (Guest Editor).
HTML FILE
34. A Good Oracle is Hard to Beat (with W. Moser)
Algorithmica, vol. 22 (1998), pp. 18-34.
POSTSCRIPT FILE
33. Complexity and Categoricity (with J. Remmel)
Information and Computation, vol. 140(1) (1998), 2-25.
POSTSCRIPT FILE
32. Feasibly categorical Abelian groups (with J. Remmel)
Feasible Mathematics II, Proceedings 1992 Cornell
Workshop (eds. P. Clote and J. Remmel), Birkhauser (1995), 91-153.
POSTSCRIPT FILE
31. Feasibly Categorical Models (with J. Remmel)
Logic and Computer Science (Proc. 1994 Indianapolis conference on
Logic and Computational Complexity, LCC '94), Springer-Verlag Lecture
Notes in Computer Science, vol. 960 (1995) 300-312.
POSTSCRIPT FILE
30. Inductive inference of functions on the rationals (with W. Moser)
COLT '95 (Proceedings 8th Annual Conference on Computational Learning
Theory, Santa Cruz), ACM (1995) 178-181.
29. Feasible graphs and colorings (with J. Remmel)
Mathematical Logic Quarterly, vol. 41 (1995), 327-352.
POSTSCRIPT FILE
28. Countable thin Pi-0-1 classes (with R. Downey, C. Jockusch, R. Shore)
Annals of Pure and Applied Logic, vol. 59 (1993), 79-139.
POSTSCRIPT FILE
27. Effective Dynamics
Logical Methods (in honor of A. Nerode), eds. J. Crossley, J. Remmel,
R. Shore, M. Sweedler, Birkhauser (1993), 162-177.
POSTSCRIPT FILE
26. Polynomial-time Abelian groups
(with J. Remmel)
Annals of Pure and Applied Logic, vol. 56 (1992), 313-363.
POSTSCRIPT FILE
25. Recursively presented games and strategies (with J. Remmel)
Mathematical Social Sciences, vol. 24 (1992), 117-139.
POSTSCRIPT FILE
24. Polynomial-time versus recursive models (with J. Remmel)
Annals of Pure and Applied Logic, vol. 54 (1991), 17-58.
POSTSCRIPT FILE
23. On the ranked points of a Pi-0-1 set (with R.L. Smith)
Journal of Symbolic Logic, vol. 54 (1989), 975-991.
22. Members of countable Pi-0-1 classes (with P. Clote, R. Smith,
R. Soare, S. Wainer)
Annals of Pure and Applied Logic, vol. 31 (1986), 145-163.
21. The stability problem, new results and counterexamples
Letters in Mathematical Physics, vol. 10 1985), 155-160.
20. Borel equivalence and isomorphism of coanalytic sets (with R.D. Mauldin)
Dissertationes Mathematicae, vol. 228 (1984), 1-32
19. Monotone reducibility and the family of finite sets
Journal of Symbolic Logic, vol. 49 (1984), 774-782.
18. On the Borel class of the derived set operator, II (with R.D. Mauldin)
Bull. Soc. Math. de France, vol. 111 (1983), 367-372.
17. Representations of well-founded preference orders (with R.D. Mauldin)
Canadian Journal of Mathematics, vol. 35 (1983), 496-508.
16. The Borel class of the derived set operator (with R.D. Mauldin)
Bulletin Societe Mathematiques de France, vol. 110 (1982), 357-380.
15. Faithful extensions of analytic sets to Borel sets (with R.D. Mauldin)
Houston Journal of Mathematics, vol. 6 (1980), 19-29.
14. Non-generable formal languages
Fundamenta Informaticae, vol. 3 (1980), 95-104.
13. Inductive definability, measure and category (with R.D. Mauldin)
Advances in Mathematics, vol. 38 (1980), 55-90.
12. The stability problem for transformations of the circle
Proceedings Royal Society of Edinburgh, vol. 84A (1979), 279-281.
11. Parametrized inductive definitions and recursive inductive
operators over the continuum
Fundamenta Mathematica, vol. 100 (1978), 10-15.
10. Measurable parametrizations and selections (with R.D. Mauldin)
Transactions American Mathematical Society, vol. 245 (1978), 399-408.
9. On vertex k-partitions of certain infinite graphs (with E. Howorka)
Discrete Mathematics, vol. 23 (1978), 105-113
8. Non-generable r.e. sets
Fundamentals of Computation Theory (Proc. 1977 Posnan Conference), Springer
Lecture Notes in Computer Science, vol. 56 (1977), 379-385.
7. Inductive definitions, positive and monotone
Set Theory and Hierarchy Theory (Proc. 1975 Bierutowice Conference)
Springer Lecture Notes in Mathematics, vol. 537 (1976), 51-63
6. Monotone inductive definitions over the continuum
Journal of Symbolic Logic, vol. 41 (1976), 188-198.
5. Analytic inductive definitions
Journal of Symbolic Logic, vol. 39 (1974), 310-312
4. Inductively defined sets of reals
Bulletin American Mathematical Society, vol. 80 (1974), 485-487
3. Cores of Pi-1-1 sets of reals (with A. Blass)
Journal of Symbolic Logic, vol. 39 (1974), 649-654.
2. The boundedness principle in ordinal recursion
Fundamenta Mathematica , vol. 71 (1974), 203-212.
1. Ordinal recursion and inductive definitions
Generalized Recursion Theory (Proc. 1972 Oslo Conference),
eds. J. Fenstad and P. Hinman, North-Holland (1974), 221-264.
Last updated on January 30, 2005