Strongly finitely based equational theories (Q1180703): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Algebraizable logics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the regular part of varieties of algebras / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Joins and Direct Products of Equational Classes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Products of independent algebras with finitely generated identities / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Identities in Two-Valued Calculi / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Bases for equational theories of semi-groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Axiomatization of semigroup consequences / rank | |||
Normal rank |
Latest revision as of 13:08, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strongly finitely based equational theories |
scientific article |
Statements
Strongly finitely based equational theories (English)
0 references
27 June 1992
0 references
An equational theory \(T\) is called strongly based on \(\Gamma\subseteq T\) iff each equation \(e\) in \(T\) is derivable from \(\Gamma\) in the rudimentary Birkhoff calculus, i.e. without replacement rules. Moreover \(T\) is strongly finitely based iff \(\Gamma\) is finite. Section 1 contains, beside some examples of strongly finitely based theories, the result that the regularization \(T^ r\) of a strongly (finitely) based theory \(T\) is also strongly (finitely) based if \(T\) is an equational theory in \(L_ 0\) containing an equation \(\tau(x,y)=x\) for some term \(\tau(x,y)\). Section 2 deals with independence of equational theories and varieties generated by 2-element groupoids. A groupoid is called proper iff its operation depends on both arguments. The main result is that each variety \(V\) of groupoids generated by proper 2-element groupoids is strongly finitely based. Finally two problems are stated: Is any variety \(V\) strongly finitely based iff a polynomial equivalent variety \(V'\) is strongly finitely based? Does a strongly finitely based equational theory \(T\) exist such that the regularization \(T^ r\) is not strongly finitely based?
0 references
axiomatizability
0 references
inference rule
0 references
equational theory
0 references
Birkhoff calculus
0 references
strongly finitely based
0 references
independence
0 references
groupoids
0 references
regularization
0 references