On the public citation graph

A classification of universal algebras by infinitary relations

https://doi.org/10.1007/bf02944992
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.
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/mana.19700440120openalex-snapshot
Complete Sets for Finite Algebras
inferredcites →https://doi.org/10.1007/bf01072837openalex-snapshot
A series of precomplete classes in k-valued logic
inferredcites →https://doi.org/10.2140/pjm.1960.10.1169openalex-snapshot
On complete and independent sets of operations in finite algebras

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-1-4020-1898-5_5openalex-snapshot
Galois Connections for Operations and Relations
inferred← citeshttps://doi.org/10.1007/bf01350783openalex-snapshot
Some maximal closed classes of operations on infinite sets
inferred← citeshttps://doi.org/10.1007/bf02485391openalex-snapshot
The subalgebra systems of direct powers
inferred← citeshttps://doi.org/10.1007/bfb0063443openalex-snapshot
Galois theory for partial algebras
inferred← citeshttps://doi.org/10.1007/s00012-008-2100-2openalex-snapshot
A survey of clones on infinite sets
inferred← citeshttps://doi.org/10.1007/s00012-012-0209-9openalex-snapshot
A general Galois theory for operations and relations in arbitrary categories
inferred← citeshttps://doi.org/10.1007/s00012-018-0499-7openalex-snapshot
Galois connection for multiple-output operations
inferred← citeshttps://doi.org/10.1016/0022-4049(92)90108-ropenalex-snapshot
The variety of Boolean semirings
inferred← citeshttps://doi.org/10.1016/b978-0-7204-0406-7.50010-7openalex-snapshot
completeness properties of multiple-valued logic algebras
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.02.005openalex-snapshot
Dualizing Clones as Models of Lawvere Theories
inferred← citeshttps://doi.org/10.1080/00927872.2013.763256openalex-snapshot
A Generalized Version of the Baker–Pixley Theorem
inferred← citeshttps://doi.org/10.1142/s0218196713500021openalex-snapshot
A GENERAL DUALITY THEORY FOR CLONES
inferred← citeshttps://doi.org/10.1142/s1793830916500300openalex-snapshot
Characterization of zigzag De Morgan functions
inferred← citeshttps://doi.org/10.1216/rmj-1973-3-4-631openalex-snapshot
Strongly rigid relations
inferred← citeshttps://doi.org/10.1515/dema-2013-0058openalex-snapshot
The graphs of fibered automata
inferred← citeshttps://doi.org/10.1515/dema-2013-0335openalex-snapshot
Weak homomorphisms between functorial algebras
inferred← citeshttps://doi.org/10.7151/dmgaa.1121openalex-snapshot
The lattice of varieties of fibered automata
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.