Abstract: Automatic presentations, also called FA-presentations, were introduced to extend finite model theory to infinite structures whilst retaining the solubility of fundamental decision problems. This paper studies FA-presentable algebras. First, an example is given to show that the class of finitely generated FA-presentable algebras is not closed under forming finitely generated subalgebras, even within the class of algebras with only unary operations. However, it is proven that a finitely generated subalgebra of an FA-presentable algebra with a single unary operation is itself FA-presentable. Furthermore, it is proven that the class of unary FA-presentable algebras is closed under forming finitely generated subalgebras, and that the membership problem for such subalgebras is decidable.
Recommendations
- On finitely presented algebras.
- scientific article; zbMATH DE number 2201826
- Subalgebras of free algebras
- Subalgebras of closure algebras
- scientific article; zbMATH DE number 4044029
- Subalgebra extensions of partial monounary algebras
- Subalgebras of simple AF-algebras
- scientific article; zbMATH DE number 1332346
- SUBALGEBRAS OF DOUBLE FROBENIUS ALGEBRAS
- Faithful \(f\)-free algebras.
Cites work
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- Automatic linear orders and trees
- Automatic presentations for semigroups.
- Automatic structures
- Automaticity of ordinals and of homogeneous graphs
- Deciding the isomorphism problem in classes of unary automatic structures
- FA-presentable groups and rings
- Finite automata presentable Abelian groups
- STACS 2005
- Unary FA-presentable semigroups
- Unary automatic graphs: an algorithmic perspective
This page was built for publication: Subalgebras of FA-presentable algebras.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466920)
