The embedding preserves computable Scott sentences and their complexities between graphs and labeled trees, making bounded Scott rank subclasses of the image Borel.
Relative to any non-arithmetic set
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Computable Scott Sentences and the Friedman-Stanley embedding
The embedding preserves computable Scott sentences and their complexities between graphs and labeled trees, making bounded Scott rank subclasses of the image Borel.