注重体验与质量的电子书资源下载网站
分类于: 云计算&大数据 职场办公
简介
Proofs and Algorithms: An Introduction to Logic and Computability 豆 0.0分
资源最后更新于 2020-07-26 15:37:44
作者:Gilles Dowek
出版社:Springer
出版日期:2011-01
ISBN:9780857291202
文件格式: pdf
标签: 计算机科学 算法 逻辑学 计算理论 计算机 Springer 2011
简介· · · · · ·
Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation. Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presen...
目录
Proofs.
-Predictive Logic.
-Inductive Definitions.
-Languages.
-The Languages of Predicate Logic.
-Proofs.
-Examples of Theories.
-Variations on the Principle of the Excluded Middle.
-Models.
-The Notion of a Model.
-The Soundness Theorem.
-The Completeness Theorem.
-Other Applications of the Notion of Model.
-Algorithms.
-Computable Functions.
-Computable Functions.
-Computability over Lists and Trees.
-Eliminating Recursion.
-Programs.
-Computation as a Sequence of Small Steps.
-Proofs and Algorithms.
-Church's Theorem.
-Automated Theorem Proving.
-Sequent Calculus.
-Proof Search in the Sequent Calculus Without Cuts.
-Decidable theories.
-Constructivity.
-Epilogue.
-Index.
-Bibliography
-Predictive Logic.
-Inductive Definitions.
-Languages.
-The Languages of Predicate Logic.
-Proofs.
-Examples of Theories.
-Variations on the Principle of the Excluded Middle.
-Models.
-The Notion of a Model.
-The Soundness Theorem.
-The Completeness Theorem.
-Other Applications of the Notion of Model.
-Algorithms.
-Computable Functions.
-Computable Functions.
-Computability over Lists and Trees.
-Eliminating Recursion.
-Programs.
-Computation as a Sequence of Small Steps.
-Proofs and Algorithms.
-Church's Theorem.
-Automated Theorem Proving.
-Sequent Calculus.
-Proof Search in the Sequent Calculus Without Cuts.
-Decidable theories.
-Constructivity.
-Epilogue.
-Index.
-Bibliography