On the public citation graph
Doubling convex sets in lattices and a generalized semidistributivity condition
0 signed · 21 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/bf02485425openalex-snapshot
Splitting lattices generate all lattices
inferredcites →https://doi.org/10.1016/b978-0-7204-0725-9.50025-3openalex-snapshot
A REPORT ON SUBLATTICES OF A FREE LATTICE
inferredcites →https://doi.org/10.1090/s0002-9947-1982-0637041-9openalex-snapshot
Finite Sublattices of a Free Lattice
inferredcites →https://doi.org/10.2140/pjm.1979.82.463openalex-snapshot
Lattice varieties covering the smallest nonmodular variety
inferredcites →https://doi.org/10.4153/cjm-1979-008-xopenalex-snapshot
Characterizations of Finite Lattices that are Bounded-Homomqrphic Images or Sublattices of Free Lattices
inferredcites →https://doi.org/10.4153/cmb-1970-051-0openalex-snapshot
A Simple Solution to the Word Problem for Lattices
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf00383945openalex-snapshot
Cover-preserving order embeddings into Boolean lattices
inferred← citeshttps://doi.org/10.1007/bf01221794openalex-snapshot
Appendix addendum to ?Congruence Normality? of Alan Day
inferred← citeshttps://doi.org/10.1007/bf01235175openalex-snapshot
The generalized doubling construction and formal concept analysis
inferred← citeshttps://doi.org/10.1007/s00029-021-00656-zopenalex-snapshot
The fundamental theorem of finite semidistributive lattices
inferred← citeshttps://doi.org/10.1016/j.aam.2003.09.002openalex-snapshot
Cayley lattices of finite Coxeter groups are bounded
inferred← citeshttps://doi.org/10.1016/j.dam.2016.11.021openalex-snapshot
Using congruence relations to extract knowledge from concept lattices
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.029openalex-snapshot
Algorithms for k-meet-semidistributive lattices
inferred← citeshttps://doi.org/10.1023/a:1016524118566openalex-snapshot
Doubling Convex Sets in Lattices: Characterizations and Recognition Algorithms
inferred← citeshttps://doi.org/10.2178/jsl/1286198152openalex-snapshot
Infinite substructure lattices of models of Peano Arithmetic
inferred← citeshttps://doi.org/10.48550/arxiv.1506.08658openalex-snapshot
Lattice decompositions through methods using congruence relations
inferred← citeshttps://doi.org/10.48550/arxiv.1810.06762openalex-snapshot
Convex expansion for finite distributive lattices with applications
inferred← citeshttps://doi.org/10.5220/0005613203500357openalex-snapshot
The Reverse Doubling Construction
inferred← citeshttps://doi.org/10.70675/ce0f8961zc173z4499z878eze31fee5fae67openalex-snapshot
Cadre général pour la recherche d'information et l'extraction de connaissances par l'exploration de treillis
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.