Pages that link to "Item:Q5693111"
From MaRDI portal
The following pages link to The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable (Q5693111):
Displaying 6 items.
- Axiomatizability of positive algebras of binary relations (Q647324) (← links)
- Reducts of relation algebras: the aspects of axiomatisability and finite representability (Q2151415) (← links)
- Representable semilattice-ordered monoids (Q2474106) (← links)
- Axioms for signatures with domain and demonic composition (Q2663185) (← links)
- POSITIVE FRAGMENTS OF RELEVANCE LOGIC AND ALGEBRAS OF BINARY RELATIONS (Q3006000) (← links)
- Undecidability of representability as binary relations (Q4899169) (← links)