Sequents and Trees

Beschreibung

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.

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.

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.

Autor*in

Andrzej Indrzejczak

Themen in »Sequents and Trees«

Sequent Calculus Cut Elimination Hypersequent calculus Non-classical logics Modal logics Propositional logics Decidability Interpolation

Stimmen zu »Sequents and Trees«

“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)

Details

Link teilen