Symposium on Automatic Demonstration

Symposium on Automatic Demonstration Held at Versailles/France, December 1968 / [electronic resource] : edited by M. Laudet, D. Lacombe, L. Nolin, M. Schützenberger. - VI, 310 p. online resource. - Lecture Notes in Mathematics, 125 0075-8434 ; . - Lecture Notes in Mathematics, 125 .

Allocution d'ouverture -- Presentation d'un langage de formalisation des demonstrations mathematiques naturelles -- The mathematical language AUTOMATH, its usage, and some of its extensions -- Proof theory and the accuracy of computations -- Aspects du Theoreme de completude selon Herbrand -- Decision procedure for theories categorical in Alefo -- On the long-range prospects of automatic theorem-proving -- The case for using equality axioms in automatic demonstration -- Hilbert's programme and the search for automatic proof procedures -- A linear format for resolution -- Refinement theorems in resolution theory -- Definitional approach to automatic demonstration -- Heuristic interest of using metatheorems -- A proof procedure with matrix reduction -- Axiom systems in automatic theorem proving -- Constructive validity -- Paramodulation and set of support.

9783540362623

10.1007/BFb0060620 doi


Logic, Symbolic and mathematical.
Mathematical Logic and Foundations.

QA8.9-10.3

511.3
(C) Powered by Koha

Powered by Koha