A finitely based theory of a non-trivial language, with exactly \(\aleph_ 0\) subcovers (Q1894550)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A finitely based theory of a non-trivial language, with exactly \(\aleph_ 0\) subcovers |
scientific article |
Statements
A finitely based theory of a non-trivial language, with exactly \(\aleph_ 0\) subcovers (English)
0 references
21 September 1995
0 references
Let \(L = \langle f,g \rangle\) be an algebraic language with two unary operation symbols (that is, a first-order language with equality and no relation symbols). The author proves that the equational theory of \(L\) based on a single equation \(fv_0 = v_0\) covers exactly \(\aleph_0\) other equational theories of \(L\).
0 references
equational theory
0 references
