Search arXivSearch

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

Explore connections, maps & timelines

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

On Borel sets in ideal topologies

We study the Borel and analytic subsets of the spaces ${}^κκ$ and ${}^κ2$ endowed with ideal topologies, where $κ$ is a regular uncountable cardinal, thereby addressing some open problems of the literature. We provide a systematic analysis of the Borel hierarchy for an arbitrary ideal topology. In particular, we formulate a sufficient condition ensuring that the hierarchy does not collapse, demonstrate that every Borel set in such a topology is analytic, and establish the existence of a set that is not Borel. Our main result shows that, when the underlying ideal contains an unbounded subset, the collection of analytic sets coincides with the full power set of the ambient space. Finally, we prove that the Approximation Lemma holds in the setting of ideal topologies.

math.LO

Inquisitive first-order logic is neither compact nor recursively axiomatizable

Inquisitive first-order logic is an extension of classical first-order logic with formulas regimenting first-order questions, such as "whether all objects are P", "which objects are P", and "what is one object that is P". Since it was first developed in 2009, two major meta-theoretical questions about this logic have remained open, in spite of significant efforts. The first concerns compactness: if a conclusion follows from a set of premises, does it always follow from some finite subset? The second concerns the computational status of validity: is the set of validities recursively enumerable, or equivalently, does the logic admit a recursive axiomatization? We settle both questions in the negative, showing that inquisitive first-order logic is neither compact nor recursively axiomatizable. Furthermore, we prove that it violates another signature property of first-order logic, namely, Craig interpolation. We discuss the significance of our results, and show how to extend them to a closely related logic, viz., inquisitive team logic.

math.LO

The Borel Distinguishing Number of Schreier Graphs

The Borel distinguishing number $D_B(\mathcal{G})$ of a Borel graph $\mathcal{G}$, recently introduced by Bilge and Kaya, is the minimum number of colors required to break the symmetry of $\mathcal{G}$ in a Borel way. In this paper, we investigate the Borel distinguishing number of Schreier graphs induced by the free part of the shift action $Γ\curvearrowright n^Γ$. We prove that $D_B(\mathcal{G})\le n+1$ for $Γ=\mathbb{Z}^d$ equipped with the standard generators. Moreover, we show that $D_B(\mathcal{G})\ge n+1$ if $ Γ$ is amenable and $ \{γ\in \mathrm{Aut}(\mathrm{Cay}(Γ,S)) \mid γ(e) = e \}$ is non-trivial. We also show that $D_B(\mathcal{G})$ is finite if $Γ$ is finitely generated, and give some applications of our results. These results answer some questions raised by Bilge and Kaya.

math.LO