SearcharxivSearch

arXiv · 1510.03166

A uniform Birkhoff theorem

Abstract

Garret Birkhoff's HSP theorem characterizes the classes of models of algebraic theories as those being closed with respect to homomorphic images, subalgebras, and products. In particular, it implies that an algebra $\mathbf{B}$ satisfies all equations that hold in an algebra $\mathbf{A}$ of the same type if and only if $\mathbf{B}$ is a homomorphic image of a subalgebra of a (possibly infinite) direct power of $\mathbf{A}$. The former statement is equivalent to the existence of a natural map sending term functions of the algebra $\mathbf{A}$ to those of $\mathbf{B}$, and it is natural to wonder about continuity properties of this mapping. We show that this map is uniformly continuous if and only if every finitely generated subalgebra of $\mathbf{B}$ is a homomorphic image of a subalgebra of a finite power of $\mathbf{A}$ -- without any additional assumptions concerning the algebras $\mathbf{A}$ and $\mathbf{B}$. Moreover, provided that $\mathbf{A}$ is almost locally finite (for instance if $\mathbf{A}$ is locally oligomorphic or locally finite), the considered map is uniformly continuous if and only if it is Cauchy-continuous. In particular, our results extend a recent theorem by Bodirsky and Pinsker beyond the countable $ω$-categorical setting.

Explore related subjects

Keep this discovery

BibTeXRIS

Friedrich Martin Schneider. 2015-10-12. A uniform Birkhoff theorem. https://doi.org/10.1007/s00012-017-0460-1

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