Search arXivSearch

arXiv · 2002.00109

Pierce stalks in preprimal varieties

Abstract

An algebra $\mathbf{P}$ is called \textit{preprimal} if $\mathbf{P}$ is finite and $\func{Clo}(\mathbf{P})$ is a maximal clone. A \textit{preprimal variety} is a variety generated by a preprimal algebra. After Rosenberg's classification of maximal clones \cite{ro}; we have that a finite algebra is preprimal if and only if its term operations are exactly the functions preserving a relation of one of the following seven types: 1. Permutations with cycles all the same prime length, 2. Proper subsets, 3 Prime-affine relations, 4. Bounded partial orders, 5. $h$-adic relations, 6. Central relations $h\geq 2$, 7. Proper, non-trivial equivalence relations. In \cite{kn} Knoebel studies the Pierce sheaf of the different preprimal varieties and he asks for a description of the Pierce stalks. He solves this problem for the cases 1.,2. and 3. and left open the remaining cases. In this paper, using central element theory we succeeded in describing the Pierce stalks of the cases 6. and 7..

Explore related subjects

Keep this discovery

BibTeXRIS

D. Vaggione, W. J. Zuluaga Botero. 2020-02-01. Pierce stalks in preprimal varieties. https://arxiv.org/abs/2002.00109

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