An effective version of definability in metric model theory
Logic in Computer Science
2020-11-12 v2
Abstract
In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every definable predicate in these structures is computable.
Keywords
Cite
@article{arxiv.2003.02087,
title = {An effective version of definability in metric model theory},
author = {Nazanin Roshandel Tavana},
journal= {arXiv preprint arXiv:2003.02087},
year = {2020}
}
Comments
It was not accepted