2 citations · 7 across the 12 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.LO2019★ 1 cited
Coding in the automorphism group of a computably categorical structure
Dan Turetsky
Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a que…
math.LO2019★ 2 cited
Relationships between computability-theoretic properties of problems
Rod Downey, Noam Greenberg, Matthew Harrison-Trainor +2
A problem is a multivalued function from a set of \emph{instances} to a set of \emph{solutions}. We consider only instances and solutions coded by sets of integers. A problem admit…