Papers
Topics
Authors
Recent
Search
2000 character limit reached

Regular Double $p$-Algebras: A converse to a Katriňák's Theorem, and Applications

Published 19 Oct 2022 in math.LO | (2210.10387v1)

Abstract: In 1973, Katri\v{n}\'{a}k proved that regular double $p$-algebras can be regarded as (regular) double Heyting algebras by ingeniously constructing binary terms for the Heying implication and its dual in terms of pseudocomplement and its dual. In this paper we prove a converse to the Katri\v{n}\'{a}k's theorem, in the sense that in the variety RDPCH of regular dually pseudocomplemented Heyting algebras, the implication operation $\to$ satisfies the Katri\v{n}\'{a}k's formula. As applications of this result together with the above-mentioned Katri\v{n}\'{a}k's theorem, we show that the varieties RDBLP, RDPCH, RPCH$d$ and RDBLH of regular double $p$-algebras, regular dually pseudocomplemented Heyting algebras, regular pseudocomplemented dual Heyting algebras, and regular double Heyting algebras, respectively, are term-equivalent to each other and also that the varieties RDMP, RDMH, RDMDBLH, RDMDBLP of regular De Morgan $p$-algebras, regular De Morgan Heyting algebras, regular De Morgan double Heyting algebras, and regular De Morgan double $p$-algebras, respectively, are also term equivalent to each other. From these results and recent results of Adams, Sankappanavar and vaz de Carvalho, we deduce that the lattices of subvarieties of all these varieties have cardinality $2{\aleph_0}$. We then define new logics, RDPCH, RPCHd, and RDMH, and show that they are algebraizable with RDPCH, RPCH$d$ and RDMH, respectively as their equivalent algebraic semantics. It is also deduced that the lattices of extensions of all of the above mentioned logics have cardinality $2{\aleph_0}$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.