On the public citation graph
Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen
0 signed · 31 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/malq.19670130104openalex-snapshot
The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_34openalex-snapshot
Turing-Machines and the Entscheidungsproblem
inferredcites →https://doi.org/10.1007/978-1-4899-5327-8_22openalex-snapshot
Two Undecidable Classes of Formulas in Classical Predicate Calculus
inferredcites →https://doi.org/10.1007/bf01470748openalex-snapshot
Turing-machines and the Entscheidungsproblem
inferredcites →https://doi.org/10.1016/s0049-237x(08)70839-5openalex-snapshot
On the Decision Problem for Formulas in which all Disjunctions are Binary
inferredcites →https://doi.org/10.1073/pnas.48.3.365openalex-snapshot
ENTSCHEIDUNGSPROBLEM REDUCED TO THE AEA CASE
inferredcites →https://doi.org/10.1145/320856.320867openalex-snapshot
A Variant to Turing's Theory of Computing Machines
inferredcites →https://doi.org/10.1305/ndjfl/1093958753openalex-snapshot
A property of sentences that define quasi-order.
inferredcites →https://doi.org/10.2307/1969974openalex-snapshot
Certain Logical Reduction and Decision Problems
inferredcites →https://doi.org/10.2307/1970290openalex-snapshot
Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines
inferredcites →https://doi.org/10.2307/2266211openalex-snapshot
On the reduction of the decision problem. First paper. Ackermann prefix, a single binary predicate
inferredcites →https://doi.org/10.2307/2267211openalex-snapshot
On the reduction of the decision problem
inferredcites →https://doi.org/10.2307/2267689openalex-snapshot
Some theorems on definability and decidability
inferredcites →https://doi.org/10.2307/2268142openalex-snapshot
László Kalmár und János Surányi. On the reduction of the decision problem. Second paper. Gödel prefix, a single binary predicate. Ebd., S. 65–73.
inferredcites →https://doi.org/10.2307/2270511openalex-snapshot
The decision problem for formulas in prenex conjunctive normal form with binary disjunctions
inferredcites →https://doi.org/10.7146/math.scand.a-10862openalex-snapshot
The Decision Problem for Segregated Formulas in First-Order Logic.
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.19730190803openalex-snapshot
Eine Entscheidbare Klasse Von Kromformeln
inferred← citeshttps://doi.org/10.1002/malq.19880340107openalex-snapshot
First‐Order Formulas in Conjunctive Quantificational Form
inferred← citeshttps://doi.org/10.1007/3-540-13331-3_50openalex-snapshot
Spektralproblem and completeness of logical decision problems
inferred← citeshttps://doi.org/10.1007/3-540-52753-2_54openalex-snapshot
Stratification of definite clause programs and of general logic programs
inferred← citeshttps://doi.org/10.1007/bf00289267openalex-snapshot
The equivalence of Horn and network complexity for Boolean functions
inferred← citeshttps://doi.org/10.1007/bf02011872openalex-snapshot
Bemerkung zu Gurevich's Arbeit über das Entscheidungsproblem für Standardklassen
inferred← citeshttps://doi.org/10.1007/bf02276798openalex-snapshot
Diem-Grade Logischer Entscheidungsprobleme
inferred← citeshttps://doi.org/10.1007/bf02318025openalex-snapshot
Prefix classes of krom formulae with identity
inferred← citeshttps://doi.org/10.1016/0304-3975(80)90042-0openalex-snapshot
The reachability problem for Petri nets and decision problems for Skolem arithmetic
inferred← citeshttps://doi.org/10.1016/0743-1066(87)90014-8openalex-snapshot
Unification as a complexity measure for logic programming
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71820-2openalex-snapshot
Decision Problems in Predicate Logic
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
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.