An effective version of definability in metric structures

Document Type : Original Article


Department of Mathematics and computer science, Amirkabir University of technology


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.


Main Subjects