{"title":"论自由伪补分布晶格的普遍理论","authors":"Luca Carai, Tommaso Moraschini","doi":"arxiv-2409.03640","DOIUrl":null,"url":null,"abstract":"It is shown that the universal theory of the free pseudocomplemented\ndistributive lattice is decidable and a recursive axiomatization is presented.\nThis contrasts with the case of the full elementary theory of the finitely\ngenerated free algebras which is known to be undecidable. As a by-product, a\ndescription of the pseudocomplemented distributive lattices that can be\nembedded into the free algebra is also obtained.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the universal theory of the free pseudocomplemented distributive lattice\",\"authors\":\"Luca Carai, Tommaso Moraschini\",\"doi\":\"arxiv-2409.03640\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is shown that the universal theory of the free pseudocomplemented\\ndistributive lattice is decidable and a recursive axiomatization is presented.\\nThis contrasts with the case of the full elementary theory of the finitely\\ngenerated free algebras which is known to be undecidable. As a by-product, a\\ndescription of the pseudocomplemented distributive lattices that can be\\nembedded into the free algebra is also obtained.\",\"PeriodicalId\":501306,\"journal\":{\"name\":\"arXiv - MATH - Logic\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - MATH - Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2409.03640\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - MATH - Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.03640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the universal theory of the free pseudocomplemented distributive lattice
It is shown that the universal theory of the free pseudocomplemented
distributive lattice is decidable and a recursive axiomatization is presented.
This contrasts with the case of the full elementary theory of the finitely
generated free algebras which is known to be undecidable. As a by-product, a
description of the pseudocomplemented distributive lattices that can be
embedded into the free algebra is also obtained.