Theodore A. Slaman

MaRDI QIDQ189917zbMATH OpenWikidataFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Extending Borel's conjecture from measure to dimension Communications of the American Mathematical Society	2026-05-08	Paper
Hausdorff dimension and countable Borel equivalence relations Proceedings of the American Mathematical Society	2026-01-20	Paper
Capacitability for Co-Analytic Sets New Zealand Journal of Mathematics	2022-08-02	Paper
IN MEMORIAM: GERALD E. SACKS, 1933–2019 The Bulletin of Symbolic Logic	2022-04-04	Paper
Effective randomness for continuous measures Journal of the American Mathematical Society	2022-03-07	Paper
Fragments of the theory of the enumeration degrees Advances in Mathematics	2021-04-23	Paper
Definable functions on degrees Ordinal Definability and Recursion Theory The Cabal Seminar Volume III	2020-03-09	Paper
Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations Ordinal Definability and Recursion Theory The Cabal Seminar Volume III	2020-03-09	Paper
Recursion theoretic papers. Introduction to Part VI Ordinal Definability and Recursion Theory The Cabal Seminar Volume III	2020-03-09	Paper
Schmerl decompositions in first order arithmetic Annals of Pure and Applied Logic	2019-10-07	Paper
The strength of Ramsey's theorem for pairs and arbitrarily many colors Journal of Symbolic Logic	2019-01-04	Paper
Effective Randomness for Continuous Measures (available as arXiv preprint)	2018-08-29	Paper
Irrationality exponent, Hausdorff dimension and effectivization Monatshefte für Mathematik	2018-02-12	Paper
Irrationality exponent, Hausdorff dimension and effectivization Monatshefte für Mathematik	2018-02-12	Paper
The ^0_2 Turing degrees: automorphisms and definability Transactions of the American Mathematical Society	2017-12-01	Paper
On the construction of absolutely normal numbers Acta Arithmetica	2017-11-30	Paper
On the construction of absolutely normal numbers Acta Arithmetica	2017-11-30	Paper
The enumeration degrees: local and global structural interactions Foundations of Mathematics	2017-08-30	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
On absolutely normal numbers and their discrepancy estimate	2017-02-13	Paper
The inductive strength of Ramsey's theorem for pairs Advances in Mathematics	2017-02-03	Paper
The irrationality exponents of computable numbers Proceedings of the American Mathematical Society	2016-03-03	Paper
On simply normal numbers to different bases Mathematische Annalen	2016-02-10	Paper
On simply normal numbers to different bases Mathematische Annalen	2016-02-10	Paper
On the existence of a strong minimal pair Journal of Mathematical Logic	2015-08-14	Paper
A computable absolutely normal Liouville number Mathematics of Computation	2015-08-13	Paper
Measures and their random reals Transactions of the American Mathematical Society	2015-04-22	Paper
Oracle questions Infinity and Truth	2015-03-16	Paper
On zeros of Martin-Löf random Brownian motion Journal of Logic and Analysis	2015-01-22	Paper
On the normality of numbers to different bases Journal of the London Mathematical Society. Second Series	2014-10-15	Paper
A note on initial segments of the enumeration degrees The Journal of Symbolic Logic	2014-09-30	Paper
The metamathematics of Stable Ramsey’s Theorem for Pairs Journal of the American Mathematical Society	2014-09-19	Paper
Generics for computable Mathias forcing Annals of Pure and Applied Logic	2014-06-06	Paper
Normal numbers and the Borel hierarchy Fundamenta Mathematicae	2014-05-19	Paper
A polynomial-time algorithm for computing absolutely normal numbers Information and Computation	2013-12-13	Paper
Relative to any non-hyperarithmetic set Journal of Mathematical Logic	2013-10-17	Paper
\(K\)-trivials are never continuously random Proceedings of the 11th Asian Logic Conference	2013-06-03	Paper
Random reals, the rainbow Ramsey theorem, and arithmetic conservation Journal of Symbolic Logic	2013-04-23	Paper
Random reals, the rainbow Ramsey theorem, and arithmetic conservation Journal of Symbolic Logic	2013-04-23	Paper
The \(n\)-r.e. degrees: undecidability and \(\Sigma_1\) substructures Journal of Mathematical Logic	2012-09-06	Paper
\(\varPi^1_1\)-conservation of combinatorial principles weaker than Ramsey's theorem for pairs Advances in Mathematics	2012-07-20	Paper
The Slaman-Wehner theorem in higher recursion theory Proceedings of the American Mathematical Society	2011-05-27	Paper
The theory of the degrees is undecidable Israel Journal of Mathematics	2010-12-06	Paper
Corrigendum to: ``On the strength of Ramsey's theorem for pairs'' Journal of Symbolic Logic	2010-01-07	Paper
The atomic model theorem and type omitting Transactions of the American Mathematical Society	2009-11-06	Paper
Low upper bounds of ideals Journal of Symbolic Logic	2009-06-04	Paper
scientific article; zbMATH DE number 5504384 (Why is no real title available?)	2009-02-09	Paper
K-trivials are NCR	2008-12-08	Paper
The Strength of Some Combinatorial Principles Related to Ramsey's Theorem for Pairs (available as arXiv preprint)	2008-10-20	Paper
Generating sets for the recursively enumerable Turing degrees	2008-10-20	Paper
Turing incomparability in Scott sets Proceedings of the American Mathematical Society	2007-09-27	Paper
scientific article; zbMATH DE number 5175704 (Why is no real title available?) (available as arXiv preprint)	2007-07-30	Paper
Probability Measures and Effective Randomness	2007-07-10	Paper
Some results on effective randomness Theory of Computing Systems	2006-10-16	Paper
^0_1-presentations of algebras Archive for Mathematical Logic	2006-09-26	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
ON EXTENSIONS OF EMBEDDINGS INTO THE ENUMERATION DEGREES OF THE ${\Sigma_2^0}$-SETS Journal of Mathematical Logic	2006-04-06	Paper
Decidability of the Natural Numbers with the Almost-All Quantifier	2006-02-20	Paper
scientific article; zbMATH DE number 2204762 (Why is no real title available?)	2005-09-12	Paper
COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS International Journal of Algebra and Computation	2005-09-12	Paper
Comparing DNR and WWKL Journal of Symbolic Logic	2005-08-29	Paper
Automata, Languages and Programming Lecture Notes in Computer Science	2005-08-24	Paper
Differences between resource bounded degree structures Notre Dame Journal of Formal Logic	2005-07-13	Paper
Σ_{𝑛}-bounding and Δ_{𝑛}-induction Proceedings of the American Mathematical Society	2004-08-13	Paper
Every Set has a Least Jump Enumeration Journal of the London Mathematical Society	2002-10-22	Paper
An almost deep degree The Journal of Symbolic Logic	2002-09-05	Paper
Randomness and recursive enumerability SIAM Journal on Computing	2002-04-23	Paper
Extension of embeddings in the computably enumerable degrees Annals of Mathematics. Second Series	2002-02-14	Paper
On the strength of Ramsey's theorem for pairs The Journal of Symbolic Logic	2002-01-09	Paper
A splitting theorem for n-REA degrees Proceedings of the American Mathematical Society	2001-10-21	Paper
\(\Sigma_2\) induction and infinite injury priority arguments. III: Prompt sets, minimal pairs and Shoenfield's conjecture Israel Journal of Mathematics	2001-07-31	Paper
scientific article; zbMATH DE number 1531935 (Why is no real title available?)	2001-06-13	Paper
Recursive in a generic real Journal of Symbolic Logic	2001-05-10	Paper
\(\Pi_1^0\) classes and minimal degrees Annals of Pure and Applied Logic	2001-01-08	Paper
scientific article; zbMATH DE number 1390015 (Why is no real title available?)	2000-09-20	Paper
Quasi-minimal enumeration degrees and minimal Turing degrees Annali di Matematica Pura ed Applicata. Serie Quarta	2000-08-20	Paper
Defining the Turing jump Mathematical Research Letters	2000-08-13	Paper
scientific article; zbMATH DE number 1301815 (Why is no real title available?)	1999-09-19	Paper
Extending partial orders to dense linear orders Annals of Pure and Applied Logic	1999-06-24	Paper
On a question of Sierpiński Fundamenta Mathematicae	1999-06-03	Paper
Relative enumerability in the difference hierarchy Journal of Symbolic Logic	1999-04-27	Paper
Definability in the enumeration degrees Archive for Mathematical Logic	1999-02-04	Paper
A Basis Theorem for Perfect Sets The Bulletin of Symbolic Logic	1998-10-07	Paper
The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable Transactions of the American Mathematical Society	1998-09-10	Paper
Interpretability and Definability in the Recursively Enumerable Degrees Proceedings of the London Mathematical Society	1998-08-11	Paper
Relative to any nonrecursive set Proceedings of the American Mathematical Society	1998-05-06	Paper
The Π<sub>2</sub><sup>0</sup> enumeration degrees are not dense Journal of Symbolic Logic	1997-11-05	Paper
Definability in the Recursively Enumerable Degrees The Bulletin of Symbolic Logic	1997-11-05	Paper
Definability in the Recursively Enumerable Degrees The Bulletin of Symbolic Logic	1997-11-05	Paper
Automorphisms in the PTIME-Turing degrees of recursive sets Annals of Pure and Applied Logic	1997-06-12	Paper
The Sacks density theorem and Σ<sub>2</sub>-bounding Journal of Symbolic Logic	1997-03-19	Paper
On the strength of Ramsey's theorem Notre Dame Journal of Formal Logic	1996-05-22	Paper
scientific article; zbMATH DE number 841090 (Why is no real title available?)	1996-04-22	Paper
Algebraic aspects of the computably enumerable degrees. Proceedings of the National Academy of Sciences	1995-05-16	Paper
scientific article; zbMATH DE number 695580 (Why is no real title available?)	1995-04-03	Paper
Extremes in the degrees of inferability Annals of Pure and Applied Logic	1994-05-03	Paper
Working below a high recursively enumerable degree Journal of Symbolic Logic	1994-01-19	Paper
On the <i>Σ</i><sub>2</sub>-theory of the upper semilattice of Turing degrees Journal of Symbolic Logic	1993-08-17	Paper
scientific article; zbMATH DE number 66485 (Why is no real title available?)	1992-09-27	Paper
scientific article; zbMATH DE number 65752 (Why is no real title available?)	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
On co-simple isols and their intersection types Annals of Pure and Applied Logic	1992-09-27	Paper
The complexity types of computable sets Journal of Computer and System Sciences	1992-09-27	Paper
Jump embeddings in the Turing degrees Journal of Symbolic Logic	1992-06-27	Paper
scientific article; zbMATH DE number 17551 (Why is no real title available?)	1992-06-26	Paper
The density of infima in the recursively enumerable degrees Annals of Pure and Applied Logic	1991-01-01	Paper
scientific article; zbMATH DE number 4160709 (Why is no real title available?)	1990-01-01	Paper
On the theory of the PTIME degrees of the recursive sets Journal of Computer and System Sciences	1990-01-01	Paper
Working below a \(low_ 2\) recursively enumerable degree Archive for Mathematical Logic	1990-01-01	Paper
Generalized Hyperarithmetic Theory Proceedings of the London Mathematical Society	1990-01-01	Paper
scientific article; zbMATH DE number 4150148 (Why is no real title available?)	1989-01-01	Paper
scientific article; zbMATH DE number 4130363 (Why is no real title available?)	1989-01-01	Paper
scientific article; zbMATH DE number 4123711 (Why is no real title available?)	1989-01-01	Paper
scientific article; zbMATH DE number 4112573 (Why is no real title available?)	1989-01-01	Paper
Generic copies of countable structures Annals of Pure and Applied Logic	1989-01-01	Paper
Complementation in the Turing degrees Journal of Symbolic Logic	1989-01-01	Paper
Completely mitotic r. e. degrees Annals of Pure and Applied Logic	1989-01-01	Paper
A limit on relative genericity in the recursively enumerable sets Journal of Symbolic Logic	1989-01-01	Paper
scientific article; zbMATH DE number 4108753 (Why is no real title available?)	1988-01-01	Paper
<i>Σ<sub>2</sub></i>-collection and the infinite injury priority method Journal of Symbolic Logic	1988-01-01	Paper
Inadmissible forcing Advances in Mathematics	1987-01-01	Paper
Definability in the Turing degrees Illinois Journal of Mathematics	1986-01-01	Paper
<i>Σ</i><sub>1</sub> definitions with parameters Journal of Symbolic Logic	1986-01-01	Paper
On the Kleene degrees of <i>Π</i><sub>1</sub><sup>1</sup> sets Journal of Symbolic Logic	1986-01-01	Paper
scientific article; zbMATH DE number 3916252 (Why is no real title available?)	1985-01-01	Paper
scientific article; zbMATH DE number 3916251 (Why is no real title available?)	1985-01-01	Paper
Reflection and forcing in E-recursion theory Annals of Pure and Applied Logic	1985-01-01	Paper
Independence Results on the Global Structure of the Turing Degrees	1983-01-01	Paper
The extended plus-one hypothesis—A relative consistency result Nagoya Mathematical Journal	1983-01-01	Paper
Learning Equivalence Relations on Polish Spaces (available as arXiv preprint)	N/A	Paper

Research outcomes over time

This page was built for person: Theodore A. Slaman