Positive fragments of relevance logic and algebras of binary relations

DOI10.1017/S1755020310000249MaRDI QIDQ3006000zbMATH OpenFDO

Authors Szabolcs Mikulás, Robin Hirsch

Publication date 10 June 2011

Published in The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S1755020310000249

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Cylindric and polyadic algebras; relation algebras (03G15) Equational logic, Mal'tsev conditions (08B05) Quasivarieties (08C15)

Recommendations

• Algebras of Relations and Relevance Logic
• Axiomatizability of positive algebras of binary relations
• Relational Logics and Their Applications
• RELEVANCE LOGICS AND RELATION ALGEBRAS
• Relation algebras and \(\mathbf{R}\)

Cites work

• A BRIEF SURVEY OF FRAMES FOR THE LAMBEK CALCULUS
• A completeness theorem for Kleene algebras and the algebra of regular events
• A relational representation of quasi-Boolean algebras
• Algebras of Relations and Relevance Logic
• Atom structures of cylindric algebras and relation algebras
• Boolean Algebras with Operators
• Canonical extensions and relational completeness of some substructural logics
• Complete representations in algebraic logic
• Completely Representable Relation Algebras
• Lambek calculus and its relational semantics: Completeness and incompleteness
• On representable relation algebras
• Relation algebras by games
• Relation algebras from cylindric algebras. II
• Relation algebras with \(n\)-dimensional relational bases
• RELEVANCE LOGIC AND THE CALCULUS OF RELATIONS
• RELEVANCE LOGICS AND RELATION ALGEBRAS
• Representability is not decidable for finite relation algebras
• Representable semilattice-ordered monoids
• Representations of distributive lattice-ordered semigroups with binary relations
• Strongly representable atom structures of cylindric algebras
• The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable

Cited in

(8)

• Lower semilattice-ordered residuated semigroups and substructural logics
• 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
• On Positive Relational Calculi
• Relation algebras and \(\mathbf{R}\)
• Axiomatizability of positive algebras of binary relations
• Positive Sugihara monoids

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)