On the public citation graph
Horn sentences with (W) and weak Mal'cev conditions
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/bf01974108openalex-snapshot
Mal'cev conditions for Horn sentences with congruence permutability
inferredcites →https://doi.org/10.1007/bf02485400openalex-snapshot
A test for identities satisfied in lattices of submodules
inferredcites →https://doi.org/10.1007/bf02485425openalex-snapshot
Splitting lattices generate all lattices
inferredcites →https://doi.org/10.1007/bfb0063432openalex-snapshot
A characterization for congruence semi-distributivity
inferredcites →https://doi.org/10.1090/s0002-9904-1946-08602-4openalex-snapshot
Lattices, equivalence relations, and subgroups
inferredcites →https://doi.org/10.1090/s0002-9947-1972-0313141-1openalex-snapshot
Equational Bases and Nonmodular Lattice Varieties
inferredcites →https://doi.org/10.4153/cjm-1964-013-5openalex-snapshot
Free Lattices Generated by Partially Ordered Sets and Preserving Bounds
inferredcites →https://doi.org/10.4153/cjm-1981-035-5openalex-snapshot
On the Structure of Finitely Presented 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/bf01974108openalex-snapshot
Mal'cev conditions for Horn sentences with congruence permutability
inferred← citeshttps://doi.org/10.1007/s00012-003-1818-0openalex-snapshot
All congruence lattice identities implying modularity have Mal?tsev conditions
inferred← citeshttps://doi.org/10.1007/s00012-008-2047-3openalex-snapshot
Idempotent Mal’cev conditions and 2-uniform congruences
inferred← citeshttps://doi.org/10.1007/s00012-012-0171-6openalex-snapshot
Lattices freely generated by an order and preserving certain bounds
inferred← citeshttps://doi.org/10.1007/s00012-020-00699-xopenalex-snapshot
Mal’cev conditions corresponding to identities for compatible reflexive relations
inferred← citeshttps://doi.org/10.1090/s0065-9266-2012-00667-8openalex-snapshot
The shape of congruence lattices
inferred← citeshttps://doi.org/10.48550/arxiv.math/0703089openalex-snapshot
Mal'cev conditions from graphs for congruences and tolerances
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.