| Publication | Date of Publication | Type |
|---|
The Turing degrees: an introduction
| 2024-09-09 | Paper |
Halin's Infinite Ray Theorems: Complexity and Reverse Mathematics: Version E
| 2023-08-27 | Paper |
ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS
Journal of Symbolic Logic | 2023-06-05 | Paper |
Theorems of hyperarithmetic analysis and almost theorems of hyperarithmetic analysis
The Bulletin of Symbolic Logic | 2022-04-04 | Paper |
Conservativity of ultrafilters over subsystems of second order arithmetic
Journal of Symbolic Logic | 2018-08-10 | Paper |
On the jumps of the degrees below a recursively enumerable degree
Notre Dame Journal of Formal Logic | 2018-03-08 | Paper |
Induction, bounding, weak combinatorial principles, and the homogeneous model theorem
Memoirs of the American Mathematical Society | 2017-10-10 | Paper |
$$\Sigma _{1}^{1}$$ in Every Real in a $$\Sigma _{1}^{1}$$ Class of Reals Is $$\Sigma _{1}^{1}$$
Computability and Complexity | 2017-04-04 | Paper |
The strength of the Grätzer-Schmidt theorem
Archive for Mathematical Logic | 2017-02-02 | Paper |
Mass problems and density
Journal of Mathematical Logic | 2017-01-10 | Paper |
The strength of Turing determinacy within second order arithmetic
Fundamenta Mathematicae | 2016-02-24 | Paper |
Reverse mathematics, countable and uncountable
| 2016-01-27 | Paper |
The limits of determinacy in second order arithmetic: consistency and complexity strength
Israel Journal of Mathematics | 2014-12-11 | Paper |
The Turing degrees below generics and randoms
The Journal of Symbolic Logic | 2014-09-30 | Paper |
The complexity of ascendant sequences in locally nilpotent groups
International Journal of Algebra and Computation | 2014-05-26 | Paper |
Low level nondefinability results: domination and recursive enumeration
The Journal of Symbolic Logic | 2014-01-07 | Paper |
Biinterpretability up to double jump in the degrees below \(\mathbf{0}'\)
Proceedings of the American Mathematical Society | 2013-11-14 | Paper |
Degrees of categoricity and the hyperarithmetic hierarchy
Notre Dame Journal of Formal Logic | 2013-04-25 | Paper |
Computably enumerable partial orders
Computability | 2013-01-30 | Paper |
Computing maximal chains
Archive for Mathematical Logic | 2012-09-18 | Paper |
The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures
Journal of Mathematical Logic | 2012-09-06 | Paper |
Domination, forcing, array nonrecursiveness and relative recursive enumerability
Journal of Symbolic Logic | 2012-04-19 | Paper |
The limits of determinacy in second-order arithmetic
Proceedings of the London Mathematical Society | 2012-02-24 | Paper |
The maximal linear extension theorem in second order arithmetic
Archive for Mathematical Logic | 2011-08-16 | Paper |
Topological aspects of the Medvedev lattice
Archive for Mathematical Logic | 2011-05-11 | Paper |
Reverse mathematics: the playground of logic
The Bulletin of Symbolic Logic | 2010-10-26 | Paper |
Lattice initial segments of the hyperdegrees
Journal of Symbolic Logic | 2010-03-15 | Paper |
The atomic model theorem and type omitting
Transactions of the American Mathematical Society | 2009-11-06 | Paper |
Rigidity and biinterpretability in the hyperdegrees
| 2008-10-20 | Paper |
DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP
Journal of Mathematical Logic | 2008-08-26 | Paper |
Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond
The Bulletin of Symbolic Logic | 2007-10-22 | Paper |
The settling-time reducibility ordering
Journal of Symbolic Logic | 2007-10-17 | Paper |
Combinatorial principles weaker than Ramsey's Theorem for pairs
Journal of Symbolic Logic | 2007-03-12 | Paper |
Degree Structures: Local and Global Investigations
The Bulletin of Symbolic Logic | 2006-12-06 | Paper |
Boolean algebras, Tarski invariants, and index sets
Notre Dame Journal of Formal Logic | 2006-10-04 | Paper |
A computably stable structure with no Scott family of finitary formulas
Archive for Mathematical Logic | 2006-09-04 | Paper |
THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES
Journal of Mathematical Logic | 2006-09-04 | Paper |
The \(\forall\exists\) theory of \({\mathcal D}(\leq,\vee,{}')\) is undecidable
| 2006-07-03 | Paper |
Invariants, Boolean algebras and ACA₀⁺
Transactions of the American Mathematical Society | 2005-12-12 | Paper |
scientific article; zbMATH DE number 2236629 (Why is no real title available?)
| 2005-12-08 | Paper |
The \(\text{low}_n\) and \(\text{low}_m\) r.e. degrees are not elementarily equivalent
Science in China. Series A | 2005-08-30 | Paper |
Generalized high degrees have the complementation property
Journal of Symbolic Logic | 2005-08-29 | Paper |
Π11 relations and paths through
Journal of Symbolic Logic | 2005-08-29 | Paper |
A computably categorical structure whose expansion by a constant has infinite computable dimension
Journal of Symbolic Logic | 2005-02-09 | Paper |
Decomposition and infima in the computably enumerable degrees
Journal of Symbolic Logic | 2005-02-09 | Paper |
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable
Transactions of the American Mathematical Society | 2004-08-13 | Paper |
Reasoning about common knowledge with infinitely many agents
Information and Computation | 2004-08-06 | Paper |
Minimal degrees which are Σ₂⁰ but not Δ₂⁰
Proceedings of the American Mathematical Society | 2003-10-29 | Paper |
scientific article; zbMATH DE number 1984268 (Why is no real title available?)
| 2003-09-22 | Paper |
Degree spectra and computable dimensions in algebraic structures
Annals of Pure and Applied Logic | 2002-08-22 | Paper |
A nonlow\(_2\) r. e. degree with the extension of embeddings properties of a low\(_2\) degree
Mathematical Logic Quarterly (MLQ) | 2002-05-15 | Paper |
Every incomplete computably enumerable truth-table degree is branching
Archive for Mathematical Logic | 2002-03-21 | Paper |
Undecidability and 1-types in intervals of the computably enumerable degrees
Annals of Pure and Applied Logic | 2001-10-23 | Paper |
A splitting theorem for \(n\)-REA degrees
Proceedings of the American Mathematical Society | 2001-10-21 | Paper |
The prospects for mathematical logic in the twenty-first century
The Bulletin of Symbolic Logic | 2001-09-10 | Paper |
scientific article; zbMATH DE number 1421079 (Why is no real title available?)
| 2000-12-03 | Paper |
scientific article; zbMATH DE number 1531934 (Why is no real title available?)
| 2000-11-19 | Paper |
scientific article; zbMATH DE number 1390016 (Why is no real title available?)
| 2000-11-07 | Paper |
Defining the Turing jump
Mathematical Research Letters | 2000-08-13 | Paper |
scientific article; zbMATH DE number 1405578 (Why is no real title available?)
| 2000-07-24 | Paper |
Computably categorical structures and expansions by constants
Journal of Symbolic Logic | 2000-01-09 | Paper |
Splitting theorems and the jump operator
Annals of Pure and Applied Logic | 1999-11-08 | Paper |
scientific article; zbMATH DE number 1222106 (Why is no real title available?)
| 1999-10-28 | Paper |
Computable isomorphisms, degree spectra of relations, and Scott families
Annals of Pure and Applied Logic | 1999-08-16 | Paper |
scientific article; zbMATH DE number 1136097 (Why is no real title available?)
| 1998-10-19 | Paper |
Conjectures and questions from Gerald Sacks's \textit{Degrees of unsolvability}
Archive for Mathematical Logic | 1998-09-09 | Paper |
Interpretability and Definability in the Recursively Enumerable Degrees
Proceedings of the London Mathematical Society | 1998-08-11 | Paper |
Computable models of theories with few models
Notre Dame Journal of Formal Logic | 1998-05-04 | Paper |
Definability in the Recursively Enumerable Degrees
The Bulletin of Symbolic Logic | 1997-11-05 | Paper |
There is no degree invariant half-jump
Proceedings of the American Mathematical Society | 1997-10-01 | Paper |
scientific article; zbMATH DE number 992300 (Why is no real title available?)
| 1997-03-17 | Paper |
Interpolating \(d\)-r.e. and REA degrees between r.e. degrees
Annals of Pure and Applied Logic | 1997-02-09 | Paper |
Jumps of Minimal Degrees Below 0 ′
Journal of the London Mathematical Society | 1996-12-12 | Paper |
Lattice embeddings below a nonlow\(_ 2\) recursively enumerable degree
Israel Journal of Mathematics | 1996-10-28 | Paper |
Degree theoretic definitions of the low2 recursively enumerable sets
Journal of Symbolic Logic | 1996-07-16 | Paper |
scientific article; zbMATH DE number 841082 (Why is no real title available?)
| 1996-06-19 | Paper |
Interpreting true arithmetic in the theory of the r.e. truth table degrees
Annals of Pure and Applied Logic | 1996-05-02 | Paper |
scientific article; zbMATH DE number 749940 (Why is no real title available?)
| 1995-08-28 | Paper |
scientific article; zbMATH DE number 789391 (Why is no real title available?)
| 1995-08-23 | Paper |
scientific article; zbMATH DE number 761273 (Why is no real title available?)
| 1995-07-03 | Paper |
Highness and bounding minimal pairs
Mathematical Logic Quarterly | 1994-08-31 | Paper |
Undecidability and 1-types in the recursively enumerable degrees
Annals of Pure and Applied Logic | 1994-06-05 | Paper |
Working below a high recursively enumerable degree
Journal of Symbolic Logic | 1994-01-19 | Paper |
The \(n\)-rea enumeration degrees are dense
Archive for Mathematical Logic | 1993-09-01 | Paper |
scientific article; zbMATH DE number 218598 (Why is no real title available?)
| 1993-06-29 | Paper |
Countable thin \(\Pi^0_1\) classes
Annals of Pure and Applied Logic | 1993-05-16 | Paper |
The theory of the recursively enumerable weak truth-table degrees is undecidable
Journal of Symbolic Logic | 1993-04-01 | Paper |
On the strength of König's duality theorem for infinite bipartite graphs
Journal of Combinatorial Theory. Series B | 1992-09-27 | Paper |
The p-T-degrees of the recursive sets: Lattice embeddings, extensions of embeddings and the two-quantifier theory
Theoretical Computer Science | 1992-09-27 | Paper |
scientific article; zbMATH DE number 15488 (Why is no real title available?)
| 1992-06-25 | Paper |
scientific article; zbMATH DE number 4204326 (Why is no real title available?)
| 1991-01-01 | Paper |
scientific article; zbMATH DE number 4170891 (Why is no real title available?)
| 1990-01-01 | Paper |
Working below a \(low_ 2\) recursively enumerable degree
Archive for Mathematical Logic | 1990-01-01 | Paper |
Undecidability and initial segments of the (r.e.) tt-degrees
Journal of Symbolic Logic | 1990-01-01 | Paper |
Defining Jump Classes in the Degrees Below 0'
Proceedings of the American Mathematical Society | 1988-01-01 | Paper |
A non-inversion theorem for the jump operator
Annals of Pure and Applied Logic | 1988-01-01 | Paper |
Initial segments of the degrees of constructibility
Israel Journal of Mathematics | 1988-01-01 | Paper |
Infima of recursively enumerable truth table degrees
Notre Dame Journal of Formal Logic | 1988-01-01 | Paper |
Decidability and Invariant Classes for Degree Structures
| 1988-01-01 | Paper |
Initial segments of the degrees of size \(\aleph _ 1\)
Israel Journal of Mathematics | 1986-01-01 | Paper |
The Degrees of Constructibility of Cohen Reals
Proceedings of the London Mathematical Society | 1986-01-01 | Paper |
scientific article; zbMATH DE number 4004171 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3954890 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3914306 (Why is no real title available?)
| 1985-01-01 | Paper |
scientific article; zbMATH DE number 3926899 (Why is no real title available?)
| 1984-01-01 | Paper |
Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
Journal of Symbolic Logic | 1984-01-01 | Paper |
An Algebraic Decomposition of the Recursively Enumerable Degrees and the Coincidence of Several Degree Classes with the Promptly Simple Degrees
| 1984-01-01 | Paper |
The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
Advances in Mathematics | 1984-01-01 | Paper |
The arithmetic and Turing degrees are not elementarily equivalent
Archiv für Mathematische Logik und Grundlagenforschung | 1984-01-01 | Paper |
Pseudo Jump Operators. I: The R. E. Case
Transactions of the American Mathematical Society | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3861135 (Why is no real title available?)
| 1982-01-01 | Paper |
Finitely Generated Codings and the Degrees R.E. in a Degree d
Proceedings of the American Mathematical Society | 1982-01-01 | Paper |
On homogeneity and definability in the first-order theory of the Turing degrees
Journal of Symbolic Logic | 1982-01-01 | Paper |
scientific article; zbMATH DE number 3743236 (Why is no real title available?)
| 1981-01-01 | Paper |
The Theory of the Degrees below 0 ′
Journal of the London Mathematical Society | 1981-01-01 | Paper |
Splitting properties and jump classes
Israel Journal of Mathematics | 1981-01-01 | Paper |
Definable degrees and automorphisms of 𝒟
Bulletin of the American Mathematical Society | 1981-01-01 | Paper |
L ∗ (K) and Other Lattices of Recursively Enumerable Sets
Proceedings of the American Mathematical Society | 1980-01-01 | Paper |
scientific article; zbMATH DE number 3720899 (Why is no real title available?)
| 1980-01-01 | Paper |
scientific article; zbMATH DE number 3728252 (Why is no real title available?)
| 1980-01-01 | Paper |
Reducibility orderings: Theories, definability and automorphisms
Annals of Mathematical Logic | 1980-01-01 | Paper |
The homogeneity conjecture
Proceedings of the National Academy of Sciences | 1979-01-01 | Paper |
Some More Minimal Pairs of α‐Recursively Enumerable Degrees
Mathematical Logic Quarterly | 1978-01-01 | Paper |
Controlling the dependence degree of a recursively enumerable vector space
Journal of Symbolic Logic | 1978-01-01 | Paper |
Nowhere simple sets and the lattice of recursively enumerable sets
Journal of Symbolic Logic | 1978-01-01 | Paper |
\(r\)-maximal major subsets
Israel Journal of Mathematics | 1978-01-01 | Paper |
Determining Automorphisms of the Recursively Enumerable Sets
| 1977-01-01 | Paper |
The recursively enumerable α-degrees are dense
Annals of Mathematical Logic | 1976-01-01 | Paper |
Types of simple α-recursively enumerable sets
Journal of Symbolic Logic | 1976-01-01 | Paper |
On the Jump of an α-Recursively Enumerable Set
Transactions of the American Mathematical Society | 1976-01-01 | Paper |
Splitting an α-Recursively Enumerable Set
Transactions of the American Mathematical Society | 1975-01-01 | Paper |
The irregular and non-hyperregular \(\alpha\)-r.e. degrees
Israel Journal of Mathematics | 1975-01-01 | Paper |
Cohesive Sets: Countable and Uncountable
| 1974-01-01 | Paper |
Square bracket partition relations in L
Fundamenta Mathematicae | 1974-01-01 | Paper |
Σn sets which are Δn-incomparable (uniformly)
Journal of Symbolic Logic | 1974-01-01 | Paper |
Weak compactness and square bracket partition relations
Journal of Symbolic Logic | 1973-01-01 | Paper |
Minimal α-degrees
Annals of Mathematical Logic | 1972-01-01 | Paper |
On large cardinals and partition relations
Journal of Symbolic Logic | 1971-01-01 | Paper |
