The following pages link to Russell G. Miller (Q1032631):
Displaying 49 items.
- (Q402680) (redirect page) (← links)
- Computing constraint sets for differential fields (Q402682) (← links)
- Post's problem for ordinal register machines: an explicit approach (Q1032632) (← links)
- Classifications of computable structures (Q1704081) (← links)
- Degree spectra of real closed fields (Q1734266) (← links)
- Orbits of computably enumerable sets: Low sets can avoid an upper cone (Q1849863) (← links)
- Simple structures with complex symmetry (Q1957352) (← links)
- Primitive recursive fields and categoricity (Q2011324) (← links)
- Computable transformations of structures (Q2011638) (← links)
- Model completeness and relative decidability (Q2042736) (← links)
- Non-coding enumeration operators (Q2106596) (← links)
- Computable procedures for fields (Q2117796) (← links)
- Degree spectra for transcendence in fields (Q2179363) (← links)
- On decidable categoricity and almost prime models (Q2203434) (← links)
- The basic theory of infinite time register machines (Q2267751) (← links)
- Turing degrees of complete formulas of almost prime models (Q2300743) (← links)
- The Hilbert's-tenth-problem operator (Q2414521) (← links)
- Order-computable sets (Q2469429) (← links)
- Enumerations in computable structure theory (Q2570135) (← links)
- Degrees of categoricity of computable structures (Q2655143) (← links)
- On existential definitions of c.e. subsets of rings of functions of characteristic 0 (Q2668003) (← links)
- The -spectrum of a linear order (Q2747698) (← links)
- Computably Categorical Fields via Fermat’s Last Theorem (Q2851189) (← links)
- An introduction to computable model theory on groups and fields (Q2882823) (← links)
- COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY (Q2933680) (← links)
- Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey (Q2970964) (← links)
- FINITARY REDUCIBILITY ON EQUIVALENCE RELATIONS (Q2976331) (← links)
- Noncomputable functions in the Blum-Shub-Smale model (Q3003334) (← links)
- Is it harder to factor a polynomial or to find a root? (Q3053472) (← links)
- Computability of Fraïssé limits (Q3083128) (← links)
- Adapting Rabin’s Theorem for Differential Fields (Q3091458) (← links)
- Definable incompleteness and Friedberg splittings (Q3149989) (← links)
- Low<sub>5</sub> Boolean Subalgebras and Computable Copies (Q3173541) (← links)
- Real Computable Manifolds and Homotopy Groups (Q3184760) (← links)
- Baire Category Theory and Hilbert’s Tenth Problem Inside $$\mathbb {Q}$$ Q (Q3188274) (← links)
- Spectra of structures and relations (Q3426577) (← links)
- A COMPUTABLE FUNCTOR FROM GRAPHS TO FIELDS (Q4638989) (← links)
- BOREL FUNCTORS AND INFINITARY INTERPRETATIONS (Q4647104) (← links)
- HTP-COMPLETE RINGS OF RATIONAL NUMBERS (Q5070470) (← links)
- INTERPRETING A FIELD IN ITS HEISENBERG GROUP (Q5100059) (← links)
- As easy as $\mathbb {Q}$: Hilbert’s Tenth Problem for subrings of the rationals and number fields (Q5369029) (← links)
- Classes of structures with universe a subset of 1 (Q5406116) (← links)
- TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS (Q5738187) (← links)
- COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY (Q5738191) (← links)
- Effectivizing Lusin’s Theorem (Q5870345) (← links)
- A TOPOLOGICAL APPROACH TO UNDEFINABILITY IN ALGEBRAIC EXTENSIONS OF (Q6199176) (← links)
- Borel Functors and Infinitary Interpretations (Q6274899) (← links)
- Effectivizing Lusin's Theorem (Q6323801) (← links)
- Interpreting a field in its Heisenberg group (Q6343384) (← links)
