On the public citation graph
Some lattices of closure systems on a finite set
0 signed · 45 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.1006/aima.1994.1069openalex-snapshot
A Theory of Finite Closure Spaces Based on Implications
inferredcites →https://doi.org/10.1007/978-1-4899-3558-8_17openalex-snapshot
The Consequences of Dilworth’s Work on Lattices with Unique Irreducible Decompositions
inferredcites →https://doi.org/10.1007/bf00143895openalex-snapshot
Combinatorial representation and convex dimension of convex geometries
inferredcites →https://doi.org/10.1007/bf00337692openalex-snapshot
The poset of closures as a model of changing databases
inferredcites →https://doi.org/10.1007/bf00405597openalex-snapshot
Reducible classes of finite lattices
inferredcites →https://doi.org/10.1007/bf01110380openalex-snapshot
Intervals in lattices of quasiorders
inferredcites →https://doi.org/10.1007/bf01233919openalex-snapshot
Maximal sublattices of finite distributive lattices
inferredcites →https://doi.org/10.1007/bf02945131openalex-snapshot
Frattini sublattices of distributive lattices
inferredcites →https://doi.org/10.1007/s00012-002-8183-2openalex-snapshot
The lattice of strict completions of a finite poset
inferredcites →https://doi.org/10.1007/s00355-003-0251-9openalex-snapshot
Lattices of choice functions and consensus problems
inferredcites →https://doi.org/10.1016/0165-4896(90)90077-kopenalex-snapshot
Arrowian characterizations of latticial federation consensus functions
inferredcites →https://doi.org/10.1016/0166-218x(92)90028-9openalex-snapshot
Functional dependencies in relational databases: A lattice point of view
inferredcites →https://doi.org/10.1016/s0012-365x(96)00196-3openalex-snapshot
On a dependence relation in finite lattices
inferredcites →https://doi.org/10.1016/s0165-4896(00)00061-5openalex-snapshot
The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
inferredcites →https://doi.org/10.1016/s0165-4896(98)00044-4openalex-snapshot
Choice functions and abstract convex geometries
inferredcites →https://doi.org/10.1016/s0166-218x(02)00209-3openalex-snapshot
The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey
inferredcites →https://doi.org/10.1016/s1571-0653(04)00049-6openalex-snapshot
Formal Concept Analysis
inferredcites →https://doi.org/10.1017/cbo9780511809088openalex-snapshot
Introduction to Lattices and Order
inferredcites →https://doi.org/10.1023/a:1015291410777openalex-snapshot
Quasiorders and Sublattices of Distributive Lattices
inferredcites →https://doi.org/10.1090/conm/057/856235openalex-snapshot
Abstract convexity and meet-distributive lattices
inferredcites →https://doi.org/10.1090/s0002-9939-1973-0311527-9openalex-snapshot
Maximal Sublattices of Finite Distributive Lattices
inferredcites →https://doi.org/10.1090/s0002-9939-1974-0360393-5openalex-snapshot
Maximal Sublattices of Finite Distributive Lattices. II
inferredcites →https://doi.org/10.1215/s0012-7094-43-01072-5openalex-snapshot
Some studies on closure relations
inferredcites →https://doi.org/10.1216/rmj-1975-5-2-177openalex-snapshot
The lattice of topologies: A survey equations
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.5860/choice.28-3334openalex-snapshot
Introduction to lattices and order
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-319-07248-7_1openalex-snapshot
Learning Spaces, and How to Build Them
inferred← citeshttps://doi.org/10.1007/978-3-642-16248-0_18openalex-snapshot
Set-Theoretic Models of Granular Structures
inferred← citeshttps://doi.org/10.1007/s00012-014-0295-yopenalex-snapshot
Note on the description of join-distributive lattices by permutations
inferred← citeshttps://doi.org/10.1007/s00233-021-10209-7openalex-snapshot
New representations of algebraic domains and algebraic L-domains via closure systems
inferred← citeshttps://doi.org/10.1007/s10474-013-0371-3openalex-snapshot
CD-independent subsets in meet-distributive lattices
inferred← citeshttps://doi.org/10.1007/s10587-009-0018-2openalex-snapshot
Going down in (semi)lattices of finite moore families and convex geometries
inferred← citeshttps://doi.org/10.1007/s11083-015-9362-zopenalex-snapshot
Quasiplanar Diagrams and Slim Semimodular Lattices
inferred← citeshttps://doi.org/10.1016/j.disc.2014.04.017openalex-snapshot
Finite convex geometries of circles
inferred← citeshttps://doi.org/10.1016/j.ijar.2024.109269openalex-snapshot
Description lattices of generalised convex hulls
inferred← citeshttps://doi.org/10.1016/j.jmp.2024.102898openalex-snapshot
Dimensions of knowledge structures
inferred← citeshttps://doi.org/10.1016/j.mathsocsci.2004.09.001openalex-snapshot
Mathematics of Plott choice functions
inferred← citeshttps://doi.org/10.1017/9781139245913.006openalex-snapshot
Knowledge spaces and learning spaces
inferred← citeshttps://doi.org/10.1109/icmlc.2006.258563openalex-snapshot
The Canonical Basis of Implicational System
inferred← citeshttps://doi.org/10.3233/fi-2012-653openalex-snapshot
Set-theoretic Approaches to Granular Computing
inferred← citeshttps://doi.org/10.46298/dmtcs.330openalex-snapshot
Efficient Algorithms on the Family Associated to an Implicational System
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.