SearcharxivSearch

arXiv · 1510.00892

Order in Implication Zroupoids

Abstract

The variety $\mathbf{I}$ of implication zroupoids was defined and investigated by Sankappanavar ([7]) as a generalization of De Morgan algebras. Also, in [7], several new subvarieties of $\mathbf{I}$ were introduced, including the subvariety $\mathbf{I_{2,0}}$, defined by the identity: $x" \approx x$, which plays a crucial role in this paper. Several more new subvarieties of $\mathbf{I}$, including the subvariety $\mathbf{SL}$ of semilattices with a least element $0$, are studied in [3], and an explicit description of semisimple subvarieties of $\mathbf{I}$ is given in [5]. It is well known that the operation $\land$ induces a partial order ($\sqsubseteq$) in the variety $\mathbf{SL}$ and also in the variety $\mathbf{DM}$ of De Morgan algebras. As both $\mathbf{SL}$ and $\mathbf{DM}$ are subvarieties of $\mathbf{I}$ and the definition of partial order can be expressed in terms of the implication and the constant, it is but natural to ask whether the relation $\sqsubseteq$ (now defined) on $\mathbf{I}$ is actually a partial order in some (larger) subvariety of $\mathbf{I}$ that includes $\mathbf{SL}$ and $\mathbf{DM}$. The purpose of the present paper is two-fold: Firstly, a complete answer is given to the above mentioned problem. Indeed, our first main theorem shows that the variety $\mathbf{I_{2,0}}$ is a maximal subvariety of $\mathbf{I}$ with respect to the property that the relation $\sqsubseteq$ is a partial order on its members. In view of this result, one is then naturally led to consider the problem of determining the number of non-isomorphic algebras in $\mathbf{I_{2,0}}$ that can be defined on an $n$-element chain (herein called $\mathbf{I_{2,0}}$-chains), $n$ being a natural number. Secondly, we answer this problem in our second main theorem, which says that, for each $n \in \mathbb{N}$, there are exactly $n$ nonisomorphic $\mathbf{I_{2,0}}$-chains of size $n$.

Explore related subjects

Keep this discovery

BibTeXRIS

Juan M. Cornejo, Hanamantagouda P. Sankappanavar. 2015-10-04. Order in Implication Zroupoids. https://arxiv.org/abs/1510.00892

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