{"title":"Bi-intermediate logics of trees and co-trees","authors":"","doi":"10.1016/j.apal.2024.103490","DOIUrl":null,"url":null,"abstract":"<div><p>A bi-Heyting algebra validates the Gödel-Dummett axiom <span><math><mo>(</mo><mi>p</mi><mo>→</mo><mi>q</mi><mo>)</mo><mo>∨</mo><mo>(</mo><mi>q</mi><mo>→</mo><mi>p</mi><mo>)</mo></math></span> iff the poset of its prime filters is a disjoint union of co-trees (i.e., order duals of trees). Bi-Heyting algebras of this kind are called <em>bi-Gödel algebras</em> and form a variety that algebraizes the extension <span><math><mi>bi-GD</mi></math></span> of bi-intuitionistic logic axiomatized by the Gödel-Dummett axiom. In this paper we initiate the study of the lattice <span><math><mi>Λ</mi><mo>(</mo><mi>bi-GD</mi><mo>)</mo></math></span> of extensions of <span><math><mi>bi-GD</mi></math></span>.</p><p>We develop the methods of Jankov-style formulas for bi-Gödel algebras and use them to prove that there are exactly continuum many extensions of <span><math><mi>bi-GD</mi></math></span>. We also show that all these extensions can be uniformly axiomatized by canonical formulas. Our main result is a characterization of the locally tabular extensions of <span><math><mi>bi-GD</mi></math></span>. We introduce a sequence of co-trees, called the <em>finite combs</em>, and show that a logic in <span><math><mi>Λ</mi><mo>(</mo><mi>bi-GD</mi><mo>)</mo></math></span> is locally tabular iff it contains at least one of the Jankov formulas associated with the finite combs. It follows that there exists the greatest nonlocally tabular extension of <span><math><mi>bi-GD</mi></math></span> and consequently, a unique pre-locally tabular extension of <span><math><mi>bi-GD</mi></math></span>. These results contrast with the case of the intermediate logic axiomatized by the Gödel-Dummett axiom, which is known to have only countably many extensions, all of which are locally tabular.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"175 10","pages":"Article 103490"},"PeriodicalIF":0.6000,"publicationDate":"2024-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0168007224000940/pdfft?md5=c7604d9cf135b7d72a099447fc38fed7&pid=1-s2.0-S0168007224000940-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Pure and Applied Logic","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0168007224000940","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0
Abstract
A bi-Heyting algebra validates the Gödel-Dummett axiom iff the poset of its prime filters is a disjoint union of co-trees (i.e., order duals of trees). Bi-Heyting algebras of this kind are called bi-Gödel algebras and form a variety that algebraizes the extension of bi-intuitionistic logic axiomatized by the Gödel-Dummett axiom. In this paper we initiate the study of the lattice of extensions of .
We develop the methods of Jankov-style formulas for bi-Gödel algebras and use them to prove that there are exactly continuum many extensions of . We also show that all these extensions can be uniformly axiomatized by canonical formulas. Our main result is a characterization of the locally tabular extensions of . We introduce a sequence of co-trees, called the finite combs, and show that a logic in is locally tabular iff it contains at least one of the Jankov formulas associated with the finite combs. It follows that there exists the greatest nonlocally tabular extension of and consequently, a unique pre-locally tabular extension of . These results contrast with the case of the intermediate logic axiomatized by the Gödel-Dummett axiom, which is known to have only countably many extensions, all of which are locally tabular.
期刊介绍:
The journal Annals of Pure and Applied Logic publishes high quality papers in all areas of mathematical logic as well as applications of logic in mathematics, in theoretical computer science and in other related disciplines. All submissions to the journal should be mathematically correct, well written (preferably in English)and contain relevant new results that are of significant interest to a substantial number of logicians. The journal also considers submissions that are somewhat too long to be published by other journals while being too short to form a separate memoir provided that they are of particular outstanding quality and broad interest. In addition, Annals of Pure and Applied Logic occasionally publishes special issues of selected papers from well-chosen conferences in pure and applied logic.