An effective version of definability in metric model theory
arXiv:2003.02087
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.
It was not accepted