On the public citation graph
Clones, order varieties, near unanimity functions and holes
0 signed · 20 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.1002/malq.19780240111openalex-snapshot
Bestimmung der Ordnung Maximaler Klassen von Funktionen der k‐Wertigen Logik
inferredcites →https://doi.org/10.1007/bf00341639openalex-snapshot
Algebraic properties of crowns and fences
inferredcites →https://doi.org/10.1007/bf00400284openalex-snapshot
A maximal clone of monotone operations which is not finitely generated
inferredcites →https://doi.org/10.1007/bf01182246openalex-snapshot
The strong selection property and ordered sets of finite length
inferredcites →https://doi.org/10.1007/bf01187059openalex-snapshot
Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems
inferredcites →https://doi.org/10.1016/0097-3165(83)90006-7openalex-snapshot
An application of the Helly property to the partially ordered sets
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-36494-3_34openalex-snapshot
Solving Order Constraints in Logarithmic Space
inferred← citeshttps://doi.org/10.1007/bf00383763openalex-snapshot
Monotone clones and the varieties they determine
inferred← citeshttps://doi.org/10.1007/bf01108826openalex-snapshot
Series parallel posets with nonfinitely generated clones
inferred← citeshttps://doi.org/10.1007/bf01190934openalex-snapshot
Monotone J�nsson operations and near unanimity functions
inferred← citeshttps://doi.org/10.1016/0012-365x(92)90033-copenalex-snapshot
Graphs with edge-preserving majority functions
inferred← citeshttps://doi.org/10.1017/s0004972700012284openalex-snapshot
Posets, near unanimity functions and zigzags
inferred← citeshttps://doi.org/10.1017/s0004972700018104openalex-snapshot
Monotone clones, residual smallness and congruence distributivity
inferred← citeshttps://doi.org/10.1023/b:orde.0000026602.94442.32openalex-snapshot
Obituary: Ivan Rival
inferred← citeshttps://doi.org/10.1109/ismvl.1998.679515openalex-snapshot
Generating sets for clones and partial clones
inferred← citeshttps://doi.org/10.1109/ismvl.2019.00016openalex-snapshot
The mathematics of Ivo Rosenberg
inferred← citeshttps://doi.org/10.1137/120894312openalex-snapshot
Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case
inferred← citeshttps://doi.org/10.1137/16m110527xopenalex-snapshot
NU Polymorphisms on Reflexive Digraphs
inferred← citeshttps://doi.org/10.1137/s0895480103436748openalex-snapshot
Near-Unanimity Functions and Varieties of Reflexive Graphs
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.