Scott Ranks of Classifications of the Admissibility Equivalence Relation
Logic
2017-12-05 v1
Abstract
Let be a recursive language. Let be the set of -structures with domain . Let be a function with the property that for all , if and only if . Then there is some so that .
Cite
@article{arxiv.1712.00847,
title = {Scott Ranks of Classifications of the Admissibility Equivalence Relation},
author = {William Chan and Matthew Harrison-Trainor and Andrew Marks},
journal= {arXiv preprint arXiv:1712.00847},
year = {2017}
}