自动机表示结构:有限弦情况的综述

IF 0.7 3区数学 Q1 LOGIC

Bulletin of Symbolic Logic Pub Date : 2008-06-01 DOI:10.2178/bsl/1208442827

S. Rubin

{"title":"自动机表示结构:有限弦情况的综述","authors":"S. Rubin","doi":"10.2178/bsl/1208442827","DOIUrl":null,"url":null,"abstract":"Abstract A structure has a (finite-string) automatic presentation if the elements of its domain can be named by finite strings in such a way that the coded domain and the coded atomic operations are recognised by synchronous multitape automata. Consequently, every structure with an automatic presentation has a decidable first-order theory. The problems surveyed here include the classification of classes of structures with automatic presentations, the complexity of the isomorphism problem, and the relationship between definability and recognisability.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"14 1","pages":"169 - 209"},"PeriodicalIF":0.7000,"publicationDate":"2008-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.2178/bsl/1208442827","citationCount":"109","resultStr":"{\"title\":\"Automata Presenting Structures: A Survey of the Finite String Case\",\"authors\":\"S. Rubin\",\"doi\":\"10.2178/bsl/1208442827\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract A structure has a (finite-string) automatic presentation if the elements of its domain can be named by finite strings in such a way that the coded domain and the coded atomic operations are recognised by synchronous multitape automata. Consequently, every structure with an automatic presentation has a decidable first-order theory. The problems surveyed here include the classification of classes of structures with automatic presentations, the complexity of the isomorphism problem, and the relationship between definability and recognisability.\",\"PeriodicalId\":55307,\"journal\":{\"name\":\"Bulletin of Symbolic Logic\",\"volume\":\"14 1\",\"pages\":\"169 - 209\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2008-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.2178/bsl/1208442827\",\"citationCount\":\"109\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Bulletin of Symbolic Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.2178/bsl/1208442827\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Symbolic Logic","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.2178/bsl/1208442827","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"LOGIC","Score":null,"Total":0}

引用次数: 109

摘要

如果一个结构的域的元素可以用有限的字符串来命名，那么该结构就具有(有限字符串)的自动表示，并且该结构的编码域和编码原子操作可以被同步多磁带自动机识别。因此，每一个具有自动表示的结构都有一个可决定的一阶理论。本文研究的问题包括自动表示结构的分类、同构问题的复杂性以及可定义性和可识别性之间的关系。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Automata Presenting Structures: A Survey of the Finite String Case

Abstract A structure has a (finite-string) automatic presentation if the elements of its domain can be named by finite strings in such a way that the coded domain and the coded atomic operations are recognised by synchronous multitape automata. Consequently, every structure with an automatic presentation has a decidable first-order theory. The problems surveyed here include the classification of classes of structures with automatic presentations, the complexity of the isomorphism problem, and the relationship between definability and recognisability.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Bulletin of Symbolic Logic 数学-数学

CiteScore

0.60

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The Bulletin of Symbolic Logic was established in 1995 by the Association for Symbolic Logic to provide a journal of high standards that would be both accessible and of interest to as wide an audience as possible. It is designed to cover all areas within the purview of the ASL: mathematical logic and its applications, philosophical and non-classical logic and its applications, history and philosophy of logic, and philosophy and methodology of mathematics.