On the public citation graph

Automated proofs of L�b's theorem and G�del's two incompletensess theorems

https://doi.org/10.1007/bf00244396
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/bf02757006openalex-snapshot
Provability interpretations of modal logic
inferredcites →https://doi.org/10.1017/cbo9781139164931openalex-snapshot
Computability and Logic
inferredcites →https://doi.org/10.1201/b13782-17openalex-snapshot
An Introduction to Mathematical Logic
inferredcites →https://doi.org/10.2307/2266895openalex-snapshot
Solution of a problem of Leon Henkin
inferredcites →https://doi.org/10.2307/2315369openalex-snapshot
On Formally Undecidable Propositions of Principia Mathematica and Related Systems.

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-030-29436-6_26openalex-snapshot
A Formally Verified Abstract Account of Gödel’s Incompleteness Theorems
inferred← citeshttps://doi.org/10.1007/978-88-470-0784-0_7openalex-snapshot
Automated Search for Gödel’s Proofs
inferred← citeshttps://doi.org/10.1007/bf00245024openalex-snapshot
Automated development of Tarski's geometry
inferred← citeshttps://doi.org/10.1007/bf00263451openalex-snapshot
Automated deduction in von Neumann-Bernays-G�del set theory
inferred← citeshttps://doi.org/10.1007/s10817-021-09599-8openalex-snapshot
Distilling the Requirements of Gödel’s Incompleteness Theorems with a Proof Assistant
inferred← citeshttps://doi.org/10.1007/s10817-022-09647-xopenalex-snapshot
Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq
inferred← citeshttps://doi.org/10.1016/j.apal.2004.10.014openalex-snapshot
Automated search for Gödel’s proofs
inferred← citeshttps://doi.org/10.1017/cbo9780511816772.004openalex-snapshot
Cognitive Modeling Paradigms
inferred← citeshttps://doi.org/10.1017/cbo9780511816772.008openalex-snapshot
Declarative/Logic-Based Cognitive Modeling
inferred← citeshttps://doi.org/10.1023/a:1005877613942openalex-snapshot
Abstract Proof Checking: An Example Motivated by an Incompleteness Theorem
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.