Finitely presented expansions of computably enumerable semigroups
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
Every computable universal algebra has a finitely presented expansion; on the other hand, there are examples of finitely generated, computably enumerable universal algebras with no finitely presented expansions. It is natural to ask whether such examples can be found in well-known classes of algebras such as groups and semigroups. Here we build an example of a finitely generated, infinite, computably enumerable semigroup with no finitely presented expansions. We also discuss other interesting computability-theoretic properties of this semigroup.
- J. A. Bergstra and J. V. Tucker, “Initial and final algebra semantics for data type specifications: Two characterization theorems,” SIAM J. Comp., 12, 366–387 (1983). CrossRef
- J. A. Bergstra and J. V. Tucker, “Algebraic specifications of computable and semicomputable data types,” Theor. Comp. Sci., 50, 137–181 (1987). CrossRef
- The Logical Notebook, Unsolved Problems in Mathematical Logic, Institute of Mathematics SO AN SSSR, Novosibirsk (1986).
- G. Grätzer, Universal Algebra, Springer, New York (2008). CrossRef
- Y. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel (eds.), Handbook of Recursive Mathematics, Vol. 1, Recursive Model Theory, Stud. Log. Found. Math., 138, Elsevier, Amsterdam (1998).
- A. I. Mal’tsev, “Constructive algebras. 1,” Usp. Mat. Nauk, 16, No. 3, 3–60 (1961).
- N. Kh. Kasymov, “Algebras with residually finite positively presented enrichments,” Algebra Logika, 26, No. 6, 715–730 (1987). CrossRef
- B. Khoussainov, “Randomness, computability, and algebraic specifications,” Ann. Pure Appl. Log., 91, No. 1, 1–15 (1998). CrossRef
- B. Khoussainov and A. Miasnikov, “On finitely presented expansions of algebras and groups,” in preparation.
- E. S. Golod and I. R. Shafarevich, “On the class field tower,” Izv. Akad. Nauk SSSR, Ser. Mat., 28, No. 2, 261–272 (1964).
- D. Cenzer, S. A. Dashti, and J. L. King, “Computable symbolic dynamics,” Math. Log. Q., 54, No. 5, 460–469 (2008). CrossRef
- J. S. Miller, “Two notes on subshifts,” to appear in Proc. Am. Math. Soc.
- R. I. Soare, Recursively Enumerable Sets and Degrees, Persp. Math. Log., Omega Ser., Springer, Berlin (1987).
- I. Kapovich, A. Myasnikov, P. Schupp, and V. Shpilrain, “Generic-case complexity, decision problems in group theory and random walks,” J. Alg., 264, No. 2, 665–694 (2003). CrossRef
- Finitely presented expansions of computably enumerable semigroups
Algebra and Logic
Volume 51, Issue 5 , pp 435-444
- Cover Date
- Print ISSN
- Online ISSN
- Springer US
- Additional Links
- computably enumerable semigroup
- finitely presented expansion
- Industry Sectors