On the public citation graph
Algebraic properties of crowns and fences
0 signed · 30 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/978-3-0348-5547-1openalex-snapshot
Funktionen- und Relationenalgebren
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/bf00400285openalex-snapshot
On algebraic properties of monotone clones
inferredcites →https://doi.org/10.1007/bf01187059openalex-snapshot
Polynomial interpolation and the Chinese Remainder Theorem for algebraic systems
inferredcites →https://doi.org/10.1016/0012-365x(81)90201-6openalex-snapshot
A structure theory for ordered sets
inferredcites →https://doi.org/10.1016/0097-3165(76)90003-0openalex-snapshot
A fixed point theorem for finite partially ordered sets
inferredcites →https://doi.org/10.2307/2372146openalex-snapshot
On the Construction of Partially Ordered Systems with a Given Group of Automorphisms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf00418652openalex-snapshot
Clones, order varieties, near unanimity functions and holes
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.1007/s00012-004-1819-7openalex-snapshot
Finite posets and topological spaces in locally finite varieties
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-023-00834-4openalex-snapshot
Surjective polymorphisms of directed reflexive cycles
inferred← citeshttps://doi.org/10.1007/s11083-005-9009-6openalex-snapshot
On Constantive Simple and Order-Primal Algebras
inferred← citeshttps://doi.org/10.1007/s11083-019-09486-3openalex-snapshot
On Finite Generability of Clones of Finite Posets
inferred← citeshttps://doi.org/10.1007/s11083-021-09571-6openalex-snapshot
Critical Relations of Crowns in Critical Times of Coronavirus Depression
inferred← citeshttps://doi.org/10.1007/s40840-019-00772-2openalex-snapshot
Regularity in the Semigroup of Transformations Preserving a Zig-Zag Order
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00077-6openalex-snapshot
A projection property and Arrow's impossibility theorem
inferred← citeshttps://doi.org/10.1017/s0004972700018104openalex-snapshot
Monotone clones, residual smallness and congruence distributivity
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/16m110527xopenalex-snapshot
NU Polymorphisms on Reflexive Digraphs
inferred← citeshttps://doi.org/10.14232/phd.10958openalex-snapshot
On Two Problems Concerning Partially Ordered Sets
inferred← citeshttps://doi.org/10.4134/ckms.2015.30.4.349openalex-snapshot
COREGULARITY OF ORDER-PRESERVING SELF-MAPPING SEMIGROUPS OF FENCES
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.