{"title":"Computable paradoxical decompositions","authors":"Karol Duda, A. Ivanov","doi":"10.1142/s0218196722500400","DOIUrl":null,"url":null,"abstract":"We prove a computable version of Hall’s Harem theorem and apply it to computable versions of Tarski’s alternative theorem.","PeriodicalId":13615,"journal":{"name":"Int. J. Algebra Comput.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Algebra Comput.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s0218196722500400","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
We prove a computable version of Hall’s Harem theorem and apply it to computable versions of Tarski’s alternative theorem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
