Beweisalgorithmen für die Prädikatenlogik

DOI10.1007/BF02236612MaRDI QIDQ2558006zbMATH OpenOpenAlexFDO

Authors G. Veenker

Publication date 1967

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02236612

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04) Classical first-order logic (03B10)

Cites work

• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• A Machine-Oriented Logic Based on the Resolution Principle
• A Proof Method for Quantification Theory: Its Justification and Realization
• A proof procedure for quantification theory
• An improved proof procedure1
• Beweisalgorithmen für die Prädikatenlogik
• Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
• scientific article; zbMATH DE number 3122413 (Why is no real title available?)
• scientific article; zbMATH DE number 3212023 (Why is no real title available?)
• scientific article; zbMATH DE number 3219316 (Why is no real title available?)
• scientific article; zbMATH DE number 3254919 (Why is no real title available?)
• scientific article; zbMATH DE number 3189740 (Why is no real title available?)
• Proving theorems by pattern recognition I
• Theorem-Proving for Computers: Some Results on Resolution and Renaming
• Theorem-Proving on the Computer
• Toward Mechanical Mathematics
• Vicious circle principle and the paradoxes

Cited in

(5)

• Larry Wos: visions of automated reasoning
• Set of support, demodulation, paramodulation: a historical perspective
• The unit-clause proof procedure with equality
• Beweisalgorithmen für die Prädikatenlogik
• What is essential unification?

This page was built for publication: Beweisalgorithmen für die Prädikatenlogik

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2558006)