3 citations · 6 across the 18 of their papers we have counts for
18 papers
On Cohesive Products of Fields
Rumen Dimitrov, Valentina Harizanov, Henry J. Klatt +1
We develop the foundations of effective ultraproducts of fields and their Galois groups using the methods of computability theory. These computability-theoretic analogs of ultrapro…
sp-Homogeneous Linear Orderings
Wesley Calvert, Douglas Cenzer, David Gonzalez +2
We study linear orderings expanded by functions for successor and predecessor. The successor and predecessor on linear orderings capture the relatively intrinsically computably enu…
Generically Computable Linear Orderings
Wesley Calvert, Douglas Cenzer, David Gonzalez +1
We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the hierarchy. We focus on linear orderings.…
In Memory of Martin Davis
Wesley Calvert, Valentina Harizanov, Eugenio G. Omodeo +2
The present paper gives an account for the general mathematical reader of the life and work of Martin Davis. Since two rather comprehensive autobiographical accounts and two long b…
Computability in infinite Galois theory and algorithmically random algebraic fields
Wesley Calvert, Valentina Harizanov, Alexandra Shlapentokh
We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of that are random according to our…
Cohesive Powers of Structures
Valentina Harizanov, Keshav Srinivasan
A cohesive power of a structure is an effective analog of the classical ultrapower of a structure. We start with a computable structure, and consider its countable ultrapower over…