Bounds on Continuous Scott Rank
Logic
2019-08-02 v1
Abstract
An analog of Nadel's effective bound for the continuous Scott rank of metric structures, developed by Ben Yaacov, Doucha, Nies, and Tsankov, will be established: Let be a language of continuous logic with code . Let be a weak modulus of uniform continuity with code . Let be a countable -pre-structure. Let denote the completion structure of . Then , the Church-Kleene ordinal relative to .
Cite
@article{arxiv.1908.00179,
title = {Bounds on Continuous Scott Rank},
author = {William Chan and Ruiyuan Chen},
journal= {arXiv preprint arXiv:1908.00179},
year = {2019}
}