An effective version of definability in metric structures

Document Type : Original Article

Author

Department of Mathematics and computer science, Amirkabir University of technology

Abstract

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.

Keywords

Main Subjects

AUT Journal of Mathematics and Computing
Volume 3, Issue 1
February 2022
Pages 101-111

Files

Share

How to cite

Statistics