On the public citation graph

On weakly pre-complete positive equivalences

https://doi.org/10.1007/bf00972779
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.1002/malq.19870330106openalex-snapshot
A Note on Positive Equivalence Relations
inferredcites →https://doi.org/10.1070/rm1961v016n03abeh001120openalex-snapshot
CONSTRUCTIVE ALGEBRAS I
inferredcites →https://doi.org/10.1305/ndjfl/1093890819openalex-snapshot
Effective extendability and fixed points.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19960420107openalex-snapshot
Remarks on Uniformly Finitely Precomplete Positive Equivalences
inferred← citeshttps://doi.org/10.1002/malq.201500057openalex-snapshot
Weakly precomplete computably enumerable equivalence relations
inferred← citeshttps://doi.org/10.1007/978-3-319-50062-1_25openalex-snapshot
A Survey on Universal Computably Enumerable Equivalence Relations
inferred← citeshttps://doi.org/10.1007/s00153-023-00896-0openalex-snapshot
On diagonal functions for equivalence relations
inferred← citeshttps://doi.org/10.1007/s10469-019-09538-yopenalex-snapshot
Weakly Precomplete Equivalence Relations in the Ershov Hierarchy
inferred← citeshttps://doi.org/10.1007/s10469-022-09688-6openalex-snapshot
Minimal Generalized Computable Numberings and Families of Positive Preorders
inferred← citeshttps://doi.org/10.1017/jsl.2013.8openalex-snapshot
UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
inferred← citeshttps://doi.org/10.1093/logcom/exad074openalex-snapshot
Fixed point theorems for minimal numberings
inferred← citeshttps://doi.org/10.1134/s0037446618010032openalex-snapshot
On Dark Computably Enumerable Equivalence Relations
inferred← citeshttps://doi.org/10.1142/s0129054125500248openalex-snapshot
Recursion Theorems in Numbered Sets
inferred← citeshttps://doi.org/10.3233/com-210387openalex-snapshot
Numberings, c.e. oracles, and fixed points
inferred← citeshttps://doi.org/10.55452/1998-6688-2025-22-3-199-209openalex-snapshot
A NOTE ON THE STRUCTURE OF MINIMAL DARK CEERS
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.