SearcharxivSearch

arXiv · 2001.06150

Implication Zroupoids and Birkhoff Systems

Abstract

An algebra $A = \langle A, \to, 0 \rangle$, where $\to$ is binary and $0$ is a constant, is called an implication zroupoid (I-zroupoid, for short) if A satisfies the identities: $(x \to y) \to z \approx ((z' \to x) \to (y \to z)')'$, where $x' := x \to 0$, and $0'' \approx 0$. These algebras generalize De Morgan algebras and $\lor$-semilattices with zero. Let I denote the variety of implication zroupoids. For details on the motivation leading to these algebras, we refer the reader to [San12] (or the relevant papers mentioned at the end of this paper). The investigations into the structure of the lattice of subvarieties of I, begun in [San12], have continued in [CS16a, CS16b, CS17a, CS17b, CS18a, CS18b, CS19] and [GSV19]. The present paper is a sequel to this series of papers and is devoted to making further contributions to the theory of implication zroupoids. The identity (BR): $x \land (x \lor y) \approx x \lor (x \land y)$ is called the Birkhoff's identity. The main purpose of this paper is to prove that if A is an algebra in the variety I, then the derived algebra $A_{mj} := \langle A; \land, \lor \rangle$, where $a \land b := (a \to b')'$ and $a \lor b := (a' \land b')'$, satisfies the Birkhoff's identity. As a consequence, we characterize the implication zroupoids A whose derived algebras $A_{mj}$ are Birkhoff systems. It also follows from the main result that there are bisemigroups that are not bisemilattices but satisfy the Birkhoff's identity, which suggests a more general notion, than Birkhoff systems, of "Birkhoff bisemigroups" as bisemigroups satisfying the Birkhoff's identity. The paper concludes with an open problem on Birkhoff bisemigroups.

Explore related subjects

Keep this discovery

BibTeXRIS

Juan M. Cornejo, Hanamantagouda P. Sankappanavar. 2020-01-17. Implication Zroupoids and Birkhoff Systems. https://arxiv.org/abs/2001.06150

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