default search action
Russell G. Miller
Person information
- affiliation: City University of New York, Queens College, Mathematics Department, NY, USA
- affiliation: City University of New York, CUNY Graduate Center, NY, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j35]Kirsten Eisenträger
, Russell Miller
A Topological Approach to Undefinability in Algebraic Extensions of. Bull. Symb. Log. 29(4): 626-655 (2023) - [c20]Russell G. Miller:
Direct Construction of Scott Ideals. CiE 2023: 23-34 - 2022
- [j34]Russell G. Miller
On existential definitions of c.e. subsets of rings of functions of characteristic 0. Ann. Pure Appl. Log. 173(4): 103076 (2022) - [j33]Russell G. Miller:
Effectivizing Lusin's Theorem. J. Log. Anal. 14 (2022) - [j32]Russell G. Miller
Htp-Complete Rings of rational numbers. J. Symb. Log. 87(1): 252-272 (2022) - [j31]Rachael Alvir, Wesley Calvert, Grant Goodman, Valentina S. Harizanov, Julia F. Knight, Russell G. Miller, Andrey S. Morozov, Alexandra A. Soskova
Interpreting a field in its Heisenberg Group. J. Symb. Log. 87(3): 1215-1230 (2022) - 2021
- [j30]Jennifer Chubb
Model completeness and relative decidability. Arch. Math. Log. 60(6): 721-735 (2021) - [c19]Russell Miller:
Computable Procedures for Fields. CiE 2021: 342-352 - 2020
- [c18]Russell Miller:
Non-coding Enumeration Operators. CiE 2020: 112-123
2010 – 2019
- 2019
- [j29]Russell Miller, Victor Ocasio González
Degree spectra of real closed fields. Arch. Math. Log. 58(3-4): 387-411 (2019) - [j28]Russell Miller:
Isomorphism and classification for countable structures. Comput. 8(2): 99-117 (2019) - [c17]Iskander Sh. Kalimullin
Degree Spectra for Transcendence in Fields. CiE 2019: 205-216 - 2018
- [j27]Russell G. Miller, Bjorn Poonen, Hans Schoutens, Alexandra Shlapentokh:
A Computable Functor from graphs to Fields. J. Symb. Log. 83(1): 326-348 (2018) - [j26]Matthew Harrison-Trainor, Russell G. Miller, Antonio Montalbán:
Borel Functors and Infinitary Interpretations. J. Symb. Log. 83(4): 1434-1456 (2018) - [j25]Karen M. Lange, Russell G. Miller, Rebecca M. Steiner:
Classifications of Computable Structures. Notre Dame J. Formal Log. 59(1): 35-59 (2018) - [e1]Florin Manea, Russell G. Miller, Dirk Nowotka:
Sailing Routes in the World of Computation - 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 - August 3, 2018, Proceedings. Lecture Notes in Computer Science 10936, Springer 2018, ISBN 978-3-319-94417-3 [contents] - 2017
- [j24]David Marker, Russell G. Miller:
Turing degree spectra of differentially Closed Fields. J. Symb. Log. 82(1): 1-25 (2017) - [j23]Matthew Harrison-Trainor, Alexander G. Melnikov
Computable Functors and Effective interpretability. J. Symb. Log. 82(1): 77-97 (2017) - [c16]Russell Miller:
Revisiting Uniform Computable Categoricity: For the Sixtieth Birthday of Prof. Rod Downey. Computability and Complexity 2017: 254-270 - [c15]Russell G. Miller:
Computable Transformations of Structures. CiE 2017: 88-97 - 2016
- [j22]Russell G. Miller, Keng Meng Ng
Finitary Reducibility on Equivalence Relations. J. Symb. Log. 81(4): 1225-1254 (2016) - [c14]Russell Miller:
Baire Category Theory and Hilbert's Tenth Problem Inside \mathbb Q Q. CiE 2016: 343-352 - 2014
- [j21]Egor Ianovski
Complexity of Equivalence Relations and Preorders from Computability Theory. J. Symb. Log. 79(3): 859-881 (2014) - [c13]Rumen D. Dimitrov, Valentina S. Harizanov, Russell G. Miller, K. J. Mourad:
Isomorphisms of Non-Standard Fields and Ash's Conjecture. CiE 2014: 143-152 - [c12]Russell G. Miller, Reed Solomon, Rebecca M. Steiner:
On the Effectiveness of Symmetry Breaking. CiE 2014: 314-323 - 2013
- [j20]Russell G. Miller, Hans Schoutens:
Computably Categorical Fields via Fermat's Last Theorem. Comput. 2(1): 51-65 (2013) - [j19]Ekaterina B. Fokina
Classes of structures with universe a subset of ω1. J. Log. Comput. 23(6): 1249-1265 (2013) - [c11]Johanna N. Y. Franklin, Asher M. Kach, Russell G. Miller, Reed Solomon:
Local Computability for Ordinals. CiE 2013: 161-170 - 2012
- [j18]Samuel Coskey, Joel David Hamkins
The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility. Comput. 1(1): 15-38 (2012) - [j17]Andrey N. Frolov, Iskander Sh. Kalimullin
Spectra of highn and non-lown degrees. J. Log. Comput. 22(4): 755-777 (2012) - [i2]Russell G. Miller, Hans Schoutens:
Computably Categorical Fields via Fermat's Last Theorem. CoRR abs/1212.6751 (2012) - 2011
- [j16]Wesley Calvert
Noncomputable functions in the Blum-Shub-Smale model. Log. Methods Comput. Sci. 7(2) (2011) - [j15]Russell Miller:
An introduction to computable model theory on groups and fields. Groups Complex. Cryptol. 3(1): 25-45 (2011) - [j14]Barbara F. Csima, Valentina S. Harizanov, Russell G. Miller, Antonio Montalbán:
Computability of Fraïssé limits. J. Symb. Log. 76(1): 66-93 (2011) - [j13]Russell Miller:
Low5 Boolean subalgebras and computable copies. J. Symb. Log. 76(3): 1061-1074 (2011) - [c10]Russell Miller, Alexey Ovchinnikov:
Adapting Rabin's Theorem for Differential Fields. CiE 2011: 211-220 - [i1]Wesley Calvert, Russell G. Miller, Jennifer Chubb Reimann:
The Distance Function on a Computable Graph. CoRR abs/1111.2480 (2011) - 2010
- [j12]Ekaterina B. Fokina
Degrees of categoricity of computable structures. Arch. Math. Log. 49(1): 51-67 (2010) - [j11]Merlin Carl, Tim Fischbach, Peter Koepke, Russell G. Miller, Miriam Nasfi, Gregor Weckbecker:
The basic theory of infinite time register machines. Arch. Math. Log. 49(2): 249-273 (2010) - [c9]Wesley Calvert
The Cardinality of an Oracle in Blum-Shub-Smale Computation. CCA 2010: 56-66
2000 – 2009
- 2009
- [j10]Joel David Hamkins
Post's Problem for ordinal register machines: An explicit approach. Ann. Pure Appl. Log. 160(3): 302-309 (2009) - [j9]Russell Miller:
d-computable categoricity for algebraic fields. J. Symb. Log. 74(4): 1325-1351 (2009) - [c8]Andrey N. Frolov, Iskander Sh. Kalimullin
Spectra of Algebraic Fields and Subfields. CiE 2009: 232-241 - [c7]Wesley Calvert, Russell G. Miller:
Real Computable Manifolds and Homotopy Groups. UC 2009: 98-109 - 2008
- [c6]Peter Koepke, Russell G. Miller:
An Enhanced Theory of Infinite Time Register Machines. CiE 2008: 306-315 - [c5]Russell Miller, Dustin Mulcahey:
Perfect Local Computability and Computable Simulations. CiE 2008: 447-456 - 2007
- [j8]Valentina S. Harizanov, Russell G. Miller:
Spectra of structures and relations. J. Symb. Log. 72(1): 324-348 (2007) - [j7]Denis R. Hirschfeldt, Russell G. Miller, Sergei Podzorov:
Order-Computable Sets. Notre Dame J. Formal Log. 48(3): 317-347 (2007) - [c4]Joel David Hamkins
Post's Problem for Ordinal Register Machines. CiE 2007: 358-367 - [c3]Joel David Hamkins
The Complexity of Quickly ORM-Decidable Sets. CiE 2007: 488-496 - [c2]Russell G. Miller:
Locally Computable Structures. CiE 2007: 575-584 - 2005
- [j6]Sergei S. Goncharov, Valentina S. Harizanov, Julia F. Knight, Charles F. D. McCoy, Russell G. Miller, Reed Solomon:
Enumerations in computable structure theory. Ann. Pure Appl. Log. 136(3): 219-246 (2005) - [j5]Russell Miller:
The computable dimension of trees of infinite height. J. Symb. Log. 70(1): 111-141 (2005) - [j4]Steffen Lempp, Charles F. D. McCoy, Russell G. Miller, Reed Solomon:
Computable categoricity of trees of finite height. J. Symb. Log. 70(1): 151-215 (2005) - 2002
- [j3]Russell Miller:
Orbits of computably enumerable sets: low sets can avoid an upper cone. Ann. Pure Appl. Log. 118(1-2): 61-85 (2002) - [j2]Russell Miller:
Definable Incompleteness and Friedberg Splittings. J. Symb. Log. 67(2): 679-696 (2002) - [c1]Richard Schroeppel, Cheryl L. Beaver, Rita Gonzales, Russell Miller, Timothy Draelos:
A Low-Power Design for an Elliptic Curve Digital Signature Chip. CHES 2002: 366-380 - 2001
- [j1]Russell Miller:
The delta02-Spectrum of A Linear Order. J. Symb. Log. 66(2): 470-486 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: