In this paper, a computably definable predicate in metric structures 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.
Roshandel Tavana, N. (2022). An effective version of definability in metric structures. AUT Journal of Mathematics and Computing, 3(1), 101-111. doi: 10.22060/ajmc.2021.20660.1071
MLA
Nazanin Roshandel Tavana. "An effective version of definability in metric structures". AUT Journal of Mathematics and Computing, 3, 1, 2022, 101-111. doi: 10.22060/ajmc.2021.20660.1071
HARVARD
Roshandel Tavana, N. (2022). 'An effective version of definability in metric structures', AUT Journal of Mathematics and Computing, 3(1), pp. 101-111. doi: 10.22060/ajmc.2021.20660.1071
VANCOUVER
Roshandel Tavana, N. An effective version of definability in metric structures. AUT Journal of Mathematics and Computing, 2022; 3(1): 101-111. doi: 10.22060/ajmc.2021.20660.1071
)