- RELATIVIZING CHAITIN'S HALTING PROBABILITY ROD DOWNEY, DENIS R. HIRSCHFELDT, JOSEPH S. MILLER, AND ANDRE NIES
- An uncountably categorical theory whose only computably presentable model is saturated
- Trivial Reals Rod G. Downey
- Degree Spectra and Computable Dimensions in Algebraic Structures
- 1 CLASSES AND STRONG DEGREE SPECTRA OF JOHN CHISHOLM, JENNIFER CHUBB, VALENTINA S. HARIZANOV,
- Prime Models of Theories of Computable Linear Orderings
- Degree Spectra of Intrinsically C.E. Relations Denis R. Hirschfeldt
- EVERY 1-GENERIC COMPUTES A PROPERLY 1-GENERIC BARBARA F. CSIMA, ROD DOWNEY, NOAM GREENBERG, DENIS R. HIRSCHFELDT,
- RELATIVIZING CHAITIN'S HALTING PROBABILITY ROD DOWNEY, DENIS R. HIRSCHFELDT, JOSEPH S. MILLER, AND ANDR
- Realizing Levels of the Hyperarithmetic Hierarchy as Degree Spectra of Relations on
- Uniformity in Computable Structure Theory Rod G. Downey 1
- THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO
- A Computably Categorical Structure Whose Expansion by a Constant Has Infinite
- Trivial Reals Rod G. Downey y
- LIMIT COMPUTABILITY AND CONSTRUCTIVE MEASURE DENIS R. HIRSCHFELDT AND SEBASTIAAN A. TERWIJN
- Randomness and Reducibility ? Rod G. Downey 1 , Denis R. Hirschfeldt 2 , and Geo LaForte 3
- A Computably Categorical Structure Whose Expansion by a Constant Has In nite
- Bounding Prime Models Barbara F. Csima, Denis R. Hirschfeldt,
- Undecidability of the structure of the Solovay degrees of c.e. reals
- Bounding Homogeneous Models Barbara F. Csima 1
- Computable Trees, Prime Models, and Relative Decidability
- Undecidability and 1-types in Intervals of the Computably Enumerable Degrees
- COMPUTABILITY-THEORETIC AND PROOF-THEORETIC ASPECTS OF PARTIAL AND LINEAR ORDERINGS
- SUBSPACES OF COMPUTABLE VECTOR SPACES RODNEY G. DOWNEY, DENIS R. HIRSCHFELDT, ASHER M. KACH,
- CALIBRATING RANDOMNESS ROD DOWNEY, DENIS R. HIRSCHFELDT, ANDRE NIES,
- Combinatorial Principles Weaker than Ramsey's Theorem for Pairs
- CHARACTERIZING THE STRONGLY JUMP-TRACEABLE SETS VIA RANDOMNESS
- Counting the changes of random 0 Santiago Figueira1
- Degree Spectra of Relations on Computable Structures Denis R. Hirschfeldt
- 2 Set with No In nite Low Subset in Either It or Its Complement
- The Atomic Model Theorem and Type Omitting Denis R. Hirschfeldt
- Bounding Prime Models Barbara F. Csima, Denis R. Hirschfeldt,
- Using random sets as oracles Denis R. Hirschfeldt
- Degree Spectra of Relations on Computable Structures in the Presence of 0
- Reverse Mathematics of the Nielsen-Schreier Theorem Rodney G. Downey
- Order-Computable Sets Denis Hirschfeldt , Russell Miller y , & Sergei Podzorov z
- EVERY 1-GENERIC COMPUTES A PROPERLY 1-GENERIC BARBARA F. CSIMA, ROD DOWNEY, NOAM GREENBERG, DENIS R. HIRSCHFELDT,
- Randomness, Computability, and Density Rod G. Downey1
- Bounding Homogeneous Models Barbara F. Csima1
- Randomness and Reducibility Rod G. Downey1
- An uncountably categorical theory whose only computably presentable model is saturated
- Degree Spectra of Relations on Structures of Finite Computable Dimension
- Degree Spectra and Computable Dimensions in Algebraic Structures
- LIMIT COMPUTABILITY AND CONSTRUCTIVE MEASURE DENIS R. HIRSCHFELDT AND SEBASTIAAN A. TERWIJN
- Reverse Mathematics of the Nielsen-Schreier Theorem Rodney G. Downey
- Combinatorial Principles Weaker than Ramsey's Theorem for Pairs
- THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO
- 1 CLASSES AND STRONG DEGREE SPECTRA OF JOHN CHISHOLM, JENNIFER CHUBB, VALENTINA S. HARIZANOV,
- Using random sets as oracles Denis R. Hirschfeldt
- SUBSPACES OF COMPUTABLE VECTOR SPACES RODNEY G. DOWNEY, DENIS R. HIRSCHFELDT, ASHER M. KACH,
- DEGREE SPECTRA OF RELATIONS ON COMPUTABLE STRUCTURES
- Order-Computable Sets Denis Hirschfeldt
- Computable Trees, Prime Models, and Relative Decidability
- Degree Spectra of Relations on Structures of Finite Computable Dimension
- 0 A 2 Set with No Infinite Low Subset in
- LIMIT COMPUTABILITY AND CONSTRUCTIVE MEASURE DENIS R. HIRSCHFELDT AND SEBASTIAAN A. TERWIJN
- Degree Spectra of Relations on Boolean Algebras Rod G. Downey1
- Randomness, Computability, and Density Rod G. Downey1
- CALIBRATING RANDOMNESS ROD DOWNEY, DENIS R. HIRSCHFELDT, ANDR'E NIES,
- RELATIVIZING CHAITIN'S HALTING PROBABILITY ROD DOWNEY, DENIS R. HIRSCHFELDT, JOSEPH S. MILLER, AND ANDR'E NIES
- Order-Computable Sets Denis Hirschfeldt*, Russell Millery, & Sergei Podzorovz
- Bounding Homogeneous Models Barbara F. Csima1
- DEGREE SPECTRA OF RELATIONS ON COMPUTABLE STRUCTURES
- Randomness and Reducibility? Rod G. Downey1, Denis R. Hirschfeldt2, and Geoff LaForte3
- Denis Roman Hirschfeldt Department of Mathematics
- Degree Spectra of Relations on Computable Structures Denis R. Hirschfeldt
- The Atomic Model Theorem and Type Omitting Denis R. Hirschfeldt Richard A. Shore
- An uncountably categorical theory whose only computably presentable model is saturated
- Undecidability and 1-types in Intervals of the Computably Enumerable Degrees
- Degree Spectra of Relations on Boolean Algebras Rod G. Downey 1
- THE STRENGTH OF SOME COMBINATORIAL PRINCIPLES RELATED TO
- The Atomic Model Theorem and Type Omitting Denis R. Hirschfeldt
- Combinatorial Principles Weaker than Ramsey's Theorem for Pairs
- CALIBRATING RANDOMNESS ROD DOWNEY, DENIS R. HIRSCHFELDT, ANDR
- Randomness, Computability, and Density Rod G. Downey 1
- Degree Spectra of Intrinsically C.E. Relations Denis R. Hirschfeldt
- 01CLASSES AND STRONG DEGREE SPECTRA OF RELATIONS
- Degree Spectra of Relations on Computable 0
- EVERY 1-GENERIC COMPUTES A PROPERLY 1-GENERIC BARBARA F. CSIMA, ROD DOWNEY, NOAM GREENBERG, DENIS R. HIRSCHFELDT,
- Uniformity in Computable Structure Theory Rod G. Downey1
- Bounding Prime Models Barbara F. Csima, Denis R. Hirschfeldt,
- Undecidability of the structure of the Solovay degrees of c.e. reals
- COMPUTABILITY-THEORETIC AND PROOF-THEORETIC ASPECTS OF PARTIAL AND LINEAR ORDERINGS
- Computable Trees, Prime Models, and Relative Decidability
- Using random sets as oracles Denis R. Hirschfeldt* Andr'e Niesy
- A Computably Categorical Structure Whose Expansion by a Constant Has Infinite
- Trivial Reals Rod G. Downeyy Denis R. Hirschfeldtz
- SUBSPACES OF COMPUTABLE VECTOR SPACES RODNEY G. DOWNEY, DENIS R. HIRSCHFELDT, ASHER M. KACH,
- Prime Models of Theories of Computable Linear Orderings
- Degree Spectra and Computable Dimensions in Algebraic Structures
- Degree Spectra of Relations on Boolean Algebras Rod G. Downey1
- Errata, clarifications, and updates for Algorithmic Randomness and Complexity,
- Categoricity Properties for Computable Algebraic Fields
- LOWNESS FOR INFORMATION DENIS R. HIRSCHFELDT AND REBECCA WEBER
- ON FINITELY PRESENTED EXPANSIONS OF COMPUTABLY ENUMERABLE SEMIGROUPS
- Notes, Lecture 14 Mathematical Logic II
- Notes, Lecture 5 Mathematical Logic II
- Notes, Lecture 7 Mathematical Logic II
- Notes, Lecture 11 Mathematical Logic II
- Notes, Lecture 9 Mathematical Logic II
- Notes, Lecture 15 Mathematical Logic II
- Notes, Lecture 13 Mathematical Logic II
- Notes, Lecture 8 Mathematical Logic II
- Notes, Lecture 12 Mathematical Logic II
- Notes, Lecture 1 Mathematical Logic II
- Notes, Lecture 2 Mathematical Logic II
- Notes, Lecture 16 Mathematical Logic II
- Notes, Lecture 6 Mathematical Logic II
- Mathematical Logic for Mathematicians Joseph R. Mileti
- Notes, Lecture 10 Mathematical Logic II
- Notes, Lecture 3 Mathematical Logic II
- Notes, Lecture 4 Mathematical Logic II
