On the public citation graph

The uniqueness of finite division for recursive equivalence types

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/bf01558579openalex-snapshot
Congruences in isols with a finite modulus

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-1-4612-0325-4_1openalex-snapshot
The Work of Anil Nerode: A Retrospective
inferred← citeshttps://doi.org/10.1007/bf01111797openalex-snapshot
Solution of a problem of R. Friedberg
inferred← citeshttps://doi.org/10.1007/bf01116562openalex-snapshot
Universal isols
inferred← citeshttps://doi.org/10.1007/bf01362769openalex-snapshot
Additive relations among recursive equivalence types
inferred← citeshttps://doi.org/10.1007/bfb0079098openalex-snapshot
Recursive equivalence: A survey
inferred← citeshttps://doi.org/10.1007/bfb0086125openalex-snapshot
Polynomially isolated sets
inferred← citeshttps://doi.org/10.1016/0168-0072(92)90067-aopenalex-snapshot
Myhill's work in recursion theory
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71400-9openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/s1385-7258(67)50010-0openalex-snapshot
Invariance of Partial Order of Recursive Equivalence types under Finite Division
inferred← citeshttps://doi.org/10.1017/s1446788700019790openalex-snapshot
Recursive equivalence types and octahedra
inferred← citeshttps://doi.org/10.1080/03081088208817432openalex-snapshot
Bijective proofs of formulae for the number of standard Yound tableaux
inferred← citeshttps://doi.org/10.2140/pjm.1972.43.573openalex-snapshot
The decidability of a class of AE sentence in the isols
inferred← citeshttps://doi.org/10.2140/pjm.1975.61.87openalex-snapshot
Semigroups, Horn sentences and isolic structures
inferred← citeshttps://doi.org/10.2307/2270980openalex-snapshot
Rich co-ordinals, addition isomorphisms, and RETs
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.