Russell Miller

MaRDI QIDQ1032631zbMATH OpenFDO

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A TOPOLOGICAL APPROACH TO UNDEFINABILITY IN ALGEBRAIC EXTENSIONS OF The Bulletin of Symbolic Logic	2024-02-23	Paper
Direct construction of Scott ideals Lecture Notes in Computer Science	2024-01-12	Paper
Computability for the absolute Galois group of $\mathbb{Q}$	2023-07-17	Paper
Differentially closed fields and universality on a cone	2023-01-13	Paper
Effectivizing Lusin’s Theorem Journal of Logic and Analysis	2023-01-09	Paper
Non-coding enumeration operators	2022-12-16	Paper
INTERPRETING A FIELD IN ITS HEISENBERG GROUP Journal of Symbolic Logic	2022-08-29	Paper
HTP-COMPLETE RINGS OF RATIONAL NUMBERS Journal of Symbolic Logic	2022-04-12	Paper
Computable procedures for fields	2022-03-22	Paper
On existential definitions of c.e. subsets of rings of functions of characteristic 0 Annals of Pure and Applied Logic	2022-03-03	Paper
Model completeness and relative decidability Archive for Mathematical Logic	2021-07-21	Paper
Computable Reducibility for Cantor Space Structure and Randomness in Computability and Set Theory	2021-06-15	Paper
The cardinality of an oracle in Blum-Shub-Smale computation	2021-02-16	Paper
Measure theory and Hilbert's tenth problem inside \(\mathbb{Q} \) Sets and Computations	2020-12-02	Paper
On decidable categoricity and almost prime models Siberian Advances in Mathematics	2020-10-06	Paper
Forcing as a computational process	2020-07-01	Paper
Interpreting a field in its Heisenberg group	2020-06-21	Paper
Degree spectra for transcendence in fields	2020-05-12	Paper
Turing degrees of complete formulas of almost prime models Algebra and Logic	2020-02-28	Paper
Isomorphism and classification for countable structures Computability	2020-01-17	Paper
Primitive recursive fields and categoricity Algebra and Logic	2019-12-06	Paper
Effectivizing Lusin's Theorem	2019-08-17	Paper
The Hilbert's-tenth-problem operator Israel Journal of Mathematics	2019-05-17	Paper
Degree spectra of real closed fields Archive for Mathematical Logic	2019-03-27	Paper
Model completeness and relative decidability	2019-03-02	Paper
BOREL FUNCTORS AND INFINITARY INTERPRETATIONS Journal of Symbolic Logic	2019-01-04	Paper
A computable functor from graphs to fields Journal of Symbolic Logic	2018-05-02	Paper
Classifications of computable structures Notre Dame Journal of Formal Logic	2018-03-08	Paper
On computable field embeddings and difference closed fields Canadian Journal of Mathematics	2017-12-13	Paper
As easy as \(\mathbb {Q}\): Hilbert's tenth problem for subrings of the rationals and number fields Transactions of the American Mathematical Society	2017-10-11	Paper
Computable transformations of structures	2017-08-04	Paper
TURING DEGREE SPECTRA OF DIFFERENTIALLY CLOSED FIELDS Journal of Symbolic Logic	2017-06-01	Paper
Computable functors and effective interpretability Journal of Symbolic Logic	2017-06-01	Paper
Approximating functions and measuring distance on a graph Proceedings of the 12th Asian Logic Conference	2017-05-31	Paper
Finitary reducibility on equivalence relations Journal of Symbolic Logic	2017-04-28	Paper
Revisiting uniform computable categoricity: for the sixtieth birthday of prof. Rod Downey Computability and Complexity	2017-04-04	Paper
Baire category theory and Hilbert's tenth problem inside \(\mathbb {Q}\) Pursuit of the Universal	2016-08-17	Paper
Borel Functors and Infinitary Interpretations	2016-06-23	Paper
Local computability and uncountable structures	2016-01-27	Paper
Categoricity properties for computable algebraic fields Transactions of the American Mathematical Society	2015-04-22	Paper
Computable categoricity for algebraic fields with splitting algorithms Transactions of the American Mathematical Society	2015-04-22	Paper
Isomorphisms of non-standard fields and Ash's conjecture Language, Life, Limits	2015-02-25	Paper
On the effectiveness of symmetry breaking Language, Life, Limits	2015-02-25	Paper
Complexity of equivalence relations and preorders from computability theory Journal of Symbolic Logic	2014-12-05	Paper
Computing constraint sets for differential fields Journal of Algebra	2014-08-28	Paper
Classes of structures with universe a subset of \(\omega _{1}\) Journal Of Logic And Computation	2014-04-01	Paper
Computably categorical fields via Fermat's last theorem Computability	2013-10-10	Paper
Local computability for ordinals Lecture Notes in Computer Science	2013-08-05	Paper
The hierarchy of equivalence relations on the natural numbers under computable reducibility Computability	2013-01-30	Paper
Spectra of high\(_n\) and non-low\(_n\) degrees Journal of Logic and Computation	2012-09-05	Paper
An introduction to computable model theory on groups and fields Groups, Complexity, Cryptology	2012-05-07	Paper
The Distance Function on a Computable Graph	2011-11-10	Paper
\(\text{Low}_5\) Boolean subalgebras and computable copies Journal of Symbolic Logic	2011-10-10	Paper
Adapting Rabin's theorem for differential fields Models of Computation in Context	2011-09-09	Paper
Noncomputable functions in the Blum-Shub-Smale model Logical Methods in Computer Science	2011-05-26	Paper
Computability of Fraïssé limits Journal of Symbolic Logic	2011-03-18	Paper
Is it harder to factor a polynomial or to find a root? Transactions of the American Mathematical Society	2010-10-29	Paper
Simple structures with complex symmetry Algebra and Logic	2010-09-25	Paper
Computable fields and Galois theory	2010-09-10	Paper
The basic theory of infinite time register machines Archive for Mathematical Logic	2010-03-02	Paper
Degrees of categoricity of computable structures Archive for Mathematical Logic	2010-01-22	Paper
\(d\)-computable categoricity for algebraic fields Journal of Symbolic Logic	2010-01-07	Paper
Post's problem for ordinal register machines: an explicit approach Annals of Pure and Applied Logic	2009-10-26	Paper
Real Computable Manifolds and Homotopy Groups Lecture Notes in Computer Science	2009-10-22	Paper
Perfect Local Computability and Computable Simulations Logic and Theory of Algorithms	2008-06-19	Paper
An Enhanced Theory of Infinite Time Register Machines Logic and Theory of Algorithms	2008-06-19	Paper
Infinite time computable model theory	2008-04-29	Paper
Order-computable sets Notre Dame Journal of Formal Logic	2008-02-05	Paper
Locally Computable Structures Lecture Notes in Computer Science	2007-11-13	Paper
Post’s Problem for Ordinal Register Machines Lecture Notes in Computer Science	2007-11-13	Paper
The Complexity of Quickly ORM-Decidable Sets Lecture Notes in Computer Science	2007-11-13	Paper
Spectra of structures and relations Journal of Symbolic Logic	2007-03-12	Paper
The Computable Dimension of I-Trees of Infinite Height Algebra and Logic	2006-07-18	Paper
Enumerations in computable structure theory Annals of Pure and Applied Logic	2005-10-26	Paper
The ∀∃-theory of ℛ(≤,∨,∧) is undecidable Transactions of the American Mathematical Society	2004-08-13	Paper
Definable incompleteness and Friedberg splittings Journal of Symbolic Logic	2003-05-29	Paper
Orbits of computably enumerable sets: Low sets can avoid an upper cone Annals of Pure and Applied Logic	2002-12-02	Paper
The \(\Delta_2^0\)-spectrum of a linear order The Journal of Symbolic Logic	2002-09-05	Paper
Torsion-free abelian groups of finite rank and fields of finite transcendence degree	N/A	Paper

Research outcomes over time

This page was built for person: Russell Miller