{"title":"本质上不可判定的弱串联理论，第二部分","authors":"Juvenal Murwanashyaka","doi":"10.1007/s00153-023-00898-y","DOIUrl":null,"url":null,"abstract":"<div><p>We show that we can interpret concatenation theories in arithmetical theories without coding sequences by identifying binary strings with <span>\\(2\\times 2\\)</span> matrices with determinant 1.\n</p></div>","PeriodicalId":48853,"journal":{"name":"Archive for Mathematical Logic","volume":"63 3-4","pages":""},"PeriodicalIF":0.3000,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s00153-023-00898-y.pdf","citationCount":"0","resultStr":"{\"title\":\"Weak essentially undecidable theories of concatenation, part II\",\"authors\":\"Juvenal Murwanashyaka\",\"doi\":\"10.1007/s00153-023-00898-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We show that we can interpret concatenation theories in arithmetical theories without coding sequences by identifying binary strings with <span>\\\\(2\\\\times 2\\\\)</span> matrices with determinant 1.\\n</p></div>\",\"PeriodicalId\":48853,\"journal\":{\"name\":\"Archive for Mathematical Logic\",\"volume\":\"63 3-4\",\"pages\":\"\"},\"PeriodicalIF\":0.3000,\"publicationDate\":\"2023-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s00153-023-00898-y.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Archive for Mathematical Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00153-023-00898-y\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Arts and Humanities\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Archive for Mathematical Logic","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s00153-023-00898-y","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Arts and Humanities","Score":null,"Total":0}
Weak essentially undecidable theories of concatenation, part II
We show that we can interpret concatenation theories in arithmetical theories without coding sequences by identifying binary strings with \(2\times 2\) matrices with determinant 1.
期刊介绍：
The journal publishes research papers and occasionally surveys or expositions on mathematical logic. Contributions are also welcomed from other related areas, such as theoretical computer science or philosophy, as long as the methods of mathematical logic play a significant role. The journal therefore addresses logicians and mathematicians, computer scientists, and philosophers who are interested in the applications of mathematical logic in their own field, as well as its interactions with other areas of research.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
