A finitely axiomatizable undecidable equational theory with recursively solvable word problems

Delić, Dejan

doi:10.1090/s0002-9947-99-02339-9

Trans. Amer. Math. Soc.

1999

DOI: 10.1090/s0002-9947-99-02339-9

|View full text |Cite

A finitely axiomatizable undecidable equational theory with recursively solvable word problems

Dejan Delić

Abstract: Abstract. In this paper we construct a finitely based variety, whose equational theory is undecidable, yet whose word problems are recursively solvable, which solves a problem stated by G. McNulty (1992). The construction produces a discriminator variety with the aforementioned properties starting from a class of structures in some multisorted language (which may include relations), axiomatized by a finite set of universal sentences in the given multisorted signature.This result also presents a common generali… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2002

2013

Publication Types

Select...

Article5

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 5 publications

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

On locally finite varieties with undecidable equational theory

Jackson

2002

Algebra Universalis

View full text Add to dashboard Cite

In several recent papers [2,3,4,10,14] (and in the doctoral thesis of B. Wells [13]) examples have been found of varieties, V, in which every finitely presented algebra has a decidable word problem but for which no uniform algorithm exists which solves the word problem in an arbitrary algebra from V (the uniform word problem). A second kind of example presented in the above papers are varieties V in which every finitely generated V-free algebra has a decidable word problem but the equational theory of V is undecidable. Varieties with this property are said to be psuedorecursive [14]. A further variation on these ideas are pseudorecursive varieties in which every finitely presented algebra has decidable word problem; we will call varieties with these properties strongly pseudorecursive. Examples of strongly pseudorecursive varieties are also presented in the above papers. It is well known that the undecidability of the equational theory of a variety implies the undecidability of the uniform word problem for that variety. Thus a strongly pseudorecursive variety is also a variety of the first kind described above. Of particular note is the example of Delić [4] which is a finitely based strongly pseudorecursive variety though its basis is very complicated. On the other hand the identity basis for the strongly pseudorecursive variety presented in [3] is infinite but of quite a simple form. The reader is referred to [14] for an interesting discussion on some of the implications of the existence of pseudorecursive varieties.As noted in [14] (see Remark 11.2.4) it is easy to establish the existence of many (strongly) pseudorecursive varieties, even varieties of groups. However all explicitly described examples of strongly pseudorecursive varieties existing in the literature are either non associative varieties of groupoids or varieties of groupoids (sometimes associative) with additional operations. Here we combine a method used in many of the above papers with some existing results to construct comparatively basic strongly pseudorecursive varieties of semigroups (of type 2 ) and a strongly pseudorecursive variety of groups (of type 2, 1, 0 ). Furthermore, rather than presenting particular examples, we describe a large class of examples.

show abstract

On locally finite varieties with undecidable equational theory

Jackson

2002

Algebra Universalis

View full text Add to dashboard Cite

show abstract

Many-sorted and single-sorted algebras

2013

View full text Add to dashboard Cite

show abstract

Applying, extending, and specializing pseudorecursiveness

Wells

2004

Annals of Pure and Applied Logic

View full text Add to dashboard Cite

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

A finitely axiomatizable undecidable equational theory with recursively solvable word problems

Cited by 5 publications

References 17 publications

On locally finite varieties with undecidable equational theory

On locally finite varieties with undecidable equational theory

Many-sorted and single-sorted algebras

Applying, extending, and specializing pseudorecursiveness

Contact Info

Product

Resources

About