On the public citation graph
Relation algebras as residuated Boolean algebras
0 signed · 37 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0020-0190(87)90106-2openalex-snapshot
The weakest prespecification
inferredcites →https://doi.org/10.1090/s0002-9947-1982-0662049-7openalex-snapshot
Some Varieties Containing Relation Algebras
inferredcites →https://doi.org/10.2307/2266341openalex-snapshot
Louise H. Chin and Alfred Tarski. Distributive and modular laws in the arithmetic of relation algebras. University of California publications in mathematics, n.s. vol. 1 no. 9 (1951), pp. 341–384.
inferredcites →https://doi.org/10.2307/2311904openalex-snapshot
The Concept of Join System and Its Basic Properties
inferredcites →https://doi.org/10.3233/fi-1986-9205openalex-snapshot
The Weakest Prespecification, Part II
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-02149-8_10openalex-snapshot
On the Structure of Generalized Effect Algebras and Separation Algebras
inferred← citeshttps://doi.org/10.1007/978-3-030-43520-2_8openalex-snapshot
Weakening Relation Algebras and FL$$^2$$-algebras
inferred← citeshttps://doi.org/10.1007/978-3-030-63787-3_1openalex-snapshot
Lambek Calculus with Classical Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-76920-8_5openalex-snapshot
An Algebraic Glimpse at Bunched Implications and Separation Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-28083-2_12openalex-snapshot
Implication Algebras and Implication Semigroups of Binary Relations
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9openalex-snapshot
Foundations of Software Science and Computation Structures
inferred← citeshttps://doi.org/10.1007/978-3-031-57228-9_8openalex-snapshot
Monoidal Extended Stone Duality
inferred← citeshttps://doi.org/10.1007/978-3-319-57418-9_9openalex-snapshot
Relation Algebras, Idempotent Semirings and Generalized Bunched Implication Algebras
inferred← citeshttps://doi.org/10.1007/978-3-662-52921-8_17openalex-snapshot
On the Complexity of the Equational Theory of Residuated Boolean Algebras
inferred← citeshttps://doi.org/10.1007/bf01066355openalex-snapshot
Lambek Calculus and its relational semantics: Completeness and incompleteness
inferred← citeshttps://doi.org/10.1007/bf01197179openalex-snapshot
Relativizations of relation algebras by the diversity
inferred← citeshttps://doi.org/10.1007/bf01200494openalex-snapshot
Adjoining units to residuated Boolean algebras
inferred← citeshttps://doi.org/10.1007/s00012-012-0215-yopenalex-snapshot
Relation algebras as expanded FL-algebras
inferred← citeshttps://doi.org/10.1007/s00012-020-00663-9openalex-snapshot
The structure of generalized BI-algebras and weakening relation algebras
inferred← citeshttps://doi.org/10.1007/s00012-023-00802-yopenalex-snapshot
Duality for normal lattice expansions and sorted residuated frames with relations
inferred← citeshttps://doi.org/10.1007/s00012-023-00830-8openalex-snapshot
Choice-free topological duality for implicative lattices and Heyting algebras
inferred← citeshttps://doi.org/10.1007/s11225-020-09913-2openalex-snapshot
Lambek Calculus with Conjugates
inferred← citeshttps://doi.org/10.1007/s11225-021-09981-yopenalex-snapshot
Group Representation for Even and Odd Involutive Commutative Residuated Chains
inferred← citeshttps://doi.org/10.1080/00927879508825428openalex-snapshot
On closures verifying that the interior of a closed element is closed
inferred← citeshttps://doi.org/10.1080/11663081.2019.1703469openalex-snapshot
Modal translation of substructural logics
inferred← citeshttps://doi.org/10.1093/jigpal/5.4.565openalex-snapshot
Nonrepresentable sequential algebras
inferred← citeshttps://doi.org/10.1093/jigpal/jzw063openalex-snapshot
23rd Workshop on Logic, Language, Information and Computation (WoLLIC 2016)
inferred← citeshttps://doi.org/10.1093/logcom/exz018openalex-snapshot
A logic of hypothetical conjunction
inferred← citeshttps://doi.org/10.3390/axioms14040257openalex-snapshot
On the Equational Theory of Lattice-Based Algebras for Layered Graphs
inferred← citeshttps://doi.org/10.4064/-28-1-239-252openalex-snapshot
Discriminator varieties of Boolean algebras with residuated operators
inferred← citeshttps://doi.org/10.48550/arxiv.1804.03301openalex-snapshot
A Mathematical Framework for Superintelligent Machines
inferred← citeshttps://doi.org/10.48550/arxiv.2109.11597openalex-snapshot
Reconciliation of Approaches to the Semantics of Logics without Distribution
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.