On the public citation graph

On the relation provable equivalence and on partitions in effectively inseparable sets

https://doi.org/10.1007/bf01837553
0 signed · 32 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/bf01976264openalex-snapshot
Recursively enumerable classes and their application to recursive sequences of formal theories
inferredcites →https://doi.org/10.1007/bf02124724openalex-snapshot
On the algebraization of a Feferman's predicate
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.1515/9781400882007openalex-snapshot
Theory of Formal Systems. (AM-47)
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.

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.19890350309openalex-snapshot
On Some Properties of Recursively Enumerable Equivalence Relations
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-030-14812-6_3openalex-snapshot
Computable Isomorphisms of Distributive Lattices
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/bf00284977openalex-snapshot
Relatively precomplete numerations and arithmetic
inferred← citeshttps://doi.org/10.1007/bf00403335openalex-snapshot
? 0 n -equivalence relations
inferred← citeshttps://doi.org/10.1007/s10469-020-09592-xopenalex-snapshot
The Structure of Computably Enumerable Preorder Relations
inferred← citeshttps://doi.org/10.1007/s10469-022-09673-zopenalex-snapshot
Index Sets for Classes of Positive Preorders
inferred← citeshttps://doi.org/10.1007/s10469-026-09827-3openalex-snapshot
The Structure of Computable Reducibility on Preorders
inferred← citeshttps://doi.org/10.1016/j.apal.2014.04.001openalex-snapshot
Graphs realised by r.e. equivalence relations
inferred← citeshttps://doi.org/10.1016/j.apal.2017.12.001openalex-snapshot
Jumps of computably enumerable equivalence relations
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.11.042openalex-snapshot
Reducibilities among equivalence relations induced by recursively enumerable structures
inferred← citeshttps://doi.org/10.1017/jsl.2013.8openalex-snapshot
UNIVERSAL COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
inferred← citeshttps://doi.org/10.1017/s0960129516000335openalex-snapshot
Calibrating word problems of groups via the complexity of equivalence relations
inferred← citeshttps://doi.org/10.1093/jigpal/jzp030openalex-snapshot
Erratum to "The Ricean Objection: An Analogue of Rice's Theorem for First-Order Theories" * Logic Journal of the IGPL, 16(6): 585-590(2008)
inferred← citeshttps://doi.org/10.1134/s0037446625020016openalex-snapshot
On the Theory of Computably Enumerable Linear Preorders with Concatenation
inferred← citeshttps://doi.org/10.1134/s1995080214040180openalex-snapshot
On computably enumerable structures
inferred← citeshttps://doi.org/10.1134/s199508022002002xopenalex-snapshot
Minimal Equivalence Relations in Hyperarithmetical and Analytical Hierarchies
inferred← citeshttps://doi.org/10.1142/s1793557122501261openalex-snapshot
Computable embeddability for algebraic structures
inferred← citeshttps://doi.org/10.2140/pjm.1986.122.319openalex-snapshot
Some undecidability results for lattices in recursion theory
inferred← citeshttps://doi.org/10.2307/2273443openalex-snapshot
Classifying positive equivalence relations
inferred← citeshttps://doi.org/10.2307/2274228openalex-snapshot
Universal recursion theoretic properties of r.e. preordered structures
inferred← citeshttps://doi.org/10.2307/2274473openalex-snapshot
Maximal r.e. equivalence relations
inferred← citeshttps://doi.org/10.3233/com-180100openalex-snapshot
Measuring the complexity of reductions between equivalence relations
inferred← citeshttps://doi.org/10.36253/979-12-215-0778-2.05openalex-snapshot
Abstract views of incompleteness
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.