Cantitate/Preț
Produs

Sequents and Trees: An Introduction to the Theory and Applications of Propositional Sequent Calculi: Studies in Universal Logic

Autor Andrzej Indrzejczak
en Limba Engleză Hardback – 17 dec 2020
This textbook offers a detailed introduction to the methodology and applications of sequent calculi in propositional logic. Unlike other texts concerned with proof theory, emphasis is placed on illustrating how to use sequent calculi to prove a wide range of metatheoretical results.  The presentation is elementary and self-contained, with all technical details both formally stated and also informally explained.  Numerous proofs are worked through to demonstrate methods of proving important results, such as the cut-elimination theorem, completeness, decidability, and interpolation.  Other proofs are presented with portions left as exercises for readers, allowing them to practice techniques of sequent calculus.

After a brief introduction to classical propositional logic, the text explores three variants of sequent calculus and their features and applications.  The remaining chapters then show how sequent calculi can be extended, modified, andapplied to non-classical logics, including modal, intuitionistic, substructural, and many-valued logics.

Sequents and Trees is suitable for graduate and advanced undergraduate students in logic taking courses on proof theory and its application to non-classical logics.  It will also be of interest to researchers in computer science and philosophers.

Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 37727 lei  6-8 săpt.
  Springer International Publishing – 18 dec 2021 37727 lei  6-8 săpt.
Hardback (1) 36502 lei  3-5 săpt. +2933 lei  7-11 zile
  Springer International Publishing – 17 dec 2020 36502 lei  3-5 săpt. +2933 lei  7-11 zile

Din seria Studies in Universal Logic

Preț: 36502 lei

Preț vechi: 43978 lei
-17% Nou

Puncte Express: 548

Preț estimativ în valută:
6986 7369$ 5838£

Carte disponibilă

Livrare economică 10-24 decembrie
Livrare express 26-30 noiembrie pentru 3932 lei

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030571443
ISBN-10: 3030571440
Pagini: 345
Ilustrații: XVI, 345 p. 15 illus., 1 illus. in color.
Dimensiuni: 155 x 235 x 29 mm
Greutate: 0.69 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Birkhäuser
Seria Studies in Universal Logic

Locul publicării:Cham, Switzerland

Cuprins

Introduction.- Analytic Sequent Calculus for CPL.- Gentzen's Sequent Calculus LK.- Purely Logical Sequent Calculus.- Sequent Calculi for Modal Logics.- Alternatives to CPL.- Appendix.


Recenzii

“Each chapter of the book is structured in a similar way and contains the basic definitions, facts and necessary discussion regarding the key notions, accompanied with new ideas and a wide reference list, followed by the author's clear and approachable style. This book is self-contained, presenting an extensive survey of the applications and usefulness of cut elimination, and seems to be an extremely interesting source not only for logicians and philosophers, but also for researchers in computer science.” (Branislav Boričić, Mathematical Reviews, May, 2022)

Notă biografică

Andrzej Indrzejczak is a logician working on the problems of proof theory and its applications to non-classical logics. He is an author of several papers on natural deduction and sequent systems for modal and temporal logics, and of the monograph Natural Deduction, Hybrid Systems and Modal Logics (Springer, 2010).

Textul de pe ultima copertă

This textbook offers a detailed introduction to the methodology and applications of sequent calculus in propositional logic. Unlike other texts concerned with proof theory, emphasis is placed on illustrating how to use sequent calculus to prove a wide range of metatheoretical results.  The presentation is elementary and self-contained, with all technical details both formally stated and also informally explained.  Numerous proofs are worked through to demonstrate methods of proving important results, such as the cut-elimination theorem, completeness, decidability, and interpolation.  Other proofs are presented with portions left as exercises for readers, allowing them to practice techniques of sequent calculus.

After a brief introduction to classical propositional logic, the text explores three variants of sequent calculus and their features and applications.  The remaining chapters then show how sequent calculi can be extended, modified, and applied to non-classical logics, including modal, intuitionistic, subcultural, and many-valued logics.

Sequents and Trees is suitable for graduate and advanced undergraduate students in logic taking courses on proof theory and its application to non-classical logics.  It will also be of interest to researchers in computer science and philosophers.


Caracteristici

Considers the methodology and techniques of sequent calculus to illustrate its use in proving a wide range of metatheoretical results Includes many results and their proofs that are often not well known or easily accessible Examines important and nonstandard generalized sequent calculi, like hypersequent and structured sequent calculi.