On the public citation graph

Term minimal algebras

https://doi.org/10.1007/bf01195723
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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19870330207openalex-snapshot
Construction of Large Sets of Clones
inferredcites →https://doi.org/10.1007/bf01203365openalex-snapshot
Unary polynomials in algebras, I
inferredcites →https://doi.org/10.1007/bf02483114openalex-snapshot
Plain para primal algebras
inferredcites →https://doi.org/10.1007/bf02945100openalex-snapshot
Onn-permutable congruences
inferredcites →https://doi.org/10.1016/0021-8693(92)90121-2openalex-snapshot
Simple Abelian algebras
inferredcites →https://doi.org/10.1017/s1446788700029979openalex-snapshot
Simple surjective algebras having no proper subalgebras
inferredcites →https://doi.org/10.1017/s1446788700035266openalex-snapshot
Minimal varieties and quasivarieties
inferredcites →https://doi.org/10.1515/9781400882366openalex-snapshot
The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)
inferredcites →https://doi.org/10.7146/math.scand.a-10850openalex-snapshot
Algebras Whose Congruence Lattices are Distributive.

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-45022-x_24openalex-snapshot
Constraint Satisfaction Problems and Finite Algebras
inferred← citeshttps://doi.org/10.1007/bf01204788openalex-snapshot
Every nearly idempotent plain algebra generates a minimal variety
inferred← citeshttps://doi.org/10.1007/bf02341872openalex-snapshot
Monoid intervals in lattices of clones
inferred← citeshttps://doi.org/10.1007/bf02679760openalex-snapshot
Maximal clones in monoidal intervals. I
inferred← citeshttps://doi.org/10.1007/s00012-003-1829-xopenalex-snapshot
Collapsing monoids containing permutations and constants
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-008-2095-8openalex-snapshot
Collapsing monoids consisting of permutations and constants
inferred← citeshttps://doi.org/10.1007/s000120050003openalex-snapshot
The residual character of varieties generated by strictly simple term minimal algebras
inferred← citeshttps://doi.org/10.1007/s000120050066openalex-snapshot
Projectivity and isomorphism of strictly simple algebras
inferred← citeshttps://doi.org/10.1007/s000120050176openalex-snapshot
Minimal varieties of semirings with involution
inferred← citeshttps://doi.org/10.1016/0021-8693(92)90121-2openalex-snapshot
Simple Abelian algebras
inferred← citeshttps://doi.org/10.1017/s0960129597002430openalex-snapshot
Algorithms for categorical equivalence
inferred← citeshttps://doi.org/10.1090/proc/14801openalex-snapshot
An uncountable Jónsson algebra in a minimal variety
inferred← citeshttps://doi.org/10.1090/s0002-9947-97-01883-7openalex-snapshot
A Characterization of Minimal Locally Finite Varieties
inferred← citeshttps://doi.org/10.1137/s0097539700376676openalex-snapshot
Classifying the Complexity of Constraints Using Finite Algebras
inferred← citeshttps://doi.org/10.1145/1566445.1566503openalex-snapshot
Tricolorable torus knots are NP-complete
inferred← citeshttps://doi.org/10.1145/3282431openalex-snapshot
Surjective H-Colouring over Reflexive Digraphs
inferred← citeshttps://doi.org/10.14232/actasm-014-028-3openalex-snapshot
Monoidal intervals on three- and four-element sets
inferred← citeshttps://doi.org/10.2307/2586574openalex-snapshot
Categorical quasivarieties via Morita equivalence
inferred← citeshttps://doi.org/10.48550/arxiv.math/9605236openalex-snapshot
Projectivity and isomorphisms of strictly simple algebras
inferred← citeshttps://doi.org/10.71781/15465openalex-snapshot
Clones de constantes et de permutations et leur intervalle monoïdal
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.