SearcharxivSearch

arXiv · 1910.03674

Stone pseudovarieties

Abstract

Profinite algebras are the residually finite compact algebras; their underlying topological spaces are Stone spaces. We extend the theory of profinite algebras to a more general setting of Stone topological algebras. We introduce Stone pseudovarieties, that is, classes of Stone topological algebras of a fixed topological signature that are closed under taking Stone quotients, closed subalgebras and finite direct products. Looking at Stone spaces as the dual spaces of Boolean algebras, we find a simple characterization of when the dual space admits a natural structure of topological algebra. This provides a new approach to duality theory which culminates in the proof that a Stone quotient of a Stone topological algebra that is residually in a given Stone pseudovariety is also residually in it, thereby extending the corresponding result of M. Gehrke for the Stone pseudovariety of all finite algebras over discrete signatures. The residual closure of a Stone pseudovariety is thus a Stone pseudovariety, and these are precisely the Stone analogues of varieties. A Birkhoff type theorem for Stone varieties is also established.

Explore related subjects

Keep this discovery

BibTeXRIS

Jorge Almeida, Ondřej Klíma. 2019-10-08. Stone pseudovarieties. https://doi.org/10.1007/s00025-024-02275-4

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