SearcharxivSearch

arXiv · 1710.10559

Implication Zroupoids and Identities of Associative Type

Abstract

An algebra $\mathbf A = \langle A, \to, 0 \rangle$, where $\to$ is binary and $0$ is a constant, is called an implication zroupoid ($\mathcal I$-zroupoid, for short) if $\mathbf A$ satisfies the identities: $(x \to y) \to z \approx [(z' \to x) \to (y \to z)']'$ and $ 0'' \approx 0$, where $x' : = x \to 0$, and $\mathcal I$ denotes the variety of all $\mathcal I$-zroupoids. An $\mathcal I$-zroupoid is symmetric if it satisfies $x'' \approx x$ and $(x \to y')' \approx (y \to x')'$. The variety of symmetric $\mathcal I$-zroupoids is denoted by $\mathcal S$. An identity $p \approx q$, in the groupoid language $\langle \to \rangle$, is called an identity of associative type of length $3$ if $p$ and $q$ have exactly 3 (distinct) variables, say x,y,z, and are grouped according to one of the two ways of grouping: (1) $\star \to (\star \to \star)$ and (2) $(\star \to \star) \to \star$, where $\star$ is a place holder for a variable. A subvariety of $\mathcal I$ is said to be of associative type of length $3$, if it is defined, relative to $\mathcal I$, by a single identity of associative type of length $3$. In this paper we give a complete analysis of the mutual relationships of all subvarieties of $\mathcal I$ of associative type of length $3$. We prove, in our main theorem, that there are exactly 8 such subvarieties of $\mathcal I$ that are distinct from each other and describe explicitly the poset formed by them under inclusion. As an application of the main theorem, we derive that there are three distinct subvarieties of the variety $\mathcal S$, each defined, relative to $\mathcal S$, by a single identity of associative type of length $3$.

Explore related subjects

Keep this discovery

BibTeXRIS

Juan M. Cornejo, Hanamantagouda P. Sankappanavar. 2017-10-29. Implication Zroupoids and Identities of Associative Type. https://arxiv.org/abs/1710.10559

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