| THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS | 0 | 0.34 | 2022 |
| On the Jumps of the Degrees Below a Recursively Enumerable Degree. | 0 | 0.34 | 2018 |
| Conservativity of Ultrafilters over Subsystems of second order Arithmetic. | 0 | 0.34 | 2018 |
| Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. | 0 | 0.34 | 2017 |
| Mass problems and density. | 0 | 0.34 | 2016 |
| The Complexity Of Ascendant Sequences In Locally Nilpotent Groups | 0 | 0.34 | 2014 |
| Low level nondefinability results: Domination and recursive enumeration. | 0 | 0.34 | 2013 |
| Degrees of Categoricity and the Hyperarithmetic Hierarchy. | 12 | 1.16 | 2013 |
| Domination, forcing, array nonrecursiveness and relative recursive enumerability. | 3 | 0.67 | 2012 |
| Computably Enumerable Partial Orders | 0 | 0.34 | 2012 |
| Computing maximal chains | 0 | 0.34 | 2012 |
| THE n-r.e. DEGREES: UNDECIDABILITY AND Σ1 SUBSTRUCTURES | 1 | 0.39 | 2012 |
| The maximal linear extension theorem in second order arithmetic | 4 | 0.56 | 2011 |
| Topological aspects of the Medvedev lattice | 7 | 0.72 | 2011 |
| Lattice initial segments of the hyperdegrees | 0 | 0.34 | 2010 |
| Reverse mathematics: the playground of logic | 1 | 0.37 | 2010 |
| DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP | 2 | 0.56 | 2007 |
| Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond | 0 | 0.34 | 2007 |
| The settling-time reducibility ordering | 1 | 0.56 | 2007 |
| Combinatorial principles weaker than Ramsey's Theorem for pairs | 29 | 2.64 | 2007 |
| THE THEORY OF THE METARECURSIVELY ENUMERABLE DEGREES | 0 | 0.34 | 2006 |
| Boolean Algebras, Tarski Invariants, and Index Sets | 6 | 0.64 | 2006 |
| Degree Structures: Local and Global Investigations | 4 | 0.68 | 2006 |
| A computably stable structure with no Scott family of finitary formulas | 2 | 0.49 | 2006 |
| Generalized high degrees have the complementation property | 3 | 0.47 | 2004 |
| Pi11 relations and paths through | 0 | 0.34 | 2004 |
| A computably categorical structure whose expansion by a constant has infinite computable dimension | 5 | 0.56 | 2003 |
| Decomposition and infima in the computably enumerable degrees | 2 | 0.82 | 2003 |
| A nonlow2 R. E. Degree with the Extension of Embeddings Properties of a low2 Degree. | 0 | 0.34 | 2002 |
| The prospects for mathematical logic in the twenty-first century | 7 | 0.99 | 2002 |
| Degree spectra and computable dimensions in algebraic structures | 44 | 4.24 | 2002 |
| Every incomplete computably enumerable truth-table degree is branching | 0 | 0.34 | 2001 |
| Undecidability and 1-types in intervals of the computably enumerable degrees | 1 | 0.40 | 2000 |
| Computably Categorical Structures and Expansions by Constants | 15 | 2.46 | 1999 |
| Erratum to "Computable Isomorphisms, Degree Spectra of Relations, and Scott Families | 0 | 0.34 | 1999 |
| Reasoning about common knowledge with infinitely many agents | 18 | 0.64 | 1999 |
| Computable isomorphisms, degree spectra of relations, and Scott families | 13 | 2.55 | 1998 |
| Splitting theorems and the jump operator | 3 | 0.46 | 1998 |
| Conjectures and questions from Gerald Sacks's <Emphasis Type="Italic">Degrees of Unsolvability</Emphasis> | 2 | 0.58 | 1997 |
| Computable Models of Theories with Few Models | 21 | 2.52 | 1997 |
| Logic Colloquium '95, Haifa, Israel, 9-17 August 1995 - Preface | 0 | 0.34 | 1997 |
| Alonzo Church | 0 | 0.34 | 1997 |
| Definability In The Recursively Enumerable Degrees | 5 | 1.02 | 1996 |
| Interpolating d-r.e. and REA degrees between r.e. degrees | 1 | 0.38 | 1996 |
| The Bulletin of Symbolic Logic | 0 | 0.34 | 1995 |
| Interpreting true arithmetic in the theory of the r.e. truth table degrees | 2 | 0.54 | 1995 |
| Degree Theoretic Definitions of the low2 Recursively Enumerable Sets | 6 | 0.94 | 1995 |
| Countable Thin Pi01 Classes | 4 | 0.59 | 1993 |
| Working below a Highly Recursively Enumerable Degree | 1 | 0.42 | 1993 |
| Highness And Bounding Minimal Pairs | 15 | 1.75 | 1993 |
