On the public citation graph
Biatomic lattices
0 signed · 25 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/978-3-642-46248-1openalex-snapshot
Theory of Symmetric Lattices
inferredcites →https://doi.org/10.1007/bf01223687openalex-snapshot
Frink's theorem for modular lattices
inferredcites →https://doi.org/10.1007/bfb0098450openalex-snapshot
Universal Algebra and Lattice Theory
inferredcites →https://doi.org/10.1090/s0002-9947-1904-1500678-xopenalex-snapshot
A system of axioms for geometry
inferredcites →https://doi.org/10.1090/s0002-9947-1946-0018635-9openalex-snapshot
Complemented Modular Lattices and Projective Spaces of Infinite Dimension
inferredcites →https://doi.org/10.1090/s0002-9947-1977-0463051-9openalex-snapshot
Lattices of Convex Sets
inferredcites →https://doi.org/10.1090/s0002-9947-1977-0468710-xopenalex-snapshot
On Characterizing the Standard Quantum Logics
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-030-77867-5_4openalex-snapshot
Enumerating Maximal Consistent Closed Sets in Closure Systems
inferred← citeshttps://doi.org/10.1007/bf01200491openalex-snapshot
n-distributivity, dimension and Carath�odory's theorem
inferred← citeshttps://doi.org/10.1007/bf01221792openalex-snapshot
A geometric description of modular lattices
inferred← citeshttps://doi.org/10.1007/bf01236520openalex-snapshot
The lattice of subsemilattices of a semilattice
inferred← citeshttps://doi.org/10.1007/bf02651082openalex-snapshot
Parallel axiom in convexity lattices
inferred← citeshttps://doi.org/10.1007/bf02673036openalex-snapshot
On the exchange and distributivity numbers in geometric lattices
inferred← citeshttps://doi.org/10.1007/bf02844894openalex-snapshot
Hilbert's “Grundlagen der Geometrie”
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90028-9openalex-snapshot
Functional dependencies in relational databases: A lattice point of view
inferred← citeshttps://doi.org/10.1016/j.exmath.2010.09.004openalex-snapshot
The axiomatics of ordered geometry
inferred← citeshttps://doi.org/10.1016/s0001-8708(02)00011-7openalex-snapshot
Join-semidistributive lattices and convex geometries
inferred← citeshttps://doi.org/10.1023/a:1024463510392openalex-snapshot
Embedding Finite Lattices into Finite Biatomic Lattices
inferred← citeshttps://doi.org/10.2178/jsl/1278682219openalex-snapshot
On the equational theory of projection lattices of finite von neumann factors
inferred← citeshttps://doi.org/10.70675/148c5200zc441z43c1z9b85z7bb2f5ddc335openalex-snapshot
Algorithms on closure systems and their representations
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.