Theodore A. Slaman

2.4k total citations
92 papers, 1.0k citations indexed

About

Theodore A. Slaman is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, Theodore A. Slaman has authored 92 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 85 papers in Computational Theory and Mathematics, 47 papers in Geometry and Topology and 16 papers in Artificial Intelligence. Recurrent topics in Theodore A. Slaman's work include Computability, Logic, AI Algorithms (84 papers), Advanced Topology and Set Theory (47 papers) and semigroups and automata theory (47 papers). Theodore A. Slaman is often cited by papers focused on Computability, Logic, AI Algorithms (84 papers), Advanced Topology and Set Theory (47 papers) and semigroups and automata theory (47 papers). Theodore A. Slaman collaborates with scholars based in United States, New Zealand and Singapore. Theodore A. Slaman's co-authors include Richard A. Shore, Antonín Kučera, Peter Cholak, Carl G. Jockusch, W. Hugh Woodin, C. T. Chong, Mark S. Manasse, Julia F. Knight, John R. Steel and Denis R. Hirschfeldt and has published in prestigious journals such as Mathematics of Computation, Annals of Mathematics and Transactions of the American Mathematical Society.

In The Last Decade

Theodore A. Slaman

85 papers receiving 947 citations

Peers

Countries citing papers authored by Theodore A. Slaman

Since Specialization

Citations

This map shows the geographic impact of Theodore A. Slaman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Theodore A. Slaman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Theodore A. Slaman more than expected).

Fields of papers citing papers by Theodore A. Slaman

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Theodore A. Slaman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Theodore A. Slaman. The network helps show where Theodore A. Slaman may publish in the future.

Co-authorship network of co-authors of Theodore A. Slaman

This figure shows the co-authorship network connecting the top 25 collaborators of Theodore A. Slaman. A scholar is included among the top collaborators of Theodore A. Slaman based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Theodore A. Slaman. Theodore A. Slaman is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

#	Work	Indexed citations
1	The inductive strength of Ramsey's Theorem for Pairs 2016 ·Advances in Mathematics ·C. T. Chong, Theodore A. Slaman, Yue Yang	9
2	Slicing the Truth 2014 ·Denis R. Hirschfeldt, C. T. Chong, Qi Feng, Theodore A. Slaman, (unknown), Yue Yang	16
3	Notes on Forcing Axioms 2013 ·Stevo Todorčević, C. T. Chong, Q. Feng, Theodore A. Slaman, W. Hugh Woodin, (unknown)	5
4	A polynomial-time algorithm for computing absolutely normal numbers 2013 ·Information and Computation ·Verónica Becher, (unknown), Theodore A. Slaman	10
5	The Slaman-Wehner theorem in higher recursion theory 2010 ·Proceedings of the American Mathematical Society ·Noam Greenberg, Antonio Montalbán, Theodore A. Slaman	4
6	Limit computability and constructive measure 2008 ·UvA-DARE (University of Amsterdam) ·C. T. Chong, (unknown), Theodore A. Slaman, W. Hugh Woodin, (unknown), (unknown), (unknown)	4
7	Sigma~n-bounding and Delta~n-induction 2004 ·Proceedings of the American Mathematical Society ·Theodore A. Slaman	2
8	Σ_{𝑛}-bounding and Δ_{𝑛}-induction 2004 ·Proceedings of the American Mathematical Society ·Theodore A. Slaman	17
9	A splitting theorem for 𝑛-𝑅𝐸𝐴 degrees 2001 ·Proceedings of the American Mathematical Society ·Richard A. Shore, Theodore A. Slaman	6
10	Extending partial orders to dense linear orders 1998 ·Annals of Pure and Applied Logic ·Theodore A. Slaman, W. Hugh Woodin	2
11	Extremes in the degrees of inferability 1994 ·Annals of Pure and Applied Logic ·Lance Fortnow, (unknown), Sanjay Jain, Efim Kinber, Martin Kummer, Stuart A. Kurtz, (unknown), Theodore A. Slaman, Robert M Solovay, Frank Stephan	26
12	The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory 1992 ·Theoretical Computer Science ·Richard A. Shore, Theodore A. Slaman	5
13	On co-simple isols and their intersection types 1992 ·Annals of Pure and Applied Logic ·Rod Downey, Theodore A. Slaman	1
14	When oracles do not help 1991 ·Conference on Learning Theory ·Theodore A. Slaman, Robert M Solovay	19
15	The density of infima in the recursively enumerable degrees 1991 ·Annals of Pure and Applied Logic ·Theodore A. Slaman	16
16	On the theory of the PTIME degrees of the recursive sets 1990 ·Journal of Computer and System Sciences ·(unknown), Theodore A. Slaman	15
17	Complementation in the Turing degrees 1989 ·Journal of Symbolic Logic ·Theodore A. Slaman, John R. Steel	30
18	Completely mitotic R.E. degrees 1989 ·Annals of Pure and Applied Logic ·Rodney G. Downey, Theodore A. Slaman	14
19	Generic copies of countable structures 1989 ·Annals of Pure and Applied Logic ·(unknown), Julia F. Knight, Mark S. Manasse, Theodore A. Slaman	75
20	On the Theory of the Polynomial Degrees of the Recursive Sets 1988 ·Kyoto University Research Information Repository (Kyoto University) ·(unknown), Theodore A. Slaman	2

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact