Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1908.02403

A Logic for Dually Hemimorphic Semi-Heyting Algebras and its Axiomatic Extensions

Juan M. Cornejo·Hanamantagouda P. Sankappanavar
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we focus on the variety DHMSH of dually hemimorphic semi-Heyting algebras from a logical point of view. Firstly, we present a Hilbert-style axiomatization of a new logic called Dually hemimorphic semi-Heyting logic (DHMSH, for short), as an expansion of semi-intuitionistic logic SI (also called SH) introduced by the first author by adding a weak negation (to be interpreted as a dual hemimorphism). We then prove that it is implicative in the sense of Rasiowa and that it is complete with respect to the variety DHMSH. It is deduced that the logic DHMSH is algebraizable in the sense of Blok and Pigozzi, with the variety DHMSH as its equivalent algebraic semantics and that the lattice of axiomatic extensions of DHMSH is dually isomorphic to the lattice of subvarieties of DHMSH. A new axiomatization for Moisil's logic is also obtained. Secondly, we characterize the axiomatic extensions of DHMSH in which the Deduction Theorem holds. Thirdly, we present several new logics, extending the logic DHMSH, corresponding to several important subvarieties of the variety DHMSH. These include logics corresponding to the varieties generated by two-element, three-element and some four-element dually quasi-De Morgan semi-Heyting algebras, as well as a new axiomatization for the 3-valued Lukasiewiczlogic. Surprisingly, many of these logics turn out to be connexive logics, a few of which are presented in this paper. Fourthly, we present axiomatizations for two infinite sequences of logics namely, De Morgan-Goedel logics and dually pseudocomplemented Goedel logics, Fifthly, axiomatizations are also provided for logics corresponding to many subvarieties of regular dually quasi-De Morgan Stone semi-Heyting algebras, of regular De Morgan semi-Heyting algebras of level 1, and of JI-distributive semi-Heyting algebras of level 1. We conclude the paper with some open problems.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Juan M. Cornejo, Hanamantagouda P. Sankappanavar. 2019-08-07. A Logic for Dually Hemimorphic Semi-Heyting Algebras and its Axiomatic Extensions. https://arxiv.org/abs/1908.02403

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗