Relation Formulas for Protoalgebraic Equality Free Quasivarieties; Pałasińska’s Theorem Revisited

2013

Full text Open access: Hybrid Metadata (CSL-JSON)
DOI 10.1007/s11225-013-9499-y
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

We provide a new proof of the following Pałasińska's theorem: Every finitely generated protoalgebraic relation distributive equality free quasivariety is finitely axiomatizable. The main tool we use are $${\mathcal{Q}}$$ -relation formulas for a protoalgebraic equality free quasivariety $${\mathcal{Q}}$$ . They are the counterparts of the congruence formulas used for describing the generation of congruences in algebras. Having this tool in hand, we prove a finite axiomatization theorem for $${\mathcal{Q}}$$ when it has definable principal $${\mathcal{Q}}$$ -subrelations. This is a property obtained by carrying over the definability of principal subcongruences, invented by Baker and Wang for varieties, and which holds for finitely generated protoalgebraic relation distributive equality free quasivarieties.