On the public citation graph
Adjoining units to residuated Boolean algebras
0 signed · 13 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.1007/bf01195378openalex-snapshot
Relation algebras as residuated Boolean algebras
inferredcites →https://doi.org/10.1007/bf01195500openalex-snapshot
Axiomatization of identity-free equations valid in relation algebras
inferredcites →https://doi.org/10.1007/bf01221799openalex-snapshot
A perspective on the theory of relation algebras
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-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/bf01195500openalex-snapshot
Axiomatization of identity-free equations valid in relation algebras
inferred← citeshttps://doi.org/10.1007/s00012-011-0142-3openalex-snapshot
Axiomatizability of positive algebras of binary relations
inferred← citeshttps://doi.org/10.1007/s00012-019-0625-1openalex-snapshot
Distributive laws in residuated binars
inferred← citeshttps://doi.org/10.1016/0165-0114(94)00349-copenalex-snapshot
Squares and rectangles in relation categories Three cases: semilattice, distributive lattice and boolean non-unitary
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00027-4openalex-snapshot
Complexity of equations valid in algebras of relations part I: Strong non-finitizability
inferred← citeshttps://doi.org/10.1016/s0168-0072(97)00028-6openalex-snapshot
Complexity of equations valid in algebras of relations part II: Finite axiomatizations
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.