McNulty, George F. The computational complexity of deciding whether a finite algebra generates a minimal variety. (English) Zbl 1459.08007 Czelakowski, Janusz (ed.), Don Pigozzi on abstract algebraic logic, universal algebra, and computer science. Cham: Springer. Outst. Contrib. Log. 16, 233-256 (2018). MSC: 08B99 03D15 68Q17 PDFBibTeX XMLCite \textit{G. F. McNulty}, Outst. Contrib. Log. 16, 233--256 (2018; Zbl 1459.08007) Full Text: DOI
McNulty, George F. A juggler’s dozen of easy\(^†\) problems (\(^†\) Well, easily formulated …). (English) Zbl 1343.08003 Algebra Univers. 74, No. 1-2, 17-34 (2015). MSC: 08B05 08B10 08A30 06B15 06B25 03C05 PDFBibTeX XMLCite \textit{G. F. McNulty}, Algebra Univers. 74, No. 1--2, 17--34 (2015; Zbl 1343.08003) Full Text: DOI
Jackson, Marcel; McNulty, George F. The equational complexity of Lyndon’s algebra. (English) Zbl 1230.08002 Algebra Univers. 65, No. 3, 243-262 (2011). Reviewer: Václav Koubek (Praha) MSC: 08B05 03C05 08B26 68Q25 PDFBibTeX XMLCite \textit{M. Jackson} and \textit{G. F. McNulty}, Algebra Univers. 65, No. 3, 243--262 (2011; Zbl 1230.08002) Full Text: DOI
McNulty, George F.; Székely, Zoltán; Willard, Ross Equational complexity of the finite algebra membership problem. (English) Zbl 1163.08002 Int. J. Algebra Comput. 18, No. 8, 1283-1319 (2008). Reviewer: Václav Koubek (Praha) MSC: 08B05 03C05 03C13 68Q25 PDFBibTeX XMLCite \textit{G. F. McNulty} et al., Int. J. Algebra Comput. 18, No. 8, 1283--1319 (2008; Zbl 1163.08002) Full Text: DOI
Ježek, J.; McNulty, G. F. Finite axiomatizability of congruence rich varieties. (English) Zbl 0840.08010 Algebra Univers. 34, No. 2, 191-213 (1995). Reviewer: A.Ryaskin (Novosibirsk) MSC: 08B99 08B10 08C10 PDFBibTeX XMLCite \textit{J. Ježek} and \textit{G. F. McNulty}, Algebra Univers. 34, No. 2, 191--213 (1995; Zbl 0840.08010) Full Text: DOI