|
|||||
|
|
The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable |
|
| Authors: | Hirsch Robin |
| Institution: | Department of Computer Science, University College London, Gower Street, London, UK. Email: R.Hirsch{at}cs.ucl.ac.uk |
| Abstract: | |
| Keywords: | Binary relation ordered monoid partial order game non finitely axiomatisable |
| 本文献已被 Oxford 等数据库收录！ | |