On the public citation graph

Axiomatizability and completeness of some classes of s-polygons

https://doi.org/10.1007/bf01980252

0 signed · 15 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/bf01979704openalex-snapshot

Rings over which all modules of a given type are almost categorical

inferredcites →https://doi.org/10.1007/bf02572283openalex-snapshot

Perfect monoids

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

Perfect semigroups

inferredcites →https://doi.org/10.1112/jlms/s2-35.2.193openalex-snapshot

Axiomatisability Problems for S -Systems

inferredcites →https://doi.org/10.2307/2272466openalex-snapshot

Definability problems for modules and rings

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-010-9273-7openalex-snapshot

Axiomatisability problems for S-posets

inferred← citeshttps://doi.org/10.1007/s00233-012-9419-xopenalex-snapshot

Axiomatisability problems for S-acts, revisited

inferred← citeshttps://doi.org/10.1007/s10469-009-9040-6openalex-snapshot

Axiomatizability and completeness of some classes of partially ordered polygons

inferred← citeshttps://doi.org/10.1007/s10469-020-09612-wopenalex-snapshot

Axiomatizability of the Class of Subdirectly Irreducible Acts over an Abelian Group

inferred← citeshttps://doi.org/10.1007/s10469-024-09735-4openalex-snapshot

Axiomatizability of the Class of Subdirectly Irreducible S-Acts over a Commutative Monoid

inferred← citeshttps://doi.org/10.1007/s10958-009-9720-8openalex-snapshot

Model-theoretic properties of free, projective, and flat S-acts

inferred← citeshttps://doi.org/10.1007/s10958-010-9891-3openalex-snapshot

Axiomatizability of free S-posets

inferred← citeshttps://doi.org/10.1081/agb-120015672openalex-snapshot

AXIOMATISABILITY OF WEAKLY FLAT, FLAT, AND PROJECTIVES-ACTS

inferred← citeshttps://doi.org/10.1134/s0037446615030155openalex-snapshot

Axiomatizability and completeness of the class of injective acts over a commutative monoid or a group

inferred← citeshttps://doi.org/10.1134/s0037446617040073openalex-snapshot

Axiomatizability of the class of weakly injective S-acts

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.