On the public citation graph
Monoids for Which Condition (P) Acts are Projective
0 signed · 28 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.1007/bf02572973openalex-snapshot
Projectivity of acts and morita equivalence of monoids
inferredcites →https://doi.org/10.1007/bf02573519openalex-snapshot
Monoids over which all flat cyclic right acts are strongly flat
inferredcites →https://doi.org/10.1007/bf02574099openalex-snapshot
On monoids over which all strongly flat cyclic right acts are projective
inferredcites →https://doi.org/10.1007/bf02575023openalex-snapshot
On equalizer-flat and pullback-flat acts
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.1080/00927879208824478openalex-snapshot
Flat and strongly flat s-systems
inferredcites →https://doi.org/10.1093/oso/9780198511946.001.0001openalex-snapshot
Fundamentals of Semigroup Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00233-008-9094-0openalex-snapshot
On covers of cyclic acts over monoids
inferred← citeshttps://doi.org/10.1007/s00233-017-9908-zopenalex-snapshot
On uniform acts over semigroups
inferred← citeshttps://doi.org/10.1007/s00233-021-10188-9openalex-snapshot
On covers of acts over monoids with condition $$(PF'')$$ and envelopes of S-acts
inferred← citeshttps://doi.org/10.1007/s00233-025-10573-8openalex-snapshot
Exact flat acts over monoids
inferred← citeshttps://doi.org/10.1017/s0013091513000618openalex-snapshot
Covers of Acts Over Monoids and Pure Epimorphisms
inferred← citeshttps://doi.org/10.1017/s0017089514000317openalex-snapshot
COVERS FOR S-ACTS AND CONDITION (A) FOR A MONOID S
inferred← citeshttps://doi.org/10.1080/00927870008827000openalex-snapshot
On flatness properties of cyclic acts
inferred← citeshttps://doi.org/10.1080/00927870500274853openalex-snapshot
Strongly Flat andPO-FlatS-Posets
inferred← citeshttps://doi.org/10.1080/00927870903390660openalex-snapshot
Strongly Flat and Condition (P) Covers of Acts Over Monoids
inferred← citeshttps://doi.org/10.1080/00927872.2013.765007openalex-snapshot
On Some Finitary Conditions Arising from the Axiomatisability of Certain Classes of Monoid Acts
inferred← citeshttps://doi.org/10.1080/00927872.2016.1233335openalex-snapshot
An approach to injective acts over monoids based on indecomposability
inferred← citeshttps://doi.org/10.1081/agb-200040992openalex-snapshot
INDECOMPOSABLE, PROJECTIVE, AND FLATS-POSETS
inferred← citeshttps://doi.org/10.1112/jlms.70404openalex-snapshot
The flat cover conjecture for monoid acts
inferred← citeshttps://doi.org/10.1142/s1793557113500496openalex-snapshot
STRONGLY TORSION FREE ACTS OVER MONOIDS
inferred← citeshttps://doi.org/10.1142/s1793557116500480openalex-snapshot
On deleted diagonal acts of completely (0-) simple semigroups
inferred← citeshttps://doi.org/10.15672/hujms.552216openalex-snapshot
On covers of acts over monoids with Condition $(P')$
inferred← citeshttps://doi.org/10.4134/bkms.2014.51.4.1015openalex-snapshot
ON SOME OPEN PROBLEMS OF MAHMOUDI AND RENSHAW
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.