activity
20062023
most citedThe hierarchy of equivalence relations on the natural numbers under computable reducibility

35 citations · 86 across the 22 of their papers we have counts for

collaborators

30 papers

math.LO2023

Computability for the absolute Galois group of

Russell Miller

The absolute Galois group Gal of the field of rational numbers can be presented as a highly computable object, under the notion of…

math.LO2023

Differentially closed fields and universality on a cone

Russell Miller

The class of all countable differentially closed differential fields of characteristic was shown by Marker and the author to be "one jump away" from universal for spectra o…

math.NT2020★ 2 cited

A topological approach to undefinability in algebraic extensions of

Kirsten Eisentraeger, Russell Miller, Caleb Springer +1

For any subset , consider the set of subfields which contain a co-infinite subset that is universal…

math.LO2020

Forcing as a computational process

Joel David Hamkins, Russell Miller, Kameryn J. Williams

We investigate how set-theoretic forcing can be seen as a computational process on the models of set theory. Given an oracle for information about a model of set theory $\langle M,…

math.LO2020★ 1 cited

Interpreting a field in its Heisenberg group

Rachael Alvir, Wesley Calvert, Grant Goodman +6

We improve on and generalize a 1960 result of Maltsev. For a field , we denote by the Heisenberg group with entries in . Maltsev showed that there is a copy of def…

math.LO2019

Effectivizing Lusin's Theorem

Russell Miller

Lusin's Theorem states that, for every Borel-measurable function on and every , there exists a continuous function on which is equal…