Basic Proof Theory

出版者:Cambridge University Press

作者:A. S. Troelstra

页数:432

出版时间:2000-7-31

价格:USD 49.00

装帧:Paperback

isbn号码:9780521779111

丛书系列:Cambridge Tracts in Theoretical Computer Science

图书标签:数学逻辑学证明论计算机软件和理论计算机MathematicalLogicMathLogic

This introduction to the basic ideas of structural proof theory contains a thorough discussion and comparison of various types of formalization of first-order logic. Examples are given of several areas of application, namely: the metamathematics of pure first-order logic (intuitionistic as well as classical); the theory of logic programming; category theory; modal logic; linear logic; first-order arithmetic and second-order logic. In each case the aim is to illustrate the methods in relatively simple situations and then apply them elsewhere in much more complex settings. There are numerous exercises throughout the text. In general, the only prerequisite is a standard course in first-order logic, making the book ideal for graduate students and beginning researchers in mathematical logic, theoretical computer science and artificial intelligence. For the new edition, many sections have been rewritten to improve clarity, new sections have been added on cut elimination, and solutions to selected exercises have been included.

用户评价

比较新的证明论教材，符号表和推理规则中使用ot替代 eg。并没有直接介绍根岑式系统LK和LJ，而选择了和它们很像的系统，主要区别在于序贯中的序列变为多重集，并删除了结构规则中的交换规则，也介绍了去除其他结构规则的根岑式系统。

比较新的证明论教材，符号表和推理规则中使用ot替代 eg。并没有直接介绍根岑式系统LK和LJ，而选择了和它们很像的系统，主要区别在于序贯中的序列变为多重集，并删除了结构规则中的交换规则，也介绍了去除其他结构规则的根岑式系统。

比较新的证明论教材，符号表和推理规则中使用ot替代 eg。并没有直接介绍根岑式系统LK和LJ，而选择了和它们很像的系统，主要区别在于序贯中的序列变为多重集，并删除了结构规则中的交换规则，也介绍了去除其他结构规则的根岑式系统。

比较新的证明论教材，符号表和推理规则中使用ot替代 eg。并没有直接介绍根岑式系统LK和LJ，而选择了和它们很像的系统，主要区别在于序贯中的序列变为多重集，并删除了结构规则中的交换规则，也介绍了去除其他结构规则的根岑式系统。

虽然写的很难看（特别是符号），但有什么问题第一时间拿来参考的还是它……