1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.LO2008
Index Sets of Computable Structures
Wesley Calvert, Valentina S. Harizanov, Julia F. Knight +1
The \emph{index set} of a computable structure is the set of indices for computable copies of . We determine the complexity of the index sets of various…
math.LO2008★ 1 cited
Comparing Classes of Finite Structures
Wesley Calvert, Desmond Cummins, Sara Miller +1
We introduce a reducibility on classes of structures, essentially a uniform enumeration reducibility. This reducibility is inspired by the Friedman-Stanley paper on using Borel red…