{"title":"Wreath Products of Semigroups and Plotkin’s Problem","authors":"A. N. Shevlyakov","doi":"10.1007/s10469-024-09757-y","DOIUrl":null,"url":null,"abstract":"<p>We prove that the wreath product <i>C</i> = <i>A</i> ≀ <i>B</i> of a semigroup A with zero and an infinite cyclic semigroup B is <b>q</b><sub><i>ω</i></sub>-compact (logically Noetherian). Our result partially solves I. Plotkin‘s problem for wreath products.</p>","PeriodicalId":7422,"journal":{"name":"Algebra and Logic","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2024-10-04","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-024-09757-y","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0
Abstract
We prove that the wreath product C = A ≀ B of a semigroup A with zero and an infinite cyclic semigroup B is qω-compact (logically Noetherian). Our result partially solves I. Plotkin‘s problem for wreath products.
期刊介绍:
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.