On the public citation graph

The relation of A to Prov ˹A˺ in the Lindenbaum sentence algebra

https://doi.org/10.2307/2272065
0 signed · 25 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.19680140702openalex-snapshot
Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
inferredcites →https://doi.org/10.1007/978-3-540-89107-9_6openalex-snapshot
Grundlagen der Mathematik
inferredcites →https://doi.org/10.1038/136126a0openalex-snapshot
Grundlagen der Mathematik
inferredcites →https://doi.org/10.1093/comjnl/12.1.28openalex-snapshot
Theory of Recursive Functions and Effective Computability
inferredcites →https://doi.org/10.2307/2266895openalex-snapshot
Solution of a problem of Leon Henkin
inferredcites →https://doi.org/10.2307/2316720openalex-snapshot
Theory of Recursive Functions and Effective Computability.
inferredcites →https://doi.org/10.2307/2964649openalex-snapshot
Transfinite recursive progressions of axiomatic theories
inferredcites →https://doi.org/10.4064/fm-49-1-35-92openalex-snapshot
Arithmetization of metamathematics in a general setting

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-3-662-21635-4openalex-snapshot
Aspects of Incompleteness
inferred← citeshttps://doi.org/10.1007/bf00403335openalex-snapshot
? 0 n -equivalence relations
inferred← citeshttps://doi.org/10.1007/bf01375554openalex-snapshot
On the complexity of arithmetical interpretations of modal formulae
inferred← citeshttps://doi.org/10.1007/bf02123401openalex-snapshot
The uniqueness of the fixed-point in every diagonalizable algebra
inferred← citeshttps://doi.org/10.1007/bf02125226openalex-snapshot
The fixed-point theorem for diagonalizable algebras
inferred← citeshttps://doi.org/10.1007/bf02925653openalex-snapshot
Problemi aperti sulle algebre diagonali
inferred← citeshttps://doi.org/10.1007/s11787-012-0070-9openalex-snapshot
A Short Note on Essentially Σ1 Sentences
inferred← citeshttps://doi.org/10.1016/0168-0072(93)e0079-4openalex-snapshot
A course on bimodal provability logic
inferred← citeshttps://doi.org/10.1016/0168-0072(94)90063-9openalex-snapshot
The logic of arithmetical hierarchy
inferred← citeshttps://doi.org/10.1016/j.apal.2009.05.013openalex-snapshot
Around provability logic
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71123-6openalex-snapshot
The Incompleteness Theorems
inferred← citeshttps://doi.org/10.1023/a:1005505417416openalex-snapshot
Nonmonotonicity in (the Metamathematics of) Arithmetic
inferred← citeshttps://doi.org/10.1093/jigpal/jzn013openalex-snapshot
Modal Matters for Interpretability Logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzp082openalex-snapshot
A new principle in the interpretability logic of all reasonable arithmetical theories
inferred← citeshttps://doi.org/10.1093/jigpal/jzp096openalex-snapshot
Self provers and 1 sentences
inferred← citeshttps://doi.org/10.1093/logcom/exy033openalex-snapshot
Trial and error mathematics: Dialectical systems and completions of theories
inferred← citeshttps://doi.org/10.21099/tkbjm/1496159532openalex-snapshot
On reflection principles
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.