3 citations · 6 across the 18 of their papers we have counts for
Showing 2018 · math.LOShow all
3 papers · 2 filters
math.LO2018
Turing Degrees and Automorphism Groups of Substructure Lattices
Rumen Dimitrov, Valentina Harizanov, Andrey Morozov
The study of automorphisms of computable and other structures connects computability theory with classical group theory. Among the noncomputable countable structures, computably en…
math.LO2018★ 2 cited
Strong Jump Inversion
W. Calvert, A. Frolov, V. Harizanov +4
We say that a structure admits \emph{strong jump inversion} provided that for every oracle , if computes for some $\mathcal{C}\cong\mathcal{…
math.LO2018
Generically Computable Equivalence Structures and Isomorphisms
Wesley Calvert, Douglas Cenzer, Valentina Harizanov
We define notions of generically and coarsely computable relations and structures and functions between structures. We investigate the existence and uniqueness of equivalence struc…