An effective version of definability in metric structures | ||
| AUT Journal of Mathematics and Computing | ||
| مقاله 11، دوره 3، شماره 1، اردیبهشت 2022، صفحه 101-111 اصل مقاله (349.12 K) | ||
| نوع مقاله: Original Article | ||
| شناسه دیجیتال (DOI): 10.22060/ajmc.2021.20660.1071 | ||
| نویسنده | ||
| Nazanin Roshandel Tavana* | ||
| Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran | ||
| چکیده | ||
| 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. | ||
| کلیدواژهها | ||
| Metric model theory؛ TTE | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 1,345 تعداد دریافت فایل اصل مقاله: 877 |
||
| تعداد نشریات | 9 |
| تعداد شمارهها | 455 |
| تعداد مقالات | 5,771 |
| تعداد مشاهده مقاله | 8,375,977 |
| تعداد دریافت فایل اصل مقاله | 6,935,311 |