Single axioms: With and without computers
From MaRDI portal
This is a survey of results on the axiomatizability of group-like and lattice-like algebraic structures by single equational axioms, ranging from \textit{A. Tarski's} [Fundam. Math. 30, 253-256 (1938; Zbl 0019.05204)] to the author and \textit{R. Padmanabhan's} [Algebra Univers. 36, No. 4, 436-449 (1996; Zbl 0901.06006)] and including some recent computer-aided findings concerning Boolean algebras. For the entire collection see [Zbl 0959.00035].
Recommendations
Cited in
(7)- Rapid construction of algebraic axioms from samples
- Single identities for ternary Boolean algebras
- Automated discovery of single axioms for ortholattices
- Finite axiomatizability for equational theories of computable groupoids
- scientific article; zbMATH DE number 2064560 (Why is no real title available?)
- Church Without Dogma: Axioms for Computability
- Minimum bases for equational theories of groups and rings: The work of Alfred Tarski and Thomas Green
This page was built for publication: Single axioms: With and without computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2725955)