Horn sentences with (W) and weak Mal'cev conditions
type: Item
instance of: scholarly article
title: Horn sentences with (W) and weak Mal'cev conditions
zbMATH Open document ID: 0549.08003
DOI: 10.1007/BF01190431
author: Alan Day
author: Gábor Czédli
published in: Algebra Universalis
publication date: 1984-01-01T00:00:00Z
review text: A second order sentence \(U:(\exists f_ 1,...,f_ m)(\forall x_ 1,...,x_ n)M\) where M is a finite conjunction of equations in function variables \(f_ 1,...,f_ m\) and individual variables \(x_ 1,...,x_ n\) is called a strong Mal'cev condition. Any disjunction of strong Mal'cev conditions \(U_ n\), \(n\geq 1\), where \(U_ n\) implies \(U_{n+1}\) for all n, is called a Mal'cev condition. A countably (continuously, resp.) weak Mal'cev condition is a conjunction of countably (at most continuously, resp.) many Mal'cev conditions. A universal lattice Horn sentence (i.e. a first order sentence \(\chi:(\forall\alpha_ 0,...,\alpha_ t)((\bigwedge^{k}_{i=1}p_ i=q_ i)\Rightarrow p\leq q)\) where \(p_ i,q_ i,p\), and q are lattice terms of the variables \(\alpha_ 0,...,\alpha_ t\) and \(k\geq 0)\) is said to satisfy (W) if the finitely presented lattice \(FL(\{\alpha_ 0,...,\alpha_ t\};p_ i(\alpha_ 0,...,\alpha_ t)=q_ i(\alpha_ 0,...,\alpha_ t),\quad i\leq k)\) satisfies the Whitman condition. The paper solves a problem of B. Jónsson whether for any universal lattice Horn sentence \(\chi\) there exists a countably weak Mal'cev condition which holds in a variety \({\mathcal V}\) of algebras iff \(\chi\) is satisfied in Con \({\mathfrak A}\), \({\mathfrak A}\in {\mathcal V}\). The authors present an algorithm which associates appropriate continuously weak Mal'cev conditions with Horn sentences satisfying (W). Applying the main theorem the classical Pixley-Wille algorithm as well as a simpler version of the first author's former result are easily obtained.
Mathematics Subject Classification ID: 08B05
Mathematics Subject Classification ID: 08A30
Mathematics Subject Classification ID: 06B25
zbMATH DE Number: 3875361
zbMATH Keywords: strong Mal'cev conditions
zbMATH Keywords: Whitman condition
zbMATH Keywords: universal lattice Horn sentence
zbMATH Keywords: weak Mal'cev conditions
zbMATH Keywords: Pixley-Wille algorithm
reviewed by: Jaromír Duda
MaRDI profile type: Publication
cites work: Q3934460
cites work: A Simple Solution to the Word Problem for Lattices
cites work: Splitting lattices generate all lattices
cites work: Free Lattices Generated by Partially Ordered Sets and Preserving Bounds
cites work: Q4129496
cites work: Q4055681
cites work: A test for identities satisfied in lattices of submodules
cites work: Equational Bases and Nonmodular Lattice Varieties
cites work: On Malcev conditions
cites work: Local Malcev Conditions
cites work: Characterizing Mal'cev conditions
cites work: Free lattices
cites work: Lattices, equivalence relations, and subgroups
full work available at URL: https://doi.org/10.1007/bf01190431
OpenAlex ID: W1965273337
description: scientific article; zbMATH DE number 3875361