SearcharxivSearch

arXiv · 2210.10387

Regular Double $p$-Algebras: A converse to a Katri\v{n}\'{a}k's Theorem, and Applications

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}$.

Explore related subjects

Keep this discovery

BibTeXRIS

Juan M. Cornejo, Michael Kinyon, Hanamantagouda P. Sankappanavar. 2022-10-19. Regular Double $p$-Algebras: A converse to a Katri\v{n}\'{a}k's Theorem, and Applications. https://arxiv.org/abs/2210.10387

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO