- CHARACTERIZING THE STRONGLY JUMP-TRACEABLE SETS VIA RANDOMNESS
- RANKED STRUCTURES AND ARITHMETIC TRANSFINITE NOAM GREENBERG AND ANTONIO MONTALBAN
- PROMPT SIMPLICITY, ARRAY COMPUTABILITY AND ROD DOWNEY, NOAM GREENBERG, JOSEPH S. MILLER, AND REBECCA WEBER
- WORKING WITH STRONG REDUCIBILITIES ABOVE TOTALLY -C.E. AND ARRAY COMPUTABLE DEGREES
- UNIFORM ALMOST EVERYWHERE DOMINATION PETER CHOLAK, NOAM GREENBERG, AND JOSEPH S. MILLER
- December 26, 2005 MODELS OF REAL-VALUED MEASURABILITY
- TOTALLY -COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
- -computably enumerable degrees and m-topped degrees
- October 10, 2007 STRONG JUMP-TRACEABILITY I : THE COMPUTABLY
- THE UPWARD CLOSURE OF A PERFECT THIN CLASS ROD DOWNEY, NOAM GREENBERG, AND JOSEPH S. MILLER
- TURING DEGREES OF REALS OF POSITIVE EFFECTIVE PACKING DIMENSION
- K-TRIVIAL DEGREES AND THE JUMP-TRACEABILITY GEORGE BARMPALIAS, ROD DOWNEY, AND NOAM GREENBERG
- LOWNESS FOR KURTZ RANDOMNESS NOAM GREENBERG AND JOSEPH S. MILLER
- BENIGN COST FUNCTIONS AND LOWNESS PROPERTIES NOAM GREENBERG AND ANDRE NIES
- COMPUTABLE STRUCTURE THEORY USING ADMISSIBLE RECURSION THEORY ON 1
- ANTI-COMPLEX SETS AND REDUCIBILITIES WITH TINY USE
- The role of true finiteness in the admissible recursively enumerable degrees
- LOWNESS FOR COMPUTABLE MACHINES ROD DOWNEY, NOAM GREENBERG, NENAD MIHAILOVIC, AND ANDRE NIES
- THE ROLE OF TRUE FINITENESS IN THE ADMISSIBLE RECURSIVELY ENUMERABLE DEGREES
- January 14, 2011 DIAGONALLY NON-RECURSIVE FUNCTIONS AND
- EXTENSIONS OF EMBEDDINGS BELOW COMPUTABLY ENUMERABLE DEGREES
- BINARY SUBTREES WITH FEW LABELED PATHS RODNEY G. DOWNEY, NOAM GREENBERG, CARL G. JOCKUSCH, JR.,
- The Journal of Symbolic Logic Volume 00, Number 0, XXX 0000
- January 14, 2011 STRONG JUMP-TRACEABILITY II : K-TRIVIALITY
- STRONG JUMP TRACEABILITY AND DEMUTH NOAM GREENBERG AND DANIEL D. TURETSKY
- A RANDOM SET WHICH ONLY COMPUTES STRONGLY JUMP-TRACEABLE C.E. SETS
- K-TRIVIALS ARE NEVER CONTINUOUSLY RANDOM GEORGE BARMPALIAS, NOAM GREENBERG, ANTONIO MONTALBAN,
- THE THEORY OF THE METARECURSIVELY ENUMERABLE NOAM GREENBERG, RICHARD A. SHORE, AND THEODORE A. SLAMAN
- EVERY 1-GENERIC COMPUTES A PROPERLY 1-GENERIC BARBARA F. CSIMA, ROD DOWNEY, NOAM GREENBERG, DENIS R. HIRSCHFELDT,
- Notre Dame Journal of Formal Logic Embedding and Coding Below a 1-Generic Degree
- MARTIN-LOF RANDOM POINTS SATISFY BIRKHOFF'S ERGODIC THEOREM FOR EFFECTIVELY CLOSED SETS
- GALVIN'S "RACING PAWNS" GAME, INTERNAL HYPERARITHMETIC COMPREHENSION, AND THE LAW OF
- RELATIVE TO ANY NON-HYPERARITHMETIC SET NOAM GREENBERG, ANTONIO MONTALBAN, AND THEODORE A. SLAMAN
- October 25, 2011 INHERENT ENUMERABILITY OF STRONG
