On the public citation graph

Correction to A note on the Entscheidungsproblem

https://doi.org/10.2307/2269030
0 signed · 50 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.2307/2269326openalex-snapshot
A note on the Entscheidungsproblem
inferredcites →https://doi.org/10.2307/2371045openalex-snapshot
An Unsolvable Problem of Elementary Number Theory

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.19780241703openalex-snapshot
Restricted Decision Problems in Some Classes of Algebraic Systems
inferred← citeshttps://doi.org/10.1007/3-540-11157-3_27openalex-snapshot
What are the gains of the theory of algorithms
inferred← citeshttps://doi.org/10.1007/3-540-12689-9_103openalex-snapshot
Recurring dominoes: Making the highly undecidable highly understandable (preliminary report)
inferred← citeshttps://doi.org/10.1007/3-540-57785-8_131openalex-snapshot
The complexity of resource-bounded first-order classical logic
inferred← citeshttps://doi.org/10.1007/978-1-4020-1986-9_11openalex-snapshot
Antirealism and the Roles of Truth
inferred← citeshttps://doi.org/10.1007/978-1-4613-8928-6_34openalex-snapshot
Turing-Machines and the Entscheidungsproblem
inferred← citeshttps://doi.org/10.1007/978-1-4899-3797-1_1openalex-snapshot
A
inferred← citeshttps://doi.org/10.1007/978-1-4939-3223-8_2openalex-snapshot
First-Order Logic: Proofs with Quantifiers
inferred← citeshttps://doi.org/10.1007/978-3-030-83202-5_1openalex-snapshot
A Theory of Computability
inferred← citeshttps://doi.org/10.1007/978-3-030-83202-5_12openalex-snapshot
Creative and Productive Sets; Completeness and Incompleteness
inferred← citeshttps://doi.org/10.1007/978-3-030-83202-5_5openalex-snapshot
(Un)Computability via Church’s Thesis
inferred← citeshttps://doi.org/10.1007/978-3-031-08593-2_5openalex-snapshot
Rózsa Péter on the Philosophy and Foundations of Mathematics: A Reappraisal
inferred← citeshttps://doi.org/10.1007/978-3-031-15294-8_3openalex-snapshot
Logic and Epistemology in Behavioral Economics
inferred← citeshttps://doi.org/10.1007/978-3-319-22156-4_1openalex-snapshot
Conceptual Confluence in 1936: Post and Turing
inferred← citeshttps://doi.org/10.1007/978-3-319-22156-4_12openalex-snapshot
Why Turing’s Thesis Is Not a Thesis
inferred← citeshttps://doi.org/10.1007/978-3-319-42120-9_3openalex-snapshot
Part III: The original writings
inferred← citeshttps://doi.org/10.1007/978-3-319-69483-2_12openalex-snapshot
Reasoning About Periodicity on Infinite Words
inferred← citeshttps://doi.org/10.1007/978-3-319-74095-9_7openalex-snapshot
Knowledge Representation and Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-531-19691-6_14openalex-snapshot
Was Wissen voraussetzt
inferred← citeshttps://doi.org/10.1007/978-3-540-40007-3_24openalex-snapshot
Combining Decision Procedures
inferred← citeshttps://doi.org/10.1007/978-3-642-52789-0_4openalex-snapshot
Der engere Prädikatenkalkül.
inferred← citeshttps://doi.org/10.1007/978-3-642-81955-1_33openalex-snapshot
Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving
inferred← citeshttps://doi.org/10.1007/978-3-662-41928-1_4openalex-snapshot
Der engere Prädikatenkalkül
inferred← citeshttps://doi.org/10.1007/978-3-7091-8389-2_1openalex-snapshot
Über den Bau von Deduktionsmaschinen
inferred← citeshttps://doi.org/10.1007/978-94-009-9056-2_11openalex-snapshot
Recursion Theory
inferred← citeshttps://doi.org/10.1007/978-94-011-5428-4_3openalex-snapshot
Meaning, Reality and Algorithms: Implications of the Turing Theorem
inferred← citeshttps://doi.org/10.1007/978-94-015-1239-8_1openalex-snapshot
A
inferred← citeshttps://doi.org/10.1007/bf01801173openalex-snapshot
Wahrheit, Wirklichkeit und Logik in der Sprache der Physik
inferred← citeshttps://doi.org/10.1007/bf01982046openalex-snapshot
Kodifikation und Aussagenlogik
inferred← citeshttps://doi.org/10.1007/bfb0079416openalex-snapshot
Recursively unsolvable algorithmic problems and related questions reexamined
inferred← citeshttps://doi.org/10.1007/s00146-018-0842-8openalex-snapshot
Machine intelligence: a chimera
inferred← citeshttps://doi.org/10.1016/b978-044451541-4/50016-6openalex-snapshot
Classical Logic's Coming of Age
inferred← citeshttps://doi.org/10.1016/j.jsc.2026.102604openalex-snapshot
Symbolic Mathematical Computation 1965–1975: The emergence of a discipline
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71414-9openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73075-5openalex-snapshot
Recurring Dominoes: Making the Highly Undecidable Highly Understandable
inferred← citeshttps://doi.org/10.1016/s1874-5857(09)70019-6openalex-snapshot
The Logic of Church and Curry
inferred← citeshttps://doi.org/10.1093/philmat/nku006openalex-snapshot
Logic, Mathematics, and the A Priori, Part I: A Problem for Realism
inferred← citeshttps://doi.org/10.1093/phimat/nku006openalex-snapshot
Logic, Mathematics, and the A Priori, Part I: A Problem for Realism
inferred← citeshttps://doi.org/10.1145/321958.321960openalex-snapshot
Resolution Strategies as Decision Procedures
inferred← citeshttps://doi.org/10.1145/3747199.3747556openalex-snapshot
Symbolic Mathematical Computation 1965–1975
inferred← citeshttps://doi.org/10.2139/ssrn.6178286openalex-snapshot
Symbolic Mathematical Computation 1965–1975: The emergence of a discipline
inferred← citeshttps://doi.org/10.2307/421147openalex-snapshot
Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic
inferred← citeshttps://doi.org/10.2307/421196openalex-snapshot
On the Decision Problem for Two-Variable First-Order Logic
inferred← citeshttps://doi.org/10.3989/arbor.2013.764n6008openalex-snapshot
Alan Turing: ¿personaje del siglo XX?
inferred← citeshttps://doi.org/10.48550/arxiv.1404.1531openalex-snapshot
On the Remarkable Features of Binding Forms
inferred← citeshttps://doi.org/10.48550/arxiv.1712.04306openalex-snapshot
In folly ripe. In reason rotten. Putting machine theology to rest
inferred← citeshttps://doi.org/10.5642/jhummath.201901.05openalex-snapshot
From Solvability to Formal Decidability: Revisiting Hilbert’s “Non-Ignorabimus”
inferred← citeshttps://doi.org/10.70675/61130ea1zef23z4950z81e1z91b74939ff7copenalex-snapshot
Vers la vérification de propriétés de sûreté pour des systèmes infinis communicants : décidabilité et raffinement des abstractions
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.