On the public citation graph
Existence of endo-rigid Boolean algebras
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.
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/bf02483101openalex-snapshot
Some questions about Boolean algebras
inferredcites →https://doi.org/10.1007/bfb0080986openalex-snapshot
Existence of rigid-like families of Abelian p-groups
inferredcites →https://doi.org/10.1016/0022-4049(91)90078-gopenalex-snapshot
Classification theory and the number of non-isomorphic models
inferredcites →https://doi.org/10.1090/s0002-9939-1979-0521887-7openalex-snapshot
Boolean Algebras with Few Endomorphisms
inferredcites →https://doi.org/10.4064/fm-126-3-217-243openalex-snapshot
Modules over arbitrary domains II
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bfb0098503openalex-snapshot
Around Classification Theory of Models
inferred← citeshttps://doi.org/10.1007/s00012-007-2028-yopenalex-snapshot
Endomorphisms of monadic Boolean algebras
inferred← citeshttps://doi.org/10.1016/j.aim.2017.11.002openalex-snapshot
There is no bound on sizes of indecomposable Banach spaces
inferred← citeshttps://doi.org/10.11606/t.45.2018.tde-19042018-123305openalex-snapshot
Extensões conexas e espaços de Banach C(K) com poucos operadores
inferred← citeshttps://doi.org/10.48550/arxiv.1512.04767openalex-snapshot
Combinatorial background for non-structure
inferred← citeshttps://doi.org/10.48550/arxiv.1601.03596openalex-snapshot
Compactness of the quantifier on "Complete Embedding of BA's"
inferred← citeshttps://doi.org/10.48550/arxiv.2106.13068openalex-snapshot
Kaplansky Test Problems for $R$-Modules in ZFC
inferred← citeshttps://doi.org/10.59277/rrmpa.2024.61.76openalex-snapshot
A CONSTRUCTION VIA FORCING OF A HEREDITARILY WEAKLY KOSZMIDER SPACE
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.