On the public citation graph
On free, projective, and strongly flat acts
0 signed · 24 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/mana.19690410104openalex-snapshot
Indecomposable and Injective S‐systems with Zero
inferredcites →https://doi.org/10.1002/mana.19710480124openalex-snapshot
Flatness and localization over monoids
inferredcites →https://doi.org/10.1007/bf00968115openalex-snapshot
On homological classification of monoids
inferredcites →https://doi.org/10.1007/bf01223703openalex-snapshot
Characterization of monoids by torsion-free, flat, projective, and free acts
inferredcites →https://doi.org/10.1007/bf02572973openalex-snapshot
Projectivity of acts and morita equivalence of monoids
inferredcites →https://doi.org/10.1007/bfb0062038openalex-snapshot
Characterization of monoids by properties of finitely generated right acts and their right ideals
inferredcites →https://doi.org/10.4153/cmb-1967-026-1openalex-snapshot
The Injective Envelope of S-Sets
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-4614-3489-4_17openalex-snapshot
Transformation as a Fundamental Concept in Arithmetical Competence Modelling: An Example of Informatical Educational Science
inferred← citeshttps://doi.org/10.1007/978-3-642-25538-0_97openalex-snapshot
Characteristics of the Completely α-Absolutely Pure Monoid
inferred← citeshttps://doi.org/10.1007/bf02573256openalex-snapshot
A characterization of left cancellative monoids by flatness properties
inferred← citeshttps://doi.org/10.1007/bf02573468openalex-snapshot
Characterization of monoids by condition (P) of cyclic left acts
inferred← citeshttps://doi.org/10.1007/bf02574099openalex-snapshot
On monoids over which all strongly flat cyclic right acts are projective
inferred← citeshttps://doi.org/10.1007/bf02575023openalex-snapshot
On equalizer-flat and pullback-flat acts
inferred← citeshttps://doi.org/10.1007/s002339900050openalex-snapshot
Flat acts that satisfy condition (P)
inferred← citeshttps://doi.org/10.1016/0022-4049(87)90094-6openalex-snapshot
Characterization of monoids by properties of regular acts
inferred← citeshttps://doi.org/10.1080/00927879108824181openalex-snapshot
Products of projective S-Systems
inferred← citeshttps://doi.org/10.1080/00927879208824435openalex-snapshot
Characterization of monoids by properties of generators
inferred← citeshttps://doi.org/10.1080/00927879208824478openalex-snapshot
Flat and strongly flat s-systems
inferred← citeshttps://doi.org/10.1081/agb-120013320openalex-snapshot
STRONG FLATNESS PROPERTIES OF RIGHT S-ACTS SATISFYING CONDITION (P)
inferred← citeshttps://doi.org/10.1112/s0025579300007592openalex-snapshot
Flatness properties of acts over commutative, cancellative monoids
inferred← citeshttps://doi.org/10.1216/rmj.2021.51.2195openalex-snapshot
An investigation on S-hypersystems over semihypergroups
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.