On the public citation graph

On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate

https://doi.org/10.2307/2266211
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/978-3-540-89107-9_6openalex-snapshot
Grundlagen der Mathematik
inferredcites →https://doi.org/10.1007/978-3-658-18619-7_2openalex-snapshot
Grundlagen der Mathematik
inferredcites →https://doi.org/10.1007/bf01565424openalex-snapshot
Beiträge zum Entscheidungsproblem der mathematischen Logik
inferredcites →https://doi.org/10.1007/bf01565439openalex-snapshot
General recursive functions of natural numbers
inferredcites →https://doi.org/10.1112/plms/s2-42.1.230openalex-snapshot
On Computable Numbers, with an Application to the Entscheidungsproblem
inferredcites →https://doi.org/10.1215/s0012-7094-36-00227-2openalex-snapshot
λ-definability and recursiveness
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
inferredcites →https://doi.org/10.4064/fm-30-1-257-348openalex-snapshot
Untersuchungen über das Entscheidunsproblem des mathematischen Logik

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.19880340508openalex-snapshot
On a Reconstruction of Models with Only One Binary Relation
inferred← citeshttps://doi.org/10.1007/978-3-030-29160-0_3openalex-snapshot
László Kalmár and the First University-Level Programming and Computer Science Training in Hungary
inferred← citeshttps://doi.org/10.1007/978-3-642-02614-0_17openalex-snapshot
A Groupoid of Isomorphic Data Transformations
inferred← citeshttps://doi.org/10.1007/978-3-642-20877-5_33openalex-snapshot
On the Amount of Nonconstructivity in Learning Recursive Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-65400-8_4openalex-snapshot
Der engere Prädikatenkalkül
inferred← citeshttps://doi.org/10.1007/978-3-662-11932-7_4openalex-snapshot
Der engere Prädikatenkalkül
inferred← citeshttps://doi.org/10.1007/978-3-662-41928-1_4openalex-snapshot
Der engere Prädikatenkalkül
inferred← citeshttps://doi.org/10.1007/bf02020722openalex-snapshot
Contributions to the reduction theory of the decision problem
inferred← citeshttps://doi.org/10.1007/bf02025119openalex-snapshot
Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71439-3openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1016/s0049-237x(09)70115-6openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1142/s0129626414400039openalex-snapshot
On the Influence of Technology on Learning Processes
inferred← citeshttps://doi.org/10.1145/1599410.1599432openalex-snapshot
An embedded declarative data transformation language
inferred← citeshttps://doi.org/10.1145/1863597.1863602openalex-snapshot
Hereditarily finite representations of natural numbers and self-delimiting codes
inferred← citeshttps://doi.org/10.1145/2513228.2513264openalex-snapshot
Two mechanisms for generating infinite families of pairing bijections
inferred← citeshttps://doi.org/10.2307/2266781openalex-snapshot
On the reduction of the decision problem. Third paper. Pepis prefix, a single binary predicate
inferred← citeshttps://doi.org/10.2307/2267211openalex-snapshot
On the reduction of the decision problem
inferred← citeshttps://doi.org/10.2478/sh-2020-0026openalex-snapshot
The Mystery of the Fifth Logical Notion (Alice in the Wonderful Land of Logical Notions)
inferred← citeshttps://doi.org/10.48550/arxiv.0808.0554openalex-snapshot
Ranking and Unranking of Hereditarily Finite Functions and Permutations
inferred← citeshttps://doi.org/10.48550/arxiv.0808.0555openalex-snapshot
Pairing Functions, Boolean Evaluation and Binary Decision Diagrams in Prolog
inferred← citeshttps://doi.org/10.48550/arxiv.0808.0753openalex-snapshot
Ranking Catamorphisms and Unranking Anamorphisms on Hereditarily Finite Datatypes
inferred← citeshttps://doi.org/10.48550/arxiv.0808.0754openalex-snapshot
A Functional Hitchhiker's Guide to Hereditarily Finite Sets, Ackermann Encodings and Pairing Functions
inferred← citeshttps://doi.org/10.48550/arxiv.0808.0760openalex-snapshot
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
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.