A Lopez-Escobar Theorem for Continuous Domains
Abstract
We prove an effective version of the Lopez-Escobar theorem for continuous domains. Let be the set of countable structures with universe in vocabulary topologized by the Scott topology. We show that an invariant set is in the effective Borel hierarchy of this topology if and only if it is definable by a - formula, a positive formula in the infinitary logic . As a corollary of this result we obtain a new pullback theorem for positive computable embeddings: Let be positively computably embeddable in by , then for every formula in the vocabulary of there is a formula in the vocabulary of such that for all , if and only if . We use this to obtain new results on the possibility of positive computable embeddings into the class of linear orderings.
Keywords
Cite
@article{arxiv.2301.09940,
title = {A Lopez-Escobar Theorem for Continuous Domains},
author = {Nikolay Bazhenov and Ekaterina Fokina and Dino Rossegger and Alexandra A. Soskova and Stefan V. Vatev},
journal= {arXiv preprint arXiv:2301.09940},
year = {2025}
}
Comments
17 pages