The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable
DOI10.1093/JIGPAL/JZI012zbMATH Open1082.03054OpenAlexW1999783127MaRDI QIDQ5693111FDOQ5693111
Authors: Robin Hirsch 
Publication date: 28 September 2005
Published in: Logic Journal of the IGPL (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0ed9347f9d856b5e543b55beb4fd3f848240e6be
Recommendations
- Representable semilattice-ordered monoids
- On representable ordered residuated semigroups
- Non-elementary classes of representable posets
- Axiomatising Various Classes of Relation and Cylindric Algebras
- Undecidability of representability for lattice-ordered semigroups and ordered complemented semigroups
partial orderbinary relationgameultraproductrepresentabilityordered monoidnon-finite axiomatisability
Applications of game theory (91A80) Ordered semigroups and monoids (06F05) Cylindric and polyadic algebras; relation algebras (03G15) Ultraproducts and related constructions (03C20)
Cited In (6)
- Reducts of relation algebras: the aspects of axiomatisability and finite representability
- Axioms for signatures with domain and demonic composition
- Axiomatizability of positive algebras of binary relations
- Undecidability of representability as binary relations
- Positive fragments of relevance logic and algebras of binary relations
- Representable semilattice-ordered monoids
This page was built for publication: The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5693111)
