On the public citation graph

An improved prenex normal form1

https://doi.org/10.2307/2964650
0 signed · 12 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 points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/malq.19670130104openalex-snapshot
The Decision Problem for a Class of First‐Order Formulas in Which all Disjunctions are Binary
inferred← citeshttps://doi.org/10.1002/malq.19870330213openalex-snapshot
Eine Bemerkung Zum Reduktionstyp ∀3 ∃(0, 1)
inferred← citeshttps://doi.org/10.1002/malq.19880340109openalex-snapshot
Eine Bemerkung Zur Spektralen Darstellung Aufzählbarer Und Koaufzählbarer Prädikate Durch Ausdrücke Aus ∀∃∀∃∞ (ϱ, 1)
inferred← citeshttps://doi.org/10.1007/3-540-18170-9_159openalex-snapshot
Spectral representation of recursively enumerable and coenumerable predicates
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)70839-5openalex-snapshot
On the Decision Problem for Formulas in which all Disjunctions are Binary
inferred← citeshttps://doi.org/10.1016/s0049-237x(08)71820-2openalex-snapshot
Decision Problems in Predicate Logic
inferred← citeshttps://doi.org/10.1090/s0002-9947-1965-0170812-4openalex-snapshot
Reduced Products and Horn Classes
inferred← citeshttps://doi.org/10.2307/2270511openalex-snapshot
The decision problem for formulas in prenex conjunctive normal form with binary disjunctions
inferred← citeshttps://doi.org/10.2307/2272893openalex-snapshot
The finite controllability of the Maslov case
inferred← citeshttps://doi.org/10.48550/arxiv.2006.11720openalex-snapshot
On functor-quotients and their isomorphism theorems
inferred← citeshttps://doi.org/10.7146/math.scand.a-10862openalex-snapshot
The Decision Problem for Segregated Formulas in First-Order Logic.
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.