Search arXivSearch

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

Loops, Inverse Limits and Non-Determinism

We introduce an operator on problems in Weihrauch complexity, which we call the infinite loop or inverse limit, and which corresponds to an infinite compositional product. This operation arises naturally whenever one implements algorithms that produce a sequence of results in an infinite loop, using some fixed subroutine. We prove that the corresponding operator is monotone with respect to (strong) Weihrauch reducibility but that it is not a closure operator. One of our findings is that weak Kőnig's lemma is closed under infinite loops, which implies that the class of non-deterministically computable problems is also closed under this operation. Consequently, this class allows for a high degree of flexibility in programming. As our main technical tools, we present an injective version of the recursion theorem and an infinitary version of the so-called independent choice theorem. We also show that, in general, the infinite loop operator is more powerful than the composition of the diamond operator followed by the parallelization operator. However, in many practical scenarios, these compositions yield a result, which coincides with the application of the infinite loop operator. Finally, we discuss the special situation of loops for single-valued problems and for problems on Turing degrees.

math.LO

Scott topologies on meet-continuous domains

We study Scott products and sobriety of countable meet-continuous domains, meaning meet-continuous dcpos without any additional continuity or least-element assumption. Using the complete-lattice test-family theorem of Xu and Ji, we prove finite-product equality for those domains that are $L$-dcpos, and for the weaker class whose principal ideals have suprema of all nonempty subsets. For an arbitrary family of nonempty countable meet-continuous $L$-dcpos, we prove that the Scott topology on the order product equals the product of the factor Scott topologies if and only if only finitely many factors lack a least element. We also establish sobriety under bounded completeness and under additional common-upper-bound conditions. Assuming square-product equality, sobriety is characterized by Scott closedness of common-upper-bound sections associated with irreducible Scott-closed sets, with an equivalent sequential formulation in the countable case. Two extraction lemmas extend to meet-semilattice dcpos. The finite-product and sobriety questions for general countable meet-continuous domains remain unresolved here.

math.LO

Randomized Borel $(2d+1)$-coloring of digraphs

Let $G$ be a Borel digraph with maximum out-degree $d \in \mathbb{N}$. We show that $G$ admits a random Borel $(2d+1)$-coloring for which every edge is almost surely not monochromatic. This gives a simpler proof of a recent result of Pelayo-Gómez: such a graph $G$ admits a measurable proper $(2d+1)$-coloring with respect to any Borel probability measure on $V(G)$. Our proof is an adaptation of Pelayo-Gómez's proof to the randomized Borel setting.

math.LO