default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheodore A. Slaman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
[j54]Manuel Lerman, Theodore A. Slaman:
IN MEMORIAM: GERALD E. SACKS, 1933-2019. Bull. Symb. Log. 28(1): 150-155 (2022)- 2019
- [j53]François G. Dorais, Zachary Evans, Marcia J. Groszek, Seth Harris, Theodore A. Slaman:
Schmerl decompositions in first order arithmetic. Ann. Pure Appl. Log. 170(12) (2019) - 2018
- [j52]Theodore A. Slaman, Keita Yokoyama
:
The strength of Ramsey's Theorem for Pairs and arbitrarily Many Colors. J. Symb. Log. 83(4): 1610-1617 (2018) - 2015
- [j51]George Barmpalias, Mingzhong Cai, Steffen Lempp, Theodore A. Slaman:
On the existence of a strong minimal pair. J. Math. Log. 15(1): 1550003:1-1550003:28 (2015) - [j50]Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman:
A computable absolutely normal Liouville number. Math. Comput. 84(296): 2939-2952 (2015) - 2014
- [j49]Peter Cholak, Damir D. Dzhafarov, Jeffry L. Hirst, Theodore A. Slaman:
Generics for computable Mathias forcing. Ann. Pure Appl. Log. 165(9): 1418-1428 (2014) - [j48]Laurent Bienvenu, Kelty Allen, Theodore A. Slaman:
On zeros of Martin-Löf random Brownian motion. J. Log. Anal. 6 (2014) - [j47]Verónica Becher, Theodore A. Slaman:
On the normality of numbers to different bases. J. Lond. Math. Soc. 90(2): 472-494 (2014) - [j46]Theodore A. Slaman, Andrea Sorbi:
A note on initial Segments of the Enumeration Degrees. J. Symb. Log. 79(2): 633-643 (2014) - 2013
- [j45]Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman:
A polynomial-time algorithm for computing absolutely normal numbers. Inf. Comput. 232: 1-9 (2013) - [j44]Noam Greenberg, Antonio Montalbán, Theodore A. Slaman:
Relative to any non-Hyperarithmetic Set. J. Math. Log. 13(1): 1250007 (2013) - [j43]Chris J. Conidis, Theodore A. Slaman:
Random reals, the rainbow Ramsey theorem, and arithmetic conservation. J. Symb. Log. 78(1): 195-206 (2013) - 2012
- [j42]Mingzhong Cai, Richard A. Shore, Theodore A. Slaman:
The n-R.E. Degrees: Undecidability and σ1 Substructures. J. Math. Log. 12(1): 1250005 (2012) - 2009
- [j41]Antonín Kucera, Theodore A. Slaman:
Low upper bounds of ideals. J. Symb. Log. 74(2): 517-534 (2009) - [j40]Peter Cholak, Theodore A. Slaman, Carl G. Jockusch Jr.:
Corrigendum to: "On the strength of Ramsey's Theorem for pairs". J. Symb. Log. 74(4): 1438-1439 (2009) - 2006
- [j39]Bakhadyr Khoussainov, Theodore A. Slaman, Pavel Semukhin:
P01-Presentations of Algebras. Arch. Math. Log. 45(6): 769-781 (2006) - [j38]Noam Greenberg, Richard A. Shore, Theodore A. Slaman:
The Theory of the Metarecursively Enumerable Degrees. J. Math. Log. 6(1) (2006) - [j37]Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman:
Some Results on Effective Randomness. Theory Comput. Syst. 39(5): 707-721 (2006) - 2005
- [j36]Bakhadyr Khoussainov, Steffen Lempp, Theodore A. Slaman:
Computably Enumerable Algebras, Their Expansions, and Isomorphisms. Int. J. Algebra Comput. 15(3): 437-454 (2005) - [j35]Steffen Lempp, Theodore A. Slaman, Andrea Sorbi:
On Extensions of Embeddings into the Enumeration Degrees of the -Sets. J. Math. Log. 5(2) (2005) - 2004
- [j34]Klaus Ambos-Spies, Bjørn Kjos-Hanssen, Steffen Lempp, Theodore A. Slaman:
Comparing DNR and WWKL. J. Symb. Log. 69(4): 1089-1104 (2004) - 2003
- [j33]Michael E. Mytilinaios, Theodore A. Slaman:
Differences between Resource Bounded Degree Structures. Notre Dame J. Formal Log. 44(1): 1-12 (2003) - 2001
- [j32]Peter Cholak, Carl G. Jockusch Jr., Theodore A. Slaman:
On The Strength of Ramsey's Theorem for Pairs. J. Symb. Log. 66(1): 1-55 (2001) - [j31]Peter Cholak, Marcia J. Groszek, Theodore A. Slaman:
An Almost Deep Degree. J. Symb. Log. 66(2): 881-901 (2001) - [j30]Antonín Kucera, Theodore A. Slaman:
Randomness and Recursive Enumerability. SIAM J. Comput. 31(1): 199-211 (2001) - 2000
- [j29]Juichi Shinoda, Theodore A. Slaman:
Recursive in A Generic Real. J. Symb. Log. 65(1): 164-172 (2000) - 1998
- [j28]Theodore A. Slaman, W. Hugh Woodin:
Extending Partial Orders to Dense Linear Orders. Ann. Pure Appl. Log. 94(1-3): 253-261 (1998) - [j27]Marcia J. Groszek, Theodore A. Slaman:
A basis theorem for perfect sets. Bull. Symb. Log. 4(2): 204-209 (1998) - [j26]Marat M. Arslanov, Geoffrey LaForte, Theodore A. Slaman:
Relative Enumerability in the Difference Hierarchy. J. Symb. Log. 63(2): 411-420 (1998) - 1997
- [j25]Theodore A. Slaman, W. Hugh Woodin:
Definability in the enumeration degrees. Arch. Math. Log. 36(4-5): 255-267 (1997) - [j24]Christine Ann Haught, Theodore A. Slaman:
Automorphisms in the PTIME-Turing Degrees of Recursive Sets. Ann. Pure Appl. Log. 84(1): 139-152 (1997) - [j23]Marcia J. Groszek, Theodore A. Slaman:
Pi0a Classes and Minimal Degrees. Ann. Pure Appl. Log. 87(2): 117-144 (1997) - 1996
- [j22]André Nies, Richard A. Shore, Theodore A. Slaman:
Definability in the recursively enumerable degrees. Bull. Symb. Log. 2(4): 392-404 (1996) - [j21]Marcia J. Groszek, Michael E. Mytilinaios, Theodore A. Slaman:
The Sacks Density Theorem and Sigma2-Bounding. J. Symb. Log. 61(2): 450-467 (1996) - [j20]William C. Calhoun, Theodore A. Slaman:
The Pi20 Enumeration Degrees Are Not Dense. J. Symb. Log. 61(4): 1364-1379 (1996) - 1995
- [j19]David Seetapun, Theodore A. Slaman:
On the Strength of Ramsey's Theorem. Notre Dame J. Formal Log. 36(4): 570-582 (1995) - 1994
- [j18]Lance Fortnow, William I. Gasarch, Sanjay Jain, Efim B. Kinber, Martin Kummer, Stuart A. Kurtz, Mark Pleszkovich, Theodore A. Slaman, Robert Solovay, Frank Stephan:
Extremes in the Degrees of Inferability. Ann. Pure Appl. Log. 66(3): 231-276 (1994) - 1993
- [j17]Carl G. Jockusch Jr., Theodore A. Slaman:
On the Sigma2-Theory of the Upper Semilattice of Turing Degrees. J. Symb. Log. 58(1): 193-204 (1993) - [j16]Richard A. Shore, Theodore A. Slaman:
Working below a Highly Recursively Enumerable Degree. J. Symb. Log. 58(3): 824-859 (1993) - 1992
- [j15]Rodney G. Downey, Theodore A. Slaman:
On co-Simple Isols and Their Intersection Types. Ann. Pure Appl. Log. 56(1-3): 221-237 (1992) - [j14]Wolfgang Maass, Theodore A. Slaman:
The Complexity Types of Computable Sets. J. Comput. Syst. Sci. 44(2): 168-192 (1992) - [j13]Richard A. Shore, Theodore A. Slaman:
The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory. Theor. Comput. Sci. 97(2): 263-284 (1992) - 1991
- [j12]Theodore A. Slaman:
The Density of Infima in the Recursively Enumerable Degrees. Ann. Pure Appl. Log. 52(1-2): 155-179 (1991) - [j11]Peter G. Hinman, Theodore A. Slaman:
Jump Embeddings in Turing Degrees. J. Symb. Log. 56(2): 563-591 (1991) - 1990
- [j10]Richard A. Shore, Theodore A. Slaman:
Working below a low2 recursively enumerably degree. Arch. Math. Log. 29(3): 201-211 (1990) - [j9]Juichi Shinoda, Theodore A. Slaman:
On the Theory of the PTIME Degrees of the Recursive Sets. J. Comput. Syst. Sci. 41(3): 321-366 (1990) - 1989
- [j8]Rodney G. Downey, Theodore A. Slaman:
Completely Mitotic r.e. Degrees. Ann. Pure Appl. Log. 41(2): 119-152 (1989) - [j7]Christopher J. Ash, Julia F. Knight, Mark S. Manasse, Theodore A. Slaman:
Generic Copies of Countable Structures. Ann. Pure Appl. Log. 42(3): 195-205 (1989) - [j6]Theodore A. Slaman, John R. Steel:
Complementation in the Turing Degrees. J. Symb. Log. 54(1): 160-176 (1989) - [j5]Steffen Lempp, Theodore A. Slaman:
A Limit on Relative Genericity in the Recursively Enumerable Sets. J. Symb. Log. 54(2): 376-395 (1989) - 1988
- [j4]Michael E. Mytilinaios, Theodore A. Slaman:
sigma2-Collection and the Infinite Injury Priority Method. J. Symb. Log. 53(1): 212-221 (1988) - 1986
- [j3]Theodore A. Slaman:
On the Kleene Degrees of pi11 Sets. J. Symb. Log. 51(2): 352-359 (1986) - [j2]Theodore A. Slaman:
Sigma1 Definitions with Parameters. J. Symb. Log. 51(2): 453-461 (1986) - 1985
- [j1]Theodore A. Slaman:
Reflection and forcing in E-recursion theory. Ann. Pure Appl. Log. 29(1): 79-106 (1985)
Conference and Workshop Papers
- 2017
- [c8]Leo Harrington, Richard A. Shore, Theodore A. Slaman:
Σ _1^1 in Every Real in a Σ _1^1 Class of Reals Is Σ _1^1. Computability and Complexity 2017: 455-466 - 2004
- [c7]Wolfgang Merkle, Nenad Mihailovic, Theodore A. Slaman:
Some Results on Effective Randomness. ICALP 2004: 983-995 - 1992
- [c6]Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman:
Degrees of Inferability. COLT 1992: 180-192 - 1991
- [c5]Theodore A. Slaman, Robert Solovay:
When Oracles Do Not Help. COLT 1991: 379-383 - 1989
- [c4]Richard A. Shore, Theodore A. Slaman:
The P-T-Degrees of the Recursive Sets: Lattice Embeddings, Extension of Embeddings and the Two Quantifier Theory. SCT 1989: 68-76 - [c3]Wolfgang Maass, Theodore A. Slaman:
The Complexity Types of Computable Sets. SCT 1989: 231-239 - [c2]Wolfgang Maass, Theodore A. Slaman:
Extensional Properties of Sets of Time Bounded Complexity (Extended Abstract). FCT 1989: 318-326 - 1988
- [c1]Juichi Shinoda, Theodore A. Slaman:
On the theory of the PTIME degrees of the recursive sets. SCT 1988: 252-257
Parts in Books or Collections
- 1999
- [p1]Theodore A. Slaman:
The Global Structure of the Turing Degrees. Handbook of Computability Theory 1999: 155-168
Informal and Other Publications
- 2017
- [i2]Verónica Becher, Adrian-Maria Scheerer, Theodore A. Slaman:
On absolutely normal numbers and their discrepancy estimate. CoRR abs/1702.04072 (2017) - 2013
- [i1]Verónica Becher, Pablo Ariel Heiber, Theodore A. Slaman:
Normal Numbers and the Borel Hierarchy. CoRR abs/1311.0335 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
