On the public citation graph
Near unanimity: an obstacle to general duality theory
0 signed · 41 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-017-0697-1_2openalex-snapshot
Duality Theory on Ten Dollars a Day
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/bf01187059openalex-snapshot
Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems
inferredcites →https://doi.org/10.1007/bf02944976openalex-snapshot
Implication algebras are 3-permutable and 3-distributive
inferredcites →https://doi.org/10.1016/0012-365x(93)90507-popenalex-snapshot
Partition-induced natural dualities for varieties of pseudo- complemented distributive lattices
inferredcites →https://doi.org/10.1016/b978-0-444-87759-8.50010-9openalex-snapshot
PIGGYBACK DUALITIES
inferredcites →https://doi.org/10.1017/s0004972700018104openalex-snapshot
Monotone clones, residual smallness and congruence distributivity
inferredcites →https://doi.org/10.1090/s0002-9947-1993-1169079-7openalex-snapshot
Optimal Natural Dualities
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf03549831openalex-snapshot
The Finite Type Problem for unary algebras
inferred← citeshttps://doi.org/10.1007/pl00000344openalex-snapshot
Natural dualities for quasivarieties generated by a finite commutative ring
inferred← citeshttps://doi.org/10.1007/s00012-007-2037-xopenalex-snapshot
On the (un)decidability of a near-unanimity term
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-015-0333-4openalex-snapshot
A juggler’s dozen of easy† problems
inferred← citeshttps://doi.org/10.1007/s00012-016-0371-6openalex-snapshot
Naturally dualizable algebras omitting types 1 and 5 have a cube term
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-016-0410-3openalex-snapshot
Dualizable algebras with parallelogram terms
inferred← citeshttps://doi.org/10.1007/s000120050153openalex-snapshot
Some remarks on dualisability and endodualisability
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.jpaa.2006.10.001openalex-snapshot
Dualisability versus residual character: A theorem and a counterexample
inferred← citeshttps://doi.org/10.1016/j.jpaa.2013.11.020openalex-snapshot
Dualizability of automatic algebras
inferred← citeshttps://doi.org/10.1016/s0012-365x(99)00225-3openalex-snapshot
Dualizability and graph algebras
inferred← citeshttps://doi.org/10.1016/s0022-4049(01)00059-7openalex-snapshot
Binary homomorphisms and natural dualities
inferred← citeshttps://doi.org/10.1017/s0004972700014301openalex-snapshot
Natural duality via a finite set of relations
inferred← citeshttps://doi.org/10.1017/s1446788700038283openalex-snapshot
The quest for strong dualities
inferred← citeshttps://doi.org/10.1017/s1446788713000517openalex-snapshot
SUPERNILPOTENCE PREVENTS DUALIZABILITY
inferred← citeshttps://doi.org/10.1137/120894312openalex-snapshot
Graphs Admitting $k$-NU Operations. Part 1: The Reflexive Case
inferred← citeshttps://doi.org/10.1142/s0218196703001444openalex-snapshot
The Complexity of Dualisability: Three-Element Unary Algebras
inferred← citeshttps://doi.org/10.1142/s0218196711006534openalex-snapshot
UNCOUNTABLY MANY DUALISABLE ALGEBRAS
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.1201/9780203748671-20openalex-snapshot
Dualisability in general and endodualisability in particular
inferred← citeshttps://doi.org/10.2168/lmcs-11(2:15)2015openalex-snapshot
On absorption in semigroups and $n$-ary semigroups
inferred← citeshttps://doi.org/10.2178/jsl/1245158096openalex-snapshot
The existence of a near-unanimity term in a finite algebra is decidable
inferred← citeshttps://doi.org/10.48550/arxiv.1210.1475openalex-snapshot
Dualizability of automatic algebras
inferred← citeshttps://doi.org/10.48550/arxiv.1502.02192openalex-snapshot
Dualizable algebras with parallelogram terms
inferred← citeshttps://doi.org/10.48550/arxiv.1503.02651openalex-snapshot
Finite Abelian algebras are dualizable
inferred← citeshttps://doi.org/10.71548/23965openalex-snapshot
Results on the Computational Complexity of Linear Idempotent Mal'cev Conditions
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.