On the public citation graph
A combinatorial fact about free algebras
0 signed · 20 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.1017/s1446788700031542openalex-snapshot
Free i-Groups and vector lattices
inferredcites →https://doi.org/10.1090/s0002-9939-1968-0221994-5openalex-snapshot
A Property of Free Boolean Algebras
inferredcites →https://doi.org/10.1112/jlms/s1-35.1.85openalex-snapshot
Intersection Theorems for Systems of Sets
inferredcites →https://doi.org/10.14492/hokmj/1530518423openalex-snapshot
COUNTABLE DECOMPOSABILITY OF VECTOR LATTICES
inferredcites →https://doi.org/10.2140/pjm.1979.83.107openalex-snapshot
Chain conditions in free products of lattices with infinitary operations
inferredcites →https://doi.org/10.4153/cjm-1961-022-8openalex-snapshot
Distributive Sublattices of a Free Lattice
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-94-009-2472-7_2openalex-snapshot
Universal Aspects of the Theory of Lattice Ordered Groups
inferred← citeshttps://doi.org/10.1007/bf01194528openalex-snapshot
The structure of saturated free algebras
inferred← citeshttps://doi.org/10.1007/bf01195016openalex-snapshot
Disjointness conditions for free products of ?-groups
inferred← citeshttps://doi.org/10.1007/bf01198527openalex-snapshot
Free products of lattice ordered groups
inferred← citeshttps://doi.org/10.1007/bf01203369openalex-snapshot
On partially ordered sets embeddable in a free lattice
inferred← citeshttps://doi.org/10.1007/s00012-020-00674-6openalex-snapshot
Generalizing Galvin and Jónsson’s classification to $$N_5$$
inferred← citeshttps://doi.org/10.1090/s0002-9939-1988-0931736-6openalex-snapshot
Sets of Disjoint Elements in Free Products of Lattice-Ordered Groups
inferred← citeshttps://doi.org/10.11575/prism/24830openalex-snapshot
An Analysis of Countable Sublattices of Free Lattices
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.