Search arXivSearch

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

Explore connections, maps & timelines

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

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO

Natural Term Logic

In this paper we develop a formal system called Natural Term Logic (NTL). NTL aims to represent key aspects of the logical and grammatical mechanisms of natural language as well as grammatical transformations which preserve core logical meaning. NTL can be seen as a refinement of the ideas of Quine's paper `Variables Explained Away' and the technical concepts introduced by Bealer and Zalta. NTL is more fine-grained than Bealer's first-order intensional logic (BL): there is a many-to-one correspondence $ν$ between NTL terms and closed BL terms as well as a canonical map $β$ which assigns to each closed BL term a corresponding NTL term. The map $ν$ can be seen as assigning a core logical content of the NTL term. We define a series of reductions on NTL terms which intuitivelyy speaking capture meaning-preserving syntactic transformations ( transformations which preserved the basic logical meaning of a term) and our main result is that each NTL term $T$ reduces to a unique normal term $N$. The reductions fall into the structural, predicative and pushing-in categories. Predicative reductions decompose NTL terms so that predication is only applied to a primitive term (such terms are called prenormal). A key ingredient in the proof is the fact that $βνN = N$ when $N$ is normal. This suggests that within NTL the normal form of a term expresses the core logical content of the term.

math.LO

Hyper-hyperfiniteness and complexity

We show that if there exists a countable Borel equivalence relation which is hyper-hyperfinite but not hyperfinite, then the complexity of hyperfinite countable Borel equivalence relationsis as high as possible, namely, $Σ^1_2$-complete. We also establish an implication between the question of the effectivity of hyperfiniteness and its complexity.

math.LO