Reed Solomon - RankMe

37 papers C 3Journal 33Unranked 1

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Computing strategies for multiple cops on infinite graphs. Comput. Alexa McLeod, Reed Solomon
2024	J	`jnl`	On the first-order parts of problems in the Weihrauch degrees. Comput. Damir D. Dzhafarov, Reed Solomon, Keita Yokoyama
2022	J	`jnl`	On the isomorphism problem for some classes of computable algebraic structures. Arch. Math. Log. Valentina S. Harizanov, Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon
2021	J	`jnl`	Effectiveness for the Dual Ramsey Theorem. Notre Dame J. Formal Log. Damir D. Dzhafarov, Stephen Flood, Reed Solomon, Linda Brown Westrick
2021	J	`jnl`	Model completeness and relative decidability. Arch. Math. Log. Jennifer Chubb, Russell G. Miller, Reed Solomon
2020	J	`jnl`	Lowness for isomorphism, countable ideals, and computable traceability. Math. Log. Q. Johanna N. Y. Franklin, Reed Solomon
2020	J	`jnl`	The determined Property of Baire in Reverse Math. J. Symb. Log. Eric P. Astor, Damir D. Dzhafarov, Antonio Montalbán, Reed Solomon, Linda Brown Westrick
2019	J	`jnl`	The reverse mathematics of Hindman's Theorem for sums of exactly two elements. Comput. Barbara F. Csima, Damir D. Dzhafarov, Denis R. Hirschfeldt, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick
2017	—	`conf`	Effectiveness of Hindman's Theorem for Bounded Sums. Computability and Complexity Damir D. Dzhafarov, Carl G. Jockusch Jr., Reed Solomon, Linda Brown Westrick
2017	J	`jnl`	The uniform content of partial and linear orders. Ann. Pure Appl. Log. Eric P. Astor, Damir D. Dzhafarov, Reed Solomon, Jacob Suggs
2016	C	`conf`	Computable Reductions and Reverse Mathematics. CiE Reed Solomon
2014	J	`jnl`	Degrees that Are Low for Isomorphism. Comput. Johanna N. Y. Franklin, Reed Solomon
2014	C	`conf`	On the Effectiveness of Symmetry Breaking. CiE Russell G. Miller, Reed Solomon, Rebecca M. Steiner
2013	J	`jnl`	Degrees of orders on torsion-free Abelian groups. Ann. Pure Appl. Log. Asher M. Kach, Karen M. Lange, Reed Solomon
2013	C	`conf`	Local Computability for Ordinals. CiE Johanna N. Y. Franklin, Asher M. Kach, Russell G. Miller, Reed Solomon
2013	J	`jnl`	Separating Principles below Ramsey's Theorem for Pairs. J. Math. Log. Manuel Lerman, Reed Solomon, Henry Towsner
2012	J	`jnl`	Jump degrees of torsion-free abelian groups. J. Symb. Log. Brooke M. Andersen, Asher M. Kach, Alexander G. Melnikov, Reed Solomon
2012	J	`jnl`	Lowness notions, measure and domination. J. Lond. Math. Soc. Bjørn Kjos-Hanssen, Joseph S. Miller, Reed Solomon
2012	J	`jnl`	Reverse mathematics and infinite traceable graphs. Math. Log. Q. Peter Cholak, David J. Galvin, Reed Solomon
2011	J	`jnl`	The complexity of central series in nilpotent computable groups. Ann. Pure Appl. Log. Barbara F. Csima, Reed Solomon
2010	J	`jnl`	Embeddings of Computable Structures. Notre Dame J. Formal Log. Asher M. Kach, Oscar Levin, Reed Solomon
2009	J	`jnl`	Stability and posets. J. Symb. Log. Carl G. Jockusch Jr., Bart Kastermans, Steffen Lempp, Manuel Lerman, Reed Solomon
2008	J	`jnl`	Self-Embeddings of Computable Trees. Notre Dame J. Formal Log. Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, James H. Schmerl, Reed Solomon
2006	J	`jnl`	A computably stable structure with no Scott family of finitary formulas. Arch. Math. Log. Peter Cholak, Richard A. Shore, Reed Solomon
2006	J	`jnl`	On a conjecture of Dobrinen and Simpson concerning almost everywhere domination. J. Symb. Log. Stephen Binns, Bjørn Kjos-Hanssen, Manuel Lerman, Reed Solomon
2005	J	`jnl`	Computable categoricity of trees of finite height. J. Symb. Log. Steffen Lempp, Charles F. D. McCoy, Russell G. Miller, Reed Solomon
2005	J	`jnl`	Enumerations in computable structure theory. Ann. Pure Appl. Log. Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Russell G. Miller, Reed Solomon
2004	J	`jnl`	Effectiveness for infinite variable words and the Dual Ramsey Theorem. Arch. Math. Log. Joseph S. Miller, Reed Solomon
2004	J	`jnl`	Reverse mathematics and the equivalence of definitions for well and better quasi-orders. J. Symb. Log. Peter Cholak, Alberto Marcone, Reed Solomon
2002	J	`jnl`	Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order. Order Steffen Lempp, Charles F. D. McCoy, Andrei S. Morozov, Reed Solomon
2002	J	`jnl`	Pi Ann. Pure Appl. Log. Reed Solomon
2002	J	`jnl`	The Lindenbaum Algebra of the Theory of the class of All finite Models. J. Math. Log. Steffen Lempp, Mikhail G. Peretyat'kin, Reed Solomon
2001	J	`jnl`	A delta J. Symb. Log. Rodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, Reed Solomon
2001	J	`jnl`	On the filter of computably enumerable supersets of an r-maximal set. Arch. Math. Log. Steffen Lempp, André Nies, Reed Solomon
2001	J	`jnl`	PI J. Symb. Log. Reed Solomon
1999	J	`jnl`	Ordered groups: a case study in reverse mathematics. Bull. Symb. Log. Reed Solomon
1998	J	`jnl`	Reverse Mathematics and Fully Ordered Groups. Notre Dame J. Formal Log. Reed Solomon