Positive fragments of relevance logic and algebras of binary relations
From MaRDI portal
Publication:3006000
DOI10.1017/S1755020310000249zbMATH Open1231.03020MaRDI QIDQ3006000FDOQ3006000
Authors: Szabolcs Mikulás, Robin Hirsch
Publication date: 10 June 2011
Published in: The Review of Symbolic Logic (Search for Journal in Brave)
Recommendations
Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Equational logic, Mal'tsev conditions (08B05) Cylindric and polyadic algebras; relation algebras (03G15) Quasivarieties (08C15)
Cites Work
- Boolean Algebras with Operators
- Canonical extensions and relational completeness of some substructural logics
- A completeness theorem for Kleene algebras and the algebra of regular events
- Relation algebras by games
- A BRIEF SURVEY OF FRAMES FOR THE LAMBEK CALCULUS
- On representable relation algebras
- Strongly representable atom structures of cylindric algebras
- Complete representations in algebraic logic
- Lambek calculus and its relational semantics: Completeness and incompleteness
- Atom structures of cylindric algebras and relation algebras
- Relation algebras from cylindric algebras. II
- Relation algebras with \(n\)-dimensional relational bases
- Representability is not decidable for finite relation algebras
- Representations of distributive lattice-ordered semigroups with binary relations
- Representable semilattice-ordered monoids
- The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable
- RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS
- Completely Representable Relation Algebras
- A relational representation of quasi-Boolean algebras
- Algebras of Relations and Relevance Logic
- RELEVANCE LOGICS AND RELATION ALGEBRAS
Cited In (8)
- Relation algebras and \(\mathbf{R}\)
- On Positive Relational Calculi
- Lower semilattice-ordered residuated semigroups and substructural logics
- Positive Sugihara monoids
- Axiomatizability of positive algebras of binary relations
- Algorithmic correspondence for relevance logics, bunched implication logics, and relation algebras via an implementation of the algorithm \textsf{PEARL}
- RELEVANCE LOGICS AND RELATION ALGEBRAS
- Weakly associative relation algebras hold the key to the universe
This page was built for publication: Positive fragments of relevance logic and algebras of binary relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3006000)