On the public citation graph
Monotone J�nsson operations and near unanimity functions
0 signed · 31 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/bf00346133openalex-snapshot
Monotone clones and congruence modularity
inferredcites →https://doi.org/10.1007/bf00383763openalex-snapshot
Monotone clones and the varieties they determine
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/bf00418652openalex-snapshot
Clones, order varieties, near unanimity functions and holes
inferredcites →https://doi.org/10.1007/bf01182246openalex-snapshot
The strong selection property and ordered sets of finite length
inferredcites →https://doi.org/10.1007/bf01182247openalex-snapshot
A new product of algebras and a type reduction theorem
inferredcites →https://doi.org/10.1007/bf01187059openalex-snapshot
Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems
inferredcites →https://doi.org/10.1007/bf02485367openalex-snapshot
Near unanimity identities and congruence distributivity in equational classes
inferredcites →https://doi.org/10.1016/0012-365x(81)90201-6openalex-snapshot
A structure theory for ordered sets
inferredcites →https://doi.org/10.1017/s0004972700018104openalex-snapshot
Monotone clones, residual smallness and congruence distributivity
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00012-011-0155-yopenalex-snapshot
Natural extensions and profinite completions of algebras
inferred← citeshttps://doi.org/10.1007/s00012-016-0388-xopenalex-snapshot
Dualities and algebras with a near-unanimity term
inferred← citeshttps://doi.org/10.1007/s00012-018-0491-2openalex-snapshot
The Jónsson distributivity spectrum
inferred← citeshttps://doi.org/10.1007/s00012-019-0624-2openalex-snapshot
Relation identities in 3-distributive varieties
inferred← citeshttps://doi.org/10.1007/s00012-024-00855-7openalex-snapshot
Relative lengths of Maltsev conditions
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00312-kopenalex-snapshot
Algebraic properties and dismantlability of finite posets
inferred← citeshttps://doi.org/10.1016/j.disc.2009.08.013openalex-snapshot
Absolute retracts and varieties generated by chordal graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.03.040openalex-snapshot
Reflexive digraphs with near unanimity polymorphisms
inferred← citeshttps://doi.org/10.1016/j.jalgor.2004.04.011openalex-snapshot
A polynomial-time algorithm for near-unanimity graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.016openalex-snapshot
CSP duality and trees of bounded pathwidth
inferred← citeshttps://doi.org/10.1023/a:1010676831037openalex-snapshot
Idempotent Totally Symmetric Operations on Finite Posets
inferred← citeshttps://doi.org/10.1109/ismvl.1998.679515openalex-snapshot
Generating sets for clones and partial clones
inferred← citeshttps://doi.org/10.1137/120894312openalex-snapshot
Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case
inferred← citeshttps://doi.org/10.1142/s0218196723500017openalex-snapshot
Between an n-ary and an n + 1-ary near-unanimity term
inferred← citeshttps://doi.org/10.4153/cjm-2011-087-3openalex-snapshot
Finitely Related Algebras In Congruence Distributive Varieties Have Near Unanimity Terms
inferred← citeshttps://doi.org/10.4467/20842589rm.24.001.20699openalex-snapshot
A short way to directed Jónsson terms
inferred← citeshttps://doi.org/10.48550/arxiv.1902.05995openalex-snapshot
Day's Theorem is sharp for $n$ even
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.