Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Paul W. Bunting"'
Publikováno v:
Mathematics of Computation. 32:593-605
The associativity problem for the class of finite multiplication tables is known to be undecidable, even for quite narrow infinite subclasses of tables. We present criteria which can be used to decide associativity in many cases, although any effecti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4ced17061edda7b8306fa6e1dfbd2f2a
https://doi.org/10.1090/s0025-5718-1978-0498906-7
https://doi.org/10.1090/s0025-5718-1978-0498906-7
