MONSTER
Baaz, Matthias / Leitsch, Alexander:Trends in Logic: Methods of Cut-Elimination
- pocketboek 2013, ISBN: 9789400734975
[ED: Taschenbuch / Paperback], [PU: Springer Netherlands Springer, Berlin], KURZE BESCHREIBUNG/ANMERKUNGEN: This book offers a thorough, rigorous analysis of reductive cut-elimination met… Meer...
[ED: Taschenbuch / Paperback], [PU: Springer Netherlands Springer, Berlin], KURZE BESCHREIBUNG/ANMERKUNGEN: This book offers a thorough, rigorous analysis of reductive cut-elimination methods and an in-depth presentation of the recent method CERES developed by the authors. It includes several applications of CERES and an extension of CERES to non-classical logics.
AUSFÜHRLICHERE BESCHREIBUNG: This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs with only atomic cuts (atomic cut normal forms, so-called ACNFs). The first part investigates traditional reductive methods from the point of view of proof rewriting. Within this general framework, generalizations of Gentzen's and Sch"utte-Tait's cut-elimination methods are defined and shown terminating with ACNFs of the original proof. Moreover, a complexity theoretic comparison of Gentzen's and Tait's methods is given.
The core of the book centers around the cut-elimination method CERES (cut elimination by resolution) developed by the authors. CERES is based on the resolution calculus and radically differs from the reductive cut-elimination methods. The book shows that CERES asymptotically outperforms all reductive methods based on Gentzen's cut-reduction rules. It obtains this result by heavy use of subsumption theorems in clause logic. Moreover, several applications of CERES are given (to interpolation, complexity analysis of cut-elimination, generalization of proofs, and to the analysis of real mathematical proofs). Lastly, the book demonstrates that CERES can be extended to nonclassical logics, in particular to finitely-valued logics and to G"odel logic.
INHALT: 1 Preface.- 2 Introduction.- 3 Preliminaries.- 4 Complexity of Cut-Elimination.- 5 Reduction and Elimination.- 6 Cut-Elimination by Resolution.- 7 Extensions of CERES.- 8 Applications of CERES.- 9 CERES in Nonclassical Logics.- 10 Related Research., DE, [SC: 0.00], Neuware, gewerbliches Angebot, H: 235mm, B: 155mm, T: 15mm, 290, [GW: 456g], Selbstabholung und Barzahlung, PayPal, Offene Rechnung, Banküberweisung, Internationaler Versand<
| | booklooker.deSyndikat Buchdienst Verzendingskosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Details... |
(*) Uitverkocht betekent dat het boek is momenteel niet beschikbaar op elk van de bijbehorende platforms we zoeken.
Baaz, Matthias Leitsch, Alexander:Methods of Cut-Elimination
- pocketboek 2013, ISBN: 9789400734975
[ED: Softcover], [PU: Springer / Springer Netherlands], This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving… Meer...
[ED: Softcover], [PU: Springer / Springer Netherlands], This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs with only atomic cuts (atomic cut normal forms, so-called ACNFs). The first part investigates traditional reductive methods from the point of view of proof rewriting. Within this general framework, generalizations of Gentzen's and Sch"utte-Tait's cut-elimination methods are defined and shown terminating with ACNFs of the original proof. Moreover, a complexity theoretic comparison of Gentzen's and Tait's methods is given.
The core of the book centers around the cut-elimination method CERES (cut elimination by resolution) developed by the authors. CERES is based on the resolution calculus and radically differs from the reductive cut-elimination methods. The book shows that CERES asymptotically outperforms all reductive methods based on Gentzen's cut-reduction rules. It obtains this result by heavy use of subsumption theorems in clause logic. Moreover, several applications of CERES are given (to interpolation, complexity analysis of cut-elimination, generalization of proofs, and to the analysis of real mathematical proofs). Lastly, the book demonstrates that CERES can be extended to nonclassical logics, in particular to finitely-valued logics and to G"odel logic.
2013. VI, 290 S. Literaturverz. 23.
Versandfertig in 6-10 Tagen, DE, [SC: 0.00], Neuware, gewerbliches Angebot, Offene Rechnung (Vorkasse vorbehalten)<
| | booklooker.debuecher.de GmbH & Co. KG Verzendingskosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Details... |
(*) Uitverkocht betekent dat het boek is momenteel niet beschikbaar op elk van de bijbehorende platforms we zoeken.
MONSTER
Matthias Baaz:Methods of Cut-Elimination
- pocketboek ISBN: 9789400734975
[ED: Taschenbuch], [PU: Springer Netherlands], Neuware - This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just provin… Meer...
[ED: Taschenbuch], [PU: Springer Netherlands], Neuware - This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs with only atomic cuts (atomic cut normal forms, so-called ACNFs). The first part investigates traditional reductive methods from the point of view of proof rewriting. Within this general framework, generalizations of Gentzen's and Sch'utte-Tait's cut-elimination methods are defined and shown terminating with ACNFs of the original proof. Moreover, a complexity theoretic comparison of Gentzen's and Tait's methods is given. The core of the book centers around the cut-elimination method CERES (cut elimination by resolution) developed by the authors. CERES is based on the resolution calculus and radically differs from the reductive cut-elimination methods. The book shows that CERES asymptotically outperforms all reductive methods based on Gentzen's cut-reduction rules. It obtains this result by heavy use of subsumption theorems in clause logic. Moreover, several applications of CERES are given (to interpolation, complexity analysis of cut-elimination, generalization of proofs, and to the analysis of real mathematical proofs). Lastly, the book demonstrates that CERES can be extended to nonclassical logics, in particular to finitely-valued logics and to G'odel logic., DE, [SC: 0.00], Neuware, gewerbliches Angebot, 235x155x16 mm, 296, [GW: 450g], PayPal, Offene Rechnung, Banküberweisung, Internationaler Versand<
| | booklooker.deMein Buchshop Verzendingskosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Details... |
(*) Uitverkocht betekent dat het boek is momenteel niet beschikbaar op elk van de bijbehorende platforms we zoeken.
Matthias Baaz#Alexander Leitsch:Methods of Cut-Elimination
- pocketboek 2013, ISBN: 9789400734975
This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the alg… Meer...
This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs with only atomic cuts (atomic cut normal forms, so-called ACNFs). The first part investigates traditional reductive methods from the point of view of proof rewriting. Within this general framework, generalizations of Gentzen's and Sch”utte-Tait's cut-elimination methods are defined and shown terminating with ACNFs of the original proof. Moreover, a complexity theoretic comparison of Gentzen's and Tait's methods is given. The core of the book centers around the cut-elimination method CERES (cut elimination by resolution) developed by the authors. CERES is based on the resolution calculus and radically differs from the reductive cut-elimination methods. The book shows that CERES asymptotically outperforms all reductive methods based on Gentzen's cut-reduction rules. It obtains this result by heavy use of subsumption theorems in clause logic. Moreover, several applications of CERES are given (to interpolation, complexity analysis of cut-elimination, generalization of proofs, and to the analysis of real mathematical proofs). Lastly, the book demonstrates that CERES can be extended to nonclassical logics, in particular to finitely-valued logics and to G'odel logic. Buch (fremdspr.) Matthias Baaz#Alexander Leitsch Taschenbuch, Springer Netherland, 25.02.2013, Springer Netherland, 2013<
| | Orellfuessli.chNr. 34378120. Verzendingskosten:Lieferzeiten außerhalb der Schweiz 3 bis 21 Werktage, , Versandfertig innert 6 - 9 Werktagen, zzgl. Versandkosten. (EUR 16.85) Details... |
(*) Uitverkocht betekent dat het boek is momenteel niet beschikbaar op elk van de bijbehorende platforms we zoeken.
Matthias Baaz, Alexander Leitsch:Methods of Cut-Elimination
(Maandelijkse huur. Jaarlijks abonnement) 2013, ISBN: 9789400734975
This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the alg… Meer...
This is the first book on cut-elimination in first-order predicate logic from an algorithmic point of view. Instead of just proving the existence of cut-free proofs, it focuses on the algorithmic methods transforming proofs with arbitrary cuts to proofs with only atomic cuts (atomic cut normal forms, so-called ACNFs). The first part investigates traditional reductive methods from the point of view of proof rewriting. Within this general framework, generalizations of Gentzen's and Sch\”utte-Tait's cut-elimination methods are defined and shown terminating with ACNFs of the original proof. Moreover, a complexity theoretic comparison of Gentzen's and Tait's methods is given. The core of the book centers around the cut-elimination method CERES (cut elimination by resolution) developed by the authors. CERES is based on the resolution calculus and radically differs from the reductive cut-elimination methods. The book shows that CERES asymptotically outperforms all reductive methods based on Gentzen's cut-reduction rules. It obtains this result by heavy use of subsumption theorems in clause logic. Moreover, several applications of CERES are given (to interpolation, complexity analysis of cut-elimination, generalization of proofs, and to the analysis of real mathematical proofs). Lastly, the book demonstrates that CERES can be extended to nonclassical logics, in particular to finitely-valued logics and to G\"odel logic. 2013-02-25 Springer Netherland, Springer Netherland, 2013-02-25<
| | CampusRitter.deCampusritter Verzendingskosten:Lieferzeit 2-3 Werktage; Lieferung nur nach D. (EUR 0.00) Details... |
(*) Uitverkocht betekent dat het boek is momenteel niet beschikbaar op elk van de bijbehorende platforms we zoeken.