On the public citation graph
Free lattice algorithms
0 signed · 26 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-94-009-7798-3_11openalex-snapshot
Some Order Theoretic Questions About Free Lattices and Free Modular Lattices
inferredcites →https://doi.org/10.1007/bf02485425openalex-snapshot
Splitting lattices generate all lattices
inferredcites →https://doi.org/10.1007/bfb0098456openalex-snapshot
Connected components of the covering relation in free 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-1972-0313141-1openalex-snapshot
Equational Bases and Nonmodular Lattice Varieties
inferredcites →https://doi.org/10.1090/s0002-9947-1979-0531987-8openalex-snapshot
Projective Geometries as Projective Modular Lattices
inferredcites →https://doi.org/10.1090/s0002-9947-1980-0576864-xopenalex-snapshot
Free Modular Lattices
inferredcites →https://doi.org/10.1090/s0002-9947-1985-0773044-4openalex-snapshot
Covers in free lattices
inferredcites →https://doi.org/10.1137/0216011openalex-snapshot
On the Computational Complexity of Algebra on Lattices
inferredcites →https://doi.org/10.4153/cjm-1980-087-6openalex-snapshot
A Characterization of Identities Implying Congruence Modularity I
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.1993.1046openalex-snapshot
Term Rewrite Systems for Lattice Theory
inferred← citeshttps://doi.org/10.1007/978-94-017-0697-1_5openalex-snapshot
Lectures on Free Lattices
inferred← citeshttps://doi.org/10.1007/bf01200490openalex-snapshot
Computers and universal algebra: some directions
inferred← citeshttps://doi.org/10.1007/bf01221797openalex-snapshot
J�nsson's contributions to lattice theory
inferred← citeshttps://doi.org/10.1007/s00012-019-0583-7openalex-snapshot
Symmetric embeddings of free lattices into each other
inferred← citeshttps://doi.org/10.1007/s00012-026-00930-1openalex-snapshot
On the uniform word problem for lattices
inferred← citeshttps://doi.org/10.1007/s11083-025-09701-4openalex-snapshot
Polynomial-time Equational Theory for Lattices with Unary Operators
inferred← citeshttps://doi.org/10.26686/ajl.v17i2.6468openalex-snapshot
Free lattices proof-theoretically
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.