Russell G. Miller

Orcid: 0000-0001-5454-6736

Affiliations:
  • City University of New York, Queens College, Mathematics Department, NY, USA
  • City University of New York, CUNY Graduate Center, NY, USA


According to our database1, Russell G. Miller authored at least 56 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A Topological Approach to Undefinability in Algebraic Extensions of.
Bull. Symb. Log., December, 2023

Direct Construction of Scott Ideals.
Proceedings of the Unity of Logic and Computation, 2023

2022
Htp-Complete Rings of rational numbers.
J. Symb. Log., 2022

Interpreting a field in its Heisenberg Group.
J. Symb. Log., 2022

Effectivizing Lusin's Theorem.
J. Log. Anal., 2022

On existential definitions of c.e. subsets of rings of functions of characteristic 0.
Ann. Pure Appl. Log., 2022

2021
Model completeness and relative decidability.
Arch. Math. Log., 2021

Computable Procedures for Fields.
Proceedings of the Connecting with Computability, 2021

2020
Non-coding Enumeration Operators.
Proceedings of the Beyond the Horizon of Computability, 2020

2019
Isomorphism and classification for countable structures.
Comput., 2019

Degree spectra of real closed fields.
Arch. Math. Log., 2019

Degree Spectra for Transcendence in Fields.
Proceedings of the Computing with Foresight and Industry, 2019

2018
Classifications of Computable Structures.
Notre Dame J. Formal Log., 2018

A Computable Functor from graphs to Fields.
J. Symb. Log., 2018

Borel Functors and Infinitary Interpretations.
J. Symb. Log., 2018

2017
Turing degree spectra of differentially Closed Fields.
J. Symb. Log., 2017

Computable Functors and Effective interpretability.
J. Symb. Log., 2017

Computable Transformations of Structures.
Proceedings of the Unveiling Dynamics and Complexity, 2017

Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey.
Proceedings of the Computability and Complexity, 2017

2016
Finitary Reducibility on Equivalence Relations.
J. Symb. Log., 2016

Baire Category Theory and Hilbert's Tenth Problem Inside \mathbb Q Q.
Proceedings of the Pursuit of the Universal - 12th Conference on Computability in Europe, 2016

2014
Complexity of Equivalence Relations and Preorders from Computability Theory.
J. Symb. Log., 2014

On the Effectiveness of Symmetry Breaking.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

Isomorphisms of Non-Standard Fields and Ash's Conjecture.
Proceedings of the Language, Life, Limits - 10th Conference on Computability in Europe, 2014

2013
Classes of structures with universe a subset of <i>ω</i><sub>1</sub>.
J. Log. Comput., 2013

Computably Categorical Fields via Fermat's Last Theorem.
Comput., 2013

Local Computability for Ordinals.
Proceedings of the Nature of Computation. Logic, Algorithms, Applications, 2013

2012
Spectra of high<i><sub>n</sub></i> and non-low<i><sub>n</sub></i> degrees.
J. Log. Comput., 2012

The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility.
Comput., 2012

2011
Low<sub>5</sub> Boolean subalgebras and computable copies.
J. Symb. Log., 2011

Computability of Fraïssé limits.
J. Symb. Log., 2011

An introduction to computable model theory on groups and fields.
Groups Complex. Cryptol., 2011

The Distance Function on a Computable Graph
CoRR, 2011

Noncomputable functions in the Blum-Shub-Smale model
Log. Methods Comput. Sci., 2011

Adapting Rabin's Theorem for Differential Fields.
Proceedings of the Models of Computation in Context, 2011

2010
The Cardinality of an Oracle in Blum-Shub-Smale Computation
Proceedings of the Proceedings Seventh International Conference on Computability and Complexity in Analysis, 2010

Degrees of categoricity of computable structures.
Arch. Math. Log., 2010

The basic theory of infinite time register machines.
Arch. Math. Log., 2010

2009
d-computable categoricity for algebraic fields.
J. Symb. Log., 2009

Post's Problem for ordinal register machines: An explicit approach.
Ann. Pure Appl. Log., 2009

Real Computable Manifolds and Homotopy Groups.
Proceedings of the Unconventional Computation, 8th International Conference, 2009

Spectra of Algebraic Fields and Subfields.
Proceedings of the Mathematical Theory and Computational Practice, 2009

2008
Perfect Local Computability and Computable Simulations.
Proceedings of the Logic and Theory of Algorithms, 2008

An Enhanced Theory of Infinite Time Register Machines.
Proceedings of the Logic and Theory of Algorithms, 2008

2007
Order-Computable Sets.
Notre Dame J. Formal Log., 2007

Spectra of structures and relations.
J. Symb. Log., 2007

Locally Computable Structures.
Proceedings of the Computation and Logic in the Real World, 2007

Post's Problem for Ordinal Register Machines.
Proceedings of the Computation and Logic in the Real World, 2007

The Complexity of Quickly ORM-Decidable Sets.
Proceedings of the Computation and Logic in the Real World, 2007

2005
The computable dimension of trees of infinite height.
J. Symb. Log., 2005

Computable categoricity of trees of finite height.
J. Symb. Log., 2005

Enumerations in computable structure theory.
Ann. Pure Appl. Log., 2005

2002
Definable Incompleteness and Friedberg Splittings.
J. Symb. Log., 2002

Orbits of computably enumerable sets: low sets can avoid an upper cone.
Ann. Pure Appl. Log., 2002

A Low-Power Design for an Elliptic Curve Digital Signature Chip.
Proceedings of the Cryptographic Hardware and Embedded Systems, 2002

2001
The delta<sup>0</sup><sub>2</sub>-Spectrum of A Linear Order.
J. Symb. Log., 2001


  Loading...