<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Amirkabir University of Technology</PublisherName>
				<JournalTitle>AUT Journal of Mathematics and Computing</JournalTitle>
				<Issn>2783-2449</Issn>
				<Volume>3</Volume>
				<Issue>1</Issue>
				<PubDate PubStatus="epublish">
					<Year>2022</Year>
					<Month>02</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>An effective version of definability in metric structures</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>101</FirstPage>
			<LastPage>111</LastPage>
			<ELocationID EIdType="pii">4645</ELocationID>
			
<ELocationID EIdType="doi">10.22060/ajmc.2021.20660.1071</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Nazanin</FirstName>
					<LastName>Roshandel Tavana</LastName>
<Affiliation>Department of Mathematics and Computer Science, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2021</Year>
					<Month>10</Month>
					<Day>12</Day>
				</PubDate>
			</History>
		<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.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">metric model theory</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">TTE</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ajmc.aut.ac.ir/article_4645_b831289d99a122a648db55e2469b565f.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
