{"title":"有限富特征谓词演算之间的虚拟代数同构","authors":"M. G. Peretyat’kin","doi":"10.1007/s10469-022-09666-y","DOIUrl":null,"url":null,"abstract":"<div><div><p>It is proved that every two predicate calculi of finite rich signatures are algebraically virtually isomorphic, i.e., some of their Cartesian extensions are algebraically isomorphic. As an important application, it is stated that for predicate calculi in any two finite rich signatures, there exists a computable isomorphism between their Tarski–Lindenbaum algebras which preserves all model-theoretic properties of algebraic type corresponding to the real practice of research in model theory.</p></div></div>","PeriodicalId":7422,"journal":{"name":"Algebra and Logic","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2022-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Virtual Algebraic Isomorphisms between Predicate Calculi of Finite Rich Signatures\",\"authors\":\"M. G. Peretyat’kin\",\"doi\":\"10.1007/s10469-022-09666-y\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div><p>It is proved that every two predicate calculi of finite rich signatures are algebraically virtually isomorphic, i.e., some of their Cartesian extensions are algebraically isomorphic. As an important application, it is stated that for predicate calculi in any two finite rich signatures, there exists a computable isomorphism between their Tarski–Lindenbaum algebras which preserves all model-theoretic properties of algebraic type corresponding to the real practice of research in model theory.</p></div></div>\",\"PeriodicalId\":7422,\"journal\":{\"name\":\"Algebra and Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2022-05-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Algebra and Logic\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10469-022-09666-y\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Algebra and Logic","FirstCategoryId":"100","ListUrlMain":"https://link.springer.com/article/10.1007/s10469-022-09666-y","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"LOGIC","Score":null,"Total":0}
Virtual Algebraic Isomorphisms between Predicate Calculi of Finite Rich Signatures
It is proved that every two predicate calculi of finite rich signatures are algebraically virtually isomorphic, i.e., some of their Cartesian extensions are algebraically isomorphic. As an important application, it is stated that for predicate calculi in any two finite rich signatures, there exists a computable isomorphism between their Tarski–Lindenbaum algebras which preserves all model-theoretic properties of algebraic type corresponding to the real practice of research in model theory.
期刊介绍:
This bimonthly journal publishes results of the latest research in the areas of modern general algebra and of logic considered primarily from an algebraic viewpoint. The algebraic papers, constituting the major part of the contents, are concerned with studies in such fields as ordered, almost torsion-free, nilpotent, and metabelian groups; isomorphism rings; Lie algebras; Frattini subgroups; and clusters of algebras. In the area of logic, the periodical covers such topics as hierarchical sets, logical automata, and recursive functions.
Algebra and Logic is a translation of ALGEBRA I LOGIKA, a publication of the Siberian Fund for Algebra and Logic and the Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences.
All articles are peer-reviewed.