On the public citation graph

On the reduction of the decision problem

https://doi.org/10.2307/2267211
0 signed · 24 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/bf01565424openalex-snapshot
Beiträge zum Entscheidungsproblem der mathematischen Logik
inferredcites →https://doi.org/10.1007/bf01708881openalex-snapshot
Zum Entscheidungsproblem des logischen Funktionenkalküls
inferredcites →https://doi.org/10.2307/2266211openalex-snapshot
On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate

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.19880340209openalex-snapshot
Eine Bemerkung Zur Spektralen Darstellung Von ϱ‐Stelligen Aufzählbaren Und Koaufzählbaren Prädikaten Durch Ausdrücke Aus ∃∞∀ϵ∃(ϱ, 1) ∀∞∃(ϱ, 1) Und ∀∞∃(∞, 1)
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-319-67997-6_17openalex-snapshot
Computers from Plants We Never Made: Speculations
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-52789-0_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/bf02020736openalex-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.1093/logcom/exq022openalex-snapshot
Preservation by fibring of the finite model property
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.2307/2274274openalex-snapshot
The unsolvability of the Gödel class with identity
inferred← citeshttps://doi.org/10.2748/tmj/1178245231openalex-snapshot
Sur les formes normales
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.0760openalex-snapshot
Declarative Combinatorics: Boolean Functions, Circuit Synthesis and BDDs in Haskell
inferred← citeshttps://doi.org/10.48550/arxiv.0808.2953openalex-snapshot
Declarative Combinatorics: Isomorphisms, Hylomorphisms and Hereditarily Finite Data Types 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.