Records found and checked by machines, not reviewed by an editor · What this means →

Claim · 1974 · publication · Stated in source · Supported

Kowalski (1974) bases the interpretation of predicate logic as a programming language on reading implications of the form 'B if A1 and … and An' as procedure declarations, with problems posed as theorems to be proved and proofs as computations.

One recorded claim. The claim panel gives its qualification, the source passages with their place in each source, and how it was checked.

What it connects

Predicate Logic as Programming Language → discusses →

Where it appears

No collection page holds this claim. It is listed with its records in the explorer.