Sequents and Trees
Sequents and Trees
复制标题
序列和树
DOI:
10.1007/978-3-030-57145-0
复制
发表时间:
2021
期刊:
影响因子:
--
通讯作者:
Andrzej Indrzejczak
中科院分区:
文献类型:
--
作者:
Andrzej Indrzejczak
There are a lot of excellent works in proof theory using various forms of Sequent Calculi (SC) as the basic formal systems. 1 This book is of a different character. It is not a systematic exposition of proof theory using sequent calculus but it is a methodological study of sequent calculi as such. Of course it is not possible to present sequent calculi and their applications and to avoid a presentation of important issues in proof theory. However, our aim is to focus on the tools not on the results; the latter will serve as examples illustrating proof techniques developed in the framework of sequent calculi. In my opinion sequent calculi are truly amazing kind of formal systems and they deserve a separate study. In what follows we will present several variants of rules and calculi, describe their merits and focus on their applications. In particular, we will present in detail several methods of proving the most important results like the cut-elimination theorem, completeness, decidability, interpolation.The book is elementary and self-contained. All technical details will be introduced both formally and with informal explanations. Proofs will be presented in detail but with a lot of gaps left as exercises for the careful reader. As our aim is to show how to use sequent calculi we must underline here that it is essential to do most of the exercises to gain a working knowledge of the methods presented. There is a tendency in contemporary works to present very general results. This is theoretically valuable but for a novice it may be hard to follow. In this book we opt for a different route; we rather present several case studies which are much simpler to grasp. After careful study of such special cases, the general and uniform treatment of broad classes of similar problems may be developed more easily. We focus on proofs. Not so much on proofs in SC since their construction is rather simple and any reader who has worked with tableau systems should have no problem with proof search in SC. We rather focus on proofs of the most profound results concerning SC. We also want to show how easily