The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable (Q5693111)
From MaRDI portal
scientific article; zbMATH DE number 2210172
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable |
scientific article; zbMATH DE number 2210172 |
Statements
The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable (English)
0 references
28 September 2005
0 references
binary relation
0 references
ordered monoid
0 references
partial order
0 references
game
0 references
non-finite axiomatisability
0 references
ultraproduct
0 references
representability
0 references
