The following pages link to D. Reed Solomon (Q218974):
Displayed 50 items.
- Item:Q218974 (redirect page) (← links)
- Degrees of orders on torsion-free abelian groups (Q385079) (← links)
- The complexity of central series in nilpotent computable groups (Q639669) (← links)
- Effectiveness for infinite variable words and the dual Ramsey theorem (Q701747) (← links)
- Embeddings of computable structures (Q976535) (← links)
- Self-embeddings of computable trees (Q1049747) (← links)
- Computability-theoretic and proof-theoretic aspects of partial and linear orderings (Q1425651) (← links)
- \(\Pi_{1}^{0}\) classes and orderable groups (Q1612488) (← links)
- Group theoretic properties of the group of computable automorphisms of a countable dense linear order (Q1810808) (← links)
- The computable dimension of ordered abelian groups (Q1873769) (← links)
- Model completeness and relative decidability (Q2042736) (← links)
- Effectiveness for the dual Ramsey theorem (Q2075273) (← links)
- On the isomorphism problem for some classes of computable algebraic structures (Q2155501) (← links)
- The uniform content of partial and linear orders (Q2400498) (← links)
- A computably stable structure with no Scott family of finitary formulas (Q2501165) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- – <i>CA</i><sub>0</sub> and order types of countable ordered groups (Q2732274) (← links)
- A Δ<sub>2</sub><sup>0</sup> set with no infinite low subset in either it or its complement (Q2758065) (← links)
- Lowness notions, measure and domination (Q2890316) (← links)
- Ramsey’s theorem for singletons and strong computable reducibility (Q2951171) (← links)
- Effectiveness of Hindman’s Theorem for Bounded Sums (Q2970955) (← links)
- Reverse mathematics and infinite traceable graphs (Q3117776) (← links)
- Computable Reductions and Reverse Mathematics (Q3188256) (← links)
- Computable categoricity of trees of finite height (Q3370760) (← links)
- (Q3464625) (← links)
- Stability and posets (Q3630588) (← links)
- Ordered Groups: A Case Study in Reverse Mathematics (Q4254643) (← links)
- (Q4677692) (← links)
- THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS (Q4799377) (← links)
- Jump degrees of torsion-free abelian groups (Q4899162) (← links)
- CAPPABLE CEA SETS AND RAMSEY'S THEOREM (Q4922663) (← links)
- THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH (Q5107225) (← links)
- Lowness for isomorphism, countable ideals, and computable traceability (Q5112396) (← links)
- Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees (Q5113922) (← links)
- Degrees that Are Low for Isomorphism (Q5175617) (← links)
- On the Effectiveness of Symmetry Breaking (Q5175904) (← links)
- The reverse mathematics of Hindman’s Theorem for sums of exactly two elements (Q5211065) (← links)
- (Q5295698) (← links)
- On the computability-theoretic complexity of trivial, strongly minimal models (Q5308141) (← links)
- Reverse mathematics and the equivalence of definitions for well and better quasi-orders (Q5311748) (← links)
- Local Computability for Ordinals (Q5326366) (← links)
- SEPARATING PRINCIPLES BELOW RAMSEY'S THEOREM FOR PAIRS (Q5401600) (← links)
- On a conjecture of Dobrinen and Simpson concerning almost everywhere domination (Q5477626) (← links)
- (Q5494233) (← links)
- (Q5711881) (← links)
- Reverse mathematics and fully ordered groups (Q5937813) (← links)
- On the filter of computably enumerable supersets of an r-maximal set (Q5950713) (← links)
- Effectiveness for the Dual Ramsey Theorem (Q6291968) (← links)
- Model completeness and relative decidability (Q6314930) (← links)
- On the first-order parts of problems in the Weihrauch degrees (Q6424778) (← links)