46 citations · 63 across the 10 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.LO2019
Lowness for isomorphism, countable ideals, and computable traceability
Johanna N. Y. Franklin, Reed Solomon
We show that every countable ideal of degrees that are low for isomorphism is contained in a principal ideal of degrees that are low for isomorphism by adapting an exact pair const…
math.LO2019
Model completeness and relative decidability
Jennifer Chubb, Russell Miller, Reed Solomon
We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A…