Proof theory: sequent calculi and related formalisms
"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...
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Boca Raton
CRC Press, Taylor & Francis Group
[2015]
|
| Schriftenreihe: | Discrete mathematics and its applications
|
| Schlagwörter: | |
| Links: | https://learning.oreilly.com/library/view/-/9781466564664/?ar |
| Zusammenfassung: | "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"-- |
| Beschreibung: | Includes bibliographical references (pages 364-374) and index |
| Umfang: | 1 Online-Ressource (x, 376 Seiten :) illustrations. |
| ISBN: | 9781466564664 1466564660 9781466564688 1466564687 9781322636467 132263646X 9780429099694 042909969X |
Internformat
MARC
| LEADER | 00000cam a22000002 4500 | ||
|---|---|---|---|
| 001 | ZDB-30-ORH-077128214 | ||
| 003 | DE-627-1 | ||
| 005 | 20240228121601.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 220322s2015 xx |||||o 00| ||eng c | ||
| 020 | |a 9781466564664 |c hardback |9 978-1-4665-6466-4 | ||
| 020 | |a 1466564660 |c hardback |9 1-4665-6466-0 | ||
| 020 | |a 9781466564688 |c e-book ; |9 978-1-4665-6468-8 | ||
| 020 | |a 1466564687 |c e-book ; |9 1-4665-6468-7 | ||
| 020 | |a 9781322636467 |c MyiLibrary |9 978-1-322-63646-7 | ||
| 020 | |a 132263646X |c MyiLibrary |9 1-322-63646-X | ||
| 020 | |a 9780429099694 |c electronic bk. |9 978-0-429-09969-4 | ||
| 020 | |a 042909969X |c electronic bk. |9 0-429-09969-X | ||
| 035 | |a (DE-627-1)077128214 | ||
| 035 | |a (DE-599)KEP077128214 | ||
| 035 | |a (ORHE)9781466564664 | ||
| 035 | |a (DE-627-1)077128214 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 082 | 0 | |a 511.3/6 |2 23 | |
| 100 | 1 | |a Bimbó, Katalin |d 1963- |e VerfasserIn |4 aut | |
| 245 | 1 | 0 | |a Proof theory |b sequent calculi and related formalisms |c Katalin Bimbó, University of Alberta, Edmonton, Canada |
| 264 | 1 | |a Boca Raton |b CRC Press, Taylor & Francis Group |c [2015] | |
| 300 | |a 1 Online-Ressource (x, 376 Seiten :) |b illustrations. | ||
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 490 | 0 | |a Discrete mathematics and its applications | |
| 500 | |a Includes bibliographical references (pages 364-374) and index | ||
| 520 | |a "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"-- | ||
| 650 | 0 | |a Proof theory | |
| 650 | 4 | |a Théorie de la preuve | |
| 650 | 4 | |a MATHEMATICS ; General | |
| 650 | 4 | |a MATHEMATICS ; Arithmetic | |
| 650 | 4 | |a MATHEMATICS ; Set Theory | |
| 650 | 4 | |a Proof theory | |
| 776 | 1 | |z 9781466564664 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781466564664 |
| 966 | 4 | 0 | |l DE-91 |p ZDB-30-ORH |q TUM_PDA_ORH |u https://learning.oreilly.com/library/view/-/9781466564664/?ar |m X:ORHE |x Aggregator |z lizenzpflichtig |3 Volltext |
| 912 | |a ZDB-30-ORH | ||
| 912 | |a ZDB-30-ORH | ||
| 951 | |a BO | ||
| 912 | |a ZDB-30-ORH | ||
| 049 | |a DE-91 | ||
Datensatz im Suchindex
| DE-BY-TUM_katkey | ZDB-30-ORH-077128214 |
|---|---|
| _version_ | 1821494823495925760 |
| adam_text | |
| any_adam_object | |
| author | Bimbó, Katalin 1963- |
| author_facet | Bimbó, Katalin 1963- |
| author_role | aut |
| author_sort | Bimbó, Katalin 1963- |
| author_variant | k b kb |
| building | Verbundindex |
| bvnumber | localTUM |
| collection | ZDB-30-ORH |
| ctrlnum | (DE-627-1)077128214 (DE-599)KEP077128214 (ORHE)9781466564664 |
| dewey-full | 511.3/6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.3/6 |
| dewey-search | 511.3/6 |
| dewey-sort | 3511.3 16 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03683cam a22005292 4500</leader><controlfield tag="001">ZDB-30-ORH-077128214</controlfield><controlfield tag="003">DE-627-1</controlfield><controlfield tag="005">20240228121601.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">220322s2015 xx |||||o 00| ||eng c</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781466564664</subfield><subfield code="c">hardback</subfield><subfield code="9">978-1-4665-6466-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1466564660</subfield><subfield code="c">hardback</subfield><subfield code="9">1-4665-6466-0</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781466564688</subfield><subfield code="c">e-book ;</subfield><subfield code="9">978-1-4665-6468-8</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">1466564687</subfield><subfield code="c">e-book ;</subfield><subfield code="9">1-4665-6468-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781322636467</subfield><subfield code="c">MyiLibrary</subfield><subfield code="9">978-1-322-63646-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">132263646X</subfield><subfield code="c">MyiLibrary</subfield><subfield code="9">1-322-63646-X</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780429099694</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-0-429-09969-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">042909969X</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">0-429-09969-X</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)077128214</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)KEP077128214</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ORHE)9781466564664</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627-1)077128214</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3/6</subfield><subfield code="2">23</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bimbó, Katalin</subfield><subfield code="d">1963-</subfield><subfield code="e">VerfasserIn</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Proof theory</subfield><subfield code="b">sequent calculi and related formalisms</subfield><subfield code="c">Katalin Bimbó, University of Alberta, Edmonton, Canada</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boca Raton</subfield><subfield code="b">CRC Press, Taylor & Francis Group</subfield><subfield code="c">[2015]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (x, 376 Seiten :)</subfield><subfield code="b">illustrations.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Discrete mathematics and its applications</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (pages 364-374) and index</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"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"--</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Proof theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Théorie de la preuve</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MATHEMATICS ; General</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MATHEMATICS ; Arithmetic</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">MATHEMATICS ; Set Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="776" ind1="1" ind2=" "><subfield code="z">9781466564664</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781466564664</subfield></datafield><datafield tag="966" ind1="4" ind2="0"><subfield code="l">DE-91</subfield><subfield code="p">ZDB-30-ORH</subfield><subfield code="q">TUM_PDA_ORH</subfield><subfield code="u">https://learning.oreilly.com/library/view/-/9781466564664/?ar</subfield><subfield code="m">X:ORHE</subfield><subfield code="x">Aggregator</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">BO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-30-ORH</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91</subfield></datafield></record></collection> |
| id | ZDB-30-ORH-077128214 |
| illustrated | Illustrated |
| indexdate | 2025-01-17T11:20:30Z |
| institution | BVB |
| isbn | 9781466564664 1466564660 9781466564688 1466564687 9781322636467 132263646X 9780429099694 042909969X |
| language | English |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM |
| owner_facet | DE-91 DE-BY-TUM |
| physical | 1 Online-Ressource (x, 376 Seiten :) illustrations. |
| psigel | ZDB-30-ORH TUM_PDA_ORH ZDB-30-ORH |
| publishDate | 2015 |
| publishDateSearch | 2015 |
| publishDateSort | 2015 |
| publisher | CRC Press, Taylor & Francis Group |
| record_format | marc |
| series2 | Discrete mathematics and its applications |
| spelling | Bimbó, Katalin 1963- VerfasserIn aut Proof theory sequent calculi and related formalisms Katalin Bimbó, University of Alberta, Edmonton, Canada Boca Raton CRC Press, Taylor & Francis Group [2015] 1 Online-Ressource (x, 376 Seiten :) illustrations. Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Discrete mathematics and its applications Includes bibliographical references (pages 364-374) and index "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"-- Proof theory Théorie de la preuve MATHEMATICS ; General MATHEMATICS ; Arithmetic MATHEMATICS ; Set Theory 9781466564664 Erscheint auch als Druck-Ausgabe 9781466564664 |
| spellingShingle | Bimbó, Katalin 1963- Proof theory sequent calculi and related formalisms Proof theory Théorie de la preuve MATHEMATICS ; General MATHEMATICS ; Arithmetic MATHEMATICS ; Set Theory |
| title | Proof theory sequent calculi and related formalisms |
| title_auth | Proof theory sequent calculi and related formalisms |
| title_exact_search | Proof theory sequent calculi and related formalisms |
| title_full | Proof theory sequent calculi and related formalisms Katalin Bimbó, University of Alberta, Edmonton, Canada |
| title_fullStr | Proof theory sequent calculi and related formalisms Katalin Bimbó, University of Alberta, Edmonton, Canada |
| title_full_unstemmed | Proof theory sequent calculi and related formalisms Katalin Bimbó, University of Alberta, Edmonton, Canada |
| title_short | Proof theory |
| title_sort | proof theory sequent calculi and related formalisms |
| title_sub | sequent calculi and related formalisms |
| topic | Proof theory Théorie de la preuve MATHEMATICS ; General MATHEMATICS ; Arithmetic MATHEMATICS ; Set Theory |
| topic_facet | Proof theory Théorie de la preuve MATHEMATICS ; General MATHEMATICS ; Arithmetic MATHEMATICS ; Set Theory |
| work_keys_str_mv | AT bimbokatalin prooftheorysequentcalculiandrelatedformalisms |