SearcharxivSearch

arXiv · 2511.22127

Connexive logics and connexive semi-Heyting algebras

Abstract

In this paper, we define and investigate a connexive logic, called 'Connexive semi-Heyting logic' (\mathcal{CSH} for short) and a new subvariety CSH of the variety SH of semi-Heyting algebras. It is shown that the logic \mathcal{CSH} is implicative in the sense of Rasiowa, and is algebraizable with CSH as an equivalent algebraic semantics (in the sense of Blok and Pigozzi). We also introduce the logics \mathcal{AT}i and \mathcal{BT}i, i = 1, 2, along with the subvarieties ATi and BTi, i = 1, 2, of SH. It is then shown that AT1 = AT2 and CSH = BT1 \subset BT2 \subset AT1. A 3-valued connexive semi-Heyting logic \mathcal{CSH}3 and its equivalent algebraic semantics CSH3 are introduced and axiomatized; and it is then shown that CSH3 is deductively equivalent to the 3-valued intuitionistic logic. New characterizations of anti-Boolean semi-Heyting algebras are given. We show that BT2 \cap SHc = V(2), and SHc \subset AT1, where SHc is defined by x \to y = y \to x. It is proved that the identity (AT1) is equivalent to the identity x* \to y* = y* \to x* (* being the pseudocomplement) in StSH and also is equivalent to 0 \to 1 = 0 in SH. We show that AT1 \cap EX \subset BT1, where EX is defined by x \to (y \to z) = y \to (x \to z). The paper concludes with some further remarks, mentions some open problems for future research and proposes two new principles to be considered as Connexive Theses.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Juan M. Cornejo, Hanamantagouda P. Sankappanavar. 2025-11-27. Connexive logics and connexive semi-Heyting algebras. https://arxiv.org/abs/2511.22127

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