Logic for computer science: foundations of automatic theorem proving 论文

1985引用 410
Logic, programming, and type systemssemigroups and automata theoryComputability, Logic, AI Algorithms

摘要

This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in fir

相关事件

暂无数据

相关文章

暂无数据