A Computing Procedure for Quantification Theory

1960 · Journal of the ACM · 2,623 citations · 4 from inside this corpus

The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.

5 of 5 neighbouring works in this corpus. Blue is what this paper cites; orange is what cites it, and a dashed line is one neighbour citing another. Only the largest labels are drawn — every node carries its full title on hover.

this paper works it cites works citing it node size = global citations · hover for the full title

What this paper cites, inside the corpus

Paper	Year	Cited
Introduction to Metamathematics	1952	4,374

What cites it, inside the corpus

Paper	Year	Cited
A Machine-Oriented Logic Based on the Resolution Principle	1965	3,929
A machine program for theorem-proving	1962	3,208
The complexity of satisfiability problems	1978	1,771
GRASP: a search algorithm for propositional satisfiability	1999	1,368

Links

DOI · Open access copy · OpenAlex record

Topics

Logic, programming, and type systems	Computer Science
Logic, Reasoning, and Knowledge	Computer Science
Computability, Logic, AI Algorithms	Computer Science

Is this record sound?

complete

Nothing in this record contradicts itself and no field we check is missing.

supports2 author record(s) attached.
supports6 reference(s) recorded.
neutralThe DOI carries no year to check against.
supportsA title is present.

Provenance

Everything above was read from one stored OpenAlex payload, fetched 2026-09-04T03:58:49+00:00.

sha256 a2172c1bbe00c44b…