Bibliographic record
Abstract
Abstract In 1971, inspired by the work of Lazard and Govorov for modules over a ring, Stenström proved that the strongly flat right actsASover a monoidS(that is, the acts that are directed colimits of finitely generated free acts) are those for which the functorAS⊗ (from the category of leftS‐acts into the category of sets) preserves pullbacks and equalizers. He also provided interpolation‐type conditions (now referred to in the literature as Property (P) and Property (E)) characterizing strong flatness. Unlike the situation for modules over a ring, strong flatness is strictly stronger than (mono‐) flatness (wherein the functorAS⊗ is required only to preserve monomorphisms). The study of flatness properties of partially ordered monoids acting on partially ordered sets was initiated by S. M. Fakhruddin in the 1980s, and has been continued recently in the paper “Indecomposable, projective, and flatS‐posets” by Shi, Liu, Wang, and Bulman–Fleming, Comm. Algebra33, 235–251 (2005). In that paper, a criterion for the equality of elements in a tensor product ofS‐posets is given and a version of Property (P) is presented that, as in the unordered case, implies flatness and is implied by projectivity. The present paper introduces a corresponding Property (E) and establishes an analogue of the Lazard–Govorov–Stenström theorem in the context ofS‐posets. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.002 | 0.005 |
| Scholarly communication | 0.003 | 0.006 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.008 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".