On the public citation graph
Weakly representable but not representable relation algebras
0 signed · 24 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/bf00370684openalex-snapshot
Algebraization of quantifier logics, an introductory overview
inferredcites →https://doi.org/10.1090/s0002-9939-1991-1052567-5openalex-snapshot
Splitting in relation algebras
inferredcites →https://doi.org/10.1090/s0002-9947-1959-0108459-5openalex-snapshot
Representation of Modular Lattices and Of Relation Algebras
inferredcites →https://doi.org/10.2307/2270900openalex-snapshot
Nonfinitizability of classes of representable cylindric algebras
inferredcites →https://doi.org/10.2307/2274756openalex-snapshot
Nonfinite axiomatizability results for cylindric and relation algebras
inferredcites →https://doi.org/10.2307/2372123openalex-snapshot
Boolean Algebras with Operators. Part I
inferredcites →https://doi.org/10.4153/cjm-1955-001-4openalex-snapshot
Combinatorial Relations and Chromatic Graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00012-007-2034-0openalex-snapshot
On the variety question for wRRA
inferred← citeshttps://doi.org/10.1007/s00012-009-2103-7openalex-snapshot
Weakly representable relation algebras form a variety
inferred← citeshttps://doi.org/10.1007/s00012-012-0210-3openalex-snapshot
On the equational complexity of RRA
inferred← citeshttps://doi.org/10.1016/j.jlamp.2022.100759openalex-snapshot
Monk algebras and Ramsey theory
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.1017/s1755020316000265openalex-snapshot
THERE IS NO FINITE-VARIABLE EQUATIONAL AXIOMATIZATION OF REPRESENTABLE RELATION ALGEBRAS OVER WEAKLY REPRESENTABLE RELATION ALGEBRAS
inferred← citeshttps://doi.org/10.1093/jigpal/5.4.565openalex-snapshot
Nonrepresentable sequential algebras
inferred← citeshttps://doi.org/10.2178/bsl/1130335206openalex-snapshot
Algebraic Logic, Where Does it Stand Today?
inferred← citeshttps://doi.org/10.2178/jsl/1309952524openalex-snapshot
Weak representations of relation algebras and relational bases
inferred← citeshttps://doi.org/10.2178/jsl/1327068701openalex-snapshot
On canonicity and completions of weakly representable relation algebras
inferred← citeshttps://doi.org/10.2307/2275740openalex-snapshot
Step by step – Building representations in algebraic logic
inferred← citeshttps://doi.org/10.31274/rtd-180813-15417openalex-snapshot
Weak representation theory in the calculus of relations
inferred← citeshttps://doi.org/10.48550/arxiv.1304.2092openalex-snapshot
On the equational complexity of RRA
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.