POSITIVE FRAGMENTS OF RELEVANCE LOGIC AND ALGEBRAS OF BINARY RELATIONS
From MaRDI portal
Publication:3006000
DOI10.1017/S1755020310000249zbMath1231.03020MaRDI QIDQ3006000
Szabolcs Mikulás, Robin Hirschl
Publication date: 10 June 2011
Published in: The Review of Symbolic Logic (Search for Journal in Brave)
08B05: Equational logic, Mal'tsev conditions
08C15: Quasivarieties
03B47: Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics)
03G15: Cylindric and polyadic algebras; relation algebras
Related Items
Axiomatizability of positive algebras of binary relations, Lower semilattice-ordered residuated semigroups and substructural logics
Cites Work
- Relation algebras by games
- A relational representation of quasi-Boolean algebras
- Lambek calculus and its relational semantics: Completeness and incompleteness
- A completeness theorem for Kleene algebras and the algebra of regular events
- Atom structures of cylindric algebras and relation algebras
- Relation algebras with \(n\)-dimensional relational bases
- Representations of distributive lattice-ordered semigroups with binary relations
- Representable semilattice-ordered monoids
- On representable relation algebras
- Representability is not decidable for finite relation algebras
- Strongly representable atom structures of cylindric algebras
- RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS
- Algebras of Relations and Relevance Logic
- A BRIEF SURVEY OF FRAMES FOR THE LAMBEK CALCULUS
- Complete representations in algebraic logic
- Completely Representable Relation Algebras
- RELEVANCE LOGICS AND RELATION ALGEBRAS
- The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable
- Canonical extensions and relational completeness of some substructural logics
- Boolean Algebras with Operators
- Relation algebras from cylindric algebras. II
