On the public citation graph

Homomorphisms of semigroups of binary relations

0 signed · 19 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.1007/bf02572957openalex-snapshot

Union and symmetry preserving homomorphisms of semigroups of closed relations

inferredcites →https://doi.org/10.1017/s0004972700041460openalex-snapshot

Zero-free fortifying homomorphisms and semigroups of relations

inferredcites →https://doi.org/10.1017/s0017089500000033openalex-snapshot

Matrix representations of semigroups

inferredcites →https://doi.org/10.1017/s1446788700007047openalex-snapshot

Isomorphisms of triform semigroups

inferredcites →https://doi.org/10.21136/cmj.1970.100967openalex-snapshot

Union and symmetry preserving endomorphisms of the semigroup of all binary relations on a set

inferredcites →https://doi.org/10.4153/cmb-1966-009-7openalex-snapshot

Automorphisms of the Semigroup of all Relations on a Set

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf02195747openalex-snapshot

Union preserving homomorphisms of semigroups of closed relations

inferred← citeshttps://doi.org/10.1007/bf02315969openalex-snapshot

Finite binary relations have no more complexity than finite functions

inferred← citeshttps://doi.org/10.1007/bf02505909openalex-snapshot

Binary relations as lattice isomorphisms

inferred← citeshttps://doi.org/10.1007/bf02572792openalex-snapshot

Partial orders, closed relations and their automorphisms

inferred← citeshttps://doi.org/10.1007/bf02573596openalex-snapshot

Partial orders and their semigroups of closed relations

inferred← citeshttps://doi.org/10.1007/bf02575541openalex-snapshot

Monomorphisms of transformation semigroups

inferred← citeshttps://doi.org/10.1017/s1446788700017924openalex-snapshot

Isomorphisms between semigroups of isotone maps

inferred← citeshttps://doi.org/10.1023/a:1015880225781openalex-snapshot

Complete Semigroups of Binary Relations Defined by Elementary and Nodal X-Semilattices of Unions

inferred← citeshttps://doi.org/10.1023/a:1025030132270openalex-snapshot

Complete Semigroups of Binary Relations

inferred← citeshttps://doi.org/10.1023/a:1025096800410openalex-snapshot

Semigroups of Binary Relations with Right Units

inferred← citeshttps://doi.org/10.1090/s0002-9947-1972-0312448-1openalex-snapshot

𝑄-composable properties, semigroups and 𝐶𝑀-homomorphisms

inferred← citeshttps://doi.org/10.1515/dema-1990-0405openalex-snapshot

On A Characterization Of Cm-Homomorphisms

inferred← citeshttps://doi.org/10.21136/cmj.1981.101736openalex-snapshot

The maximal regular ideal of the semigroup of binary relations

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.