Preprints and Publications
-
Computability of Fraisse limits,
with B. Csima and R. Miller and V. Harizanov
Submitted for publication .
-
Linear orders with finitely many descending cuts,
with Asher M. Kach and J. Miller
submitted for publication .
-
On the n-Back-and-Forth types of Boolean Algebras,
with Kenneth Harris
Submitted for publication .
-
On Fraïssé's conjecture for linear orders of finite Hausdorff rank,
with Alberto Marcone
To appear in Annals of Pure and Applied Logic.
-
Slender classes,
with Rod Downey
To appear in Journal of the London Math. Society.
-
On the Pi-1-1 Separation Principle,
To appear in Mathematical Logic Quarterly.
-
A weakly 2-random set that is not generalized low,
with Andrew Lewis and A. Nies
To appear in Proceedings of the CiE 2007.
-
The isomorphism problem for torsion-free Abelian groups is analytic complete,
with Rod Downey
To appear in the Journal of Algebra.
-
From Automatic Structures to Borel Structures,
with G. Hjorth and B. Khoussainov and A. Nies
To appear in the Proccedings of LICS 2008.
-
Embeddings into the Turing degrees,
To appear in the Proceedings of the Logic Colloquium `06.
-
Ranked Structures and Arithmetic Transfinite Recursion,
with Noam Greenberg
Transactions of the AMS,
360
(2008),
1265-1307.
-
On the triple jump of the set of atoms of a Boolean algebra,
Proceedings of the American Mathematical Society,
136
(2008),
2589-2595.
-
Subspaces of Computable Vector Spaces,
with Downey; Hirschfeldt; Kach; Lempp and Mileti.
Journal of Algebra,
314
(2007),
888-894.
-
On the equimorphism types of linear orderings,
Bulletin of Symbolic Logic,
13
(2007),
71-99.
-
Computable linearizations of well-partial-orderings,
Order,
24
(2007),
39-48.
-
A cappable almost everywhere dominating computably enumerable
degree,
with George Barmpalias
Proceedings of the Third International Conference on Computability and Complexity in Analysis (CCA 2006),
167
(2007),
17--31 (electronic).
-
Equivalence between Fraïssé's conjecture and Jullien's theorem,
Annals of Pure and Applied Logic,
139
(2006),
1--42.
-
There is no ordering on the classes in the generalized high/low hierarchies,
Archive for Mathematical Logic,
45
(2006),
215--231.
-
Equimorphism invariants for scattered linear orderings,
Fundamenta Mathematicae,
191
(2006),
151--173.
-
Indecomposable linear orderings and Hyperarithmetic analysis,
Journal of Mathematical Logic,
6
(2006),
89-120.
-
Boolean algebras, Tarski invariants, and index sets,
with Barbara F. Csima and R. A. Shore
Notre Dame Journal of Formal Logic,
47
(2006),
1--23.
-
Countably complementable linear orderings,
Order,
23
(2006),
321--331 (2007).
-
A minimal pair of K-degrees,
with Barbara F. Csima
Proceedings of the American Mathematical Society,
134
(2006),
1499--1502.
-
Up to equimorphism, hyperarithmetic is recursive,
Journal of Symbolic Logic,
70
(2005),
360--378.
-
Teoría de Conjuntos Según Von Newman (Set theory according to von Neuman),
Publicaciones Matemáticas del Uruguay,
10
(2005),
91--110.
-
Generalized high degrees have the complementation property,
with Noam Greenberg and R. A. Shore
Journal of Symbolic Logic,
69
(2004),
1200--1220.
-
Embedding jump upper semilattices into the Turing degrees,
Journal of Symbolic Logic,
68
(2003),
989--1014.
-
Embedding and coding below a 1-generic degree,
with Noam Greenberg
Notre Dame Journal of Formal Logic,
44
(2003),
200--216.