Publication:4886957
From MaRDI portal
zbMath0856.03008MaRDI QIDQ4886957
Publication date: 23 July 1996
finite algebra; nilpotent algebra; elementary theory; generalized Pascal triangles; algorithmic decidability and undecidability
68Q80: Cellular automata (computational aspects)
03B25: Decidability of theories and sets of sentences
08A50: Word problems (aspects of algebraic structures)
Related Items
A list of arithmetical structures complete with respect to the first-order definability, Theories of generalized Pascal triangles