2014
DOI: 10.1016/j.jpaa.2013.11.020
|View full text |Cite
|
Sign up to set email alerts
|

Dualizability of automatic algebras

Abstract: We make a start on one of George McNulty's Dozen Easy Problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2015
2015
2015
2015

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…Theorem 5.2 implies Theorem 2.5 of [3] (a fact that is alluded to in Remark 2.6 of [3]). Conversely, it appears that some cases where we apply Theorem 3.1 can alternatively be obtained using embellishments of the constructions in the proof of [3, Theorem 2.5], though not when, for example, a = c.…”
Section: Nilpotent and Monogenic Semigroupsmentioning
confidence: 82%
See 1 more Smart Citation
“…Theorem 5.2 implies Theorem 2.5 of [3] (a fact that is alluded to in Remark 2.6 of [3]). Conversely, it appears that some cases where we apply Theorem 3.1 can alternatively be obtained using embellishments of the constructions in the proof of [3, Theorem 2.5], though not when, for example, a = c.…”
Section: Nilpotent and Monogenic Semigroupsmentioning
confidence: 82%
“…This gives an interpretation of T, and the remainder of the argument is essentially a simplified version of the final stages of the application of Theorem 3.1 in the proof of Theorem 5.1. Theorem 5.2 implies Theorem 2.5 of [3] (a fact that is alluded to in Remark 2.6 of [3]). Conversely, it appears that some cases where we apply Theorem 3.1 can alternatively be obtained using embellishments of the constructions in the proof of [3, Theorem 2.5], though not when, for example, a = c.…”
Section: Nilpotent and Monogenic Semigroupsmentioning
confidence: 82%