Muutke küpsiste eelistusi

E-raamat: Proof Theory: Sequent Calculi and Related Formalisms

(University of Alberta, Edmonton, Canada)
  • Formaat - EPUB+DRM
  • Hind: 74,09 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

"Sequent calculi constitute an interesting and important category of proof systems. They are much less known than axiomatic systems or natural deduction systems are, and they are much less known than they should be. Sequent calculi were designed as a theoretical framework for investigations of logical consequence, and they live up to the expectations completely as an abundant source of meta-logical results. The goal of this book is to provide a fairly comprehensive view of sequent calculi -- including a wide range of variations. The focus is on sequent calculi for various non-classical logics, from intuitionistic logic to relevance logic, through linear and modal logics. A particular version of sequent calculi, the so-called consecution calculi, have seen important new developments in the last decade or so. The invention of new consecution calculi for various relevance logics allowed the last major open problem in the area of relevance logic to be solved positively: pure ticket entailment is decidable. An exposition of this result is included in chapter 9 together with further new decidability results (for less famous systems). A series of other results that were obtained by J. M. Dunn and me, or by me in the last decade or so, are also presented in various places in the book. Some of these results are slightly improved in their current presentation. Obviously, many calculi and several important theorems are not new. They are included here to ensure the completeness of the picture; their original formulations may be found in the referenced publications. This book contains very little about semantics, in general, and about the semantics of non-classical logic in particular"--

Although sequent calculi constitute an important category of proof systems, they are not as well known as axiomatic and natural deduction systems. Addressing this deficiency, Proof Theory: Sequent Calculi and Related Formalisms presents a comprehensive treatment of sequent calculi, including a wide range of variations. It focuses on sequent calculi for various non-classical logics, from intuitionistic logic to relevance logic, linear logic, and modal logic.

In the first chapters, the author emphasizes classical logic and a variety of different sequent calculi for classical and intuitionistic logics. She then presents other non-classical logics and meta-logical results, including decidability results obtained specifically using sequent calculus formalizations of logics.

The book is suitable for a wide audience and can be used in advanced undergraduate or graduate courses. Computer scientists will discover intriguing connections between sequent calculi and resolution as well as between sequent calculi and typed systems. Those interested in the constructive approach will find formalizations of intuitionistic logic and two calculi for linear logic. Mathematicians and philosophers will welcome the treatment of a range of variations on calculi for classical logic. Philosophical logicians will be interested in the calculi for relevance logics while linguists will appreciate the detailed presentation of Lambek calculi and their extensions.

Arvustused

"Katalin Bimbo is one of the leading relevance logicians in the world today and indeed one of the leading non-classical logicians in general. Her book on proof theory takes readers through standard (classical) proof theory and beyond, including proof theory for some of the most important non-classical logics. The discussion is brilliantly executed. All graduate students interested in logic should study this book and all faculty too. I plan to use the book often." Jc Beall, Professor of Philosophy, University of Connecticut, and Professorial Fellow, Northern Institute of Philosophy, University of Aberdeen

Preface ix
1 Proofs and proof theory
1(10)
1.1 Proofs of all kinds
1(2)
1.2 Early history of proof theory in a nutshell
3(6)
1.3 Proofs as calculations
9(2)
2 Classical first-order logic
11(46)
2.1 The sequent calculus LK
11(10)
2.2 An axiom system for Fol
21(3)
2.3 Equivalence of LK and K
24(27)
2.4 Interpretations, soundness and completeness
51(6)
3 Variants of the first sequent calculi
57(23)
3.1 Intuitionistic logic and other modifications
57(5)
3.2 Sequent calculi with multisets and sets
62(3)
3.3 Sequent calculi with no structural rules
65(4)
3.4 One-sided sequent calculi
69(1)
3.5 Uniform sequent calculi
70(5)
3.6 Disjunction property
75(1)
3.7 Translations between classical and intuitionistic logics
76(4)
4 Sequent calculi for non-classical logics
80(58)
4.1 Associative Lambek calculus
80(6)
4.2 Extensions of the associative Lambek calculus
86(17)
4.3 Relevant implication and pure entailment
103(9)
4.4 Non-distributive logic of relevant implication
112(3)
4.5 Linear logic
115(7)
4.6 Positive logic of relevant implication
122(8)
4.7 Sequent calculi for modal logics
130(5)
4.8 Merge calculi
135(3)
5 Consecution calculi for non-classical logics
138(61)
5.1 Non-associative Lambek calculus
138(5)
5.2 Structurally free logics
143(21)
5.3 More implicational relevance logics
164(20)
5.4 Positive entailment logics
184(7)
5.5 Calculi with multiple right-hand side
191(8)
6 Display calculi and hypersequents
199(22)
6.1 Display logics with star
199(6)
6.2 Display logic for linear logic
205(3)
6.3 Display logic for symmetric gaggles
208(9)
6.4 Hypersequent calculi
217(4)
7 Cut rules and cut theorems
221(48)
7.1 Uniform cut theorem
221(5)
7.2 Mix, multiple and single cuts
226(16)
7.3 Constants and the cut
242(5)
7.4 Display cut
247(3)
7.5 Cut theorem via normal proofs
250(5)
7.6 Cut theorem via interpretations
255(8)
7.7 Analytic cut
263(3)
7.8 Consequences of the cut theorem and uses of the cut rules
266(3)
8 Some other proof systems
269(22)
8.1 Natural deduction systems
269(3)
8.2 Tableau systems
272(11)
8.3 Resolution systems
283(8)
9 Applications and applied calculi
291(63)
9.1 Decidability
291(41)
9.2 Sequent calculi for mathematical theories
332(2)
9.3 Typed and labeled calculi
334(20)
Appendix
354(10)
A Some supplementary concepts
354(10)
A.1 Trees
354(4)
A.2 Multiple inductive proofs
358(3)
A.3 Curry's paradox
361(3)
Bibliography 364(11)
Index 375
Katalin Bimbo