Deep Inference and Symmetry in Classical Proofs

In this thesis we see deductive systems for classical propositional and predicate logic which use deep inference, i.e. inference rules apply arbitrarily deep inside formulas, and a certain symmetry, which provides an involution on derivations. Like sequent systems, they have a cut rule which is admi...

Full description

Bibliographic Details
Main Author: Brünnler, Kai
Other Authors: Technische Universität Dresden, Informatik
Format: Doctoral Thesis
Language:English
Published: Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden 2003
Subjects:
Online Access:http://nbn-resolving.de/urn:nbn:de:swb:14-1064911987703-38192
http://nbn-resolving.de/urn:nbn:de:swb:14-1064911987703-38192
http://www.qucosa.de/fileadmin/data/qucosa/documents/1073/1064911987703-3819.pdf
id ndltd-DRESDEN-oai-qucosa.de-swb-14-1064911987703-38192
record_format oai_dc
spelling ndltd-DRESDEN-oai-qucosa.de-swb-14-1064911987703-381922013-01-07T19:49:41Z Deep Inference and Symmetry in Classical Proofs Brünnler, Kai Beweistheorie Schnittelimination calculus of structures classical logic cut elimination deep inference proof theory symmetry ddc:28 rvk:SK 130 Beweistheorie Klassische Logik Schnittelimination In this thesis we see deductive systems for classical propositional and predicate logic which use deep inference, i.e. inference rules apply arbitrarily deep inside formulas, and a certain symmetry, which provides an involution on derivations. Like sequent systems, they have a cut rule which is admissible. Unlike sequent systems, they enjoy various new interesting properties. Not only the identity axiom, but also cut, weakening and even contraction are reducible to atomic form. This leads to inference rules that are local, meaning that the effort of applying them is bounded, and finitary, meaning that, given a conclusion, there is only a finite number of premises to choose from. The systems also enjoy new normal forms for derivations and, in the propositional case, a cut elimination procedure that is drastically simpler than the ones for sequent systems. Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden Technische Universität Dresden, Informatik Prof. Dr. rer. nat. habil. Steffen Hölldobler Prof. Dr. rer. nat. habil. Horst Reichel Prof. Dr. rer. nat. habil. Steffen Hölldobler Prof. Dr. Dale Miller 2003-08-25 doc-type:doctoralThesis application/pdf http://nbn-resolving.de/urn:nbn:de:swb:14-1064911987703-38192 urn:nbn:de:swb:14-1064911987703-38192 PPN108063194 http://www.qucosa.de/fileadmin/data/qucosa/documents/1073/1064911987703-3819.pdf eng
collection NDLTD
language English
format Doctoral Thesis
sources NDLTD
topic Beweistheorie
Schnittelimination
calculus of structures
classical logic
cut elimination
deep inference
proof theory
symmetry
ddc:28
rvk:SK 130
Beweistheorie
Klassische Logik
Schnittelimination
spellingShingle Beweistheorie
Schnittelimination
calculus of structures
classical logic
cut elimination
deep inference
proof theory
symmetry
ddc:28
rvk:SK 130
Beweistheorie
Klassische Logik
Schnittelimination
Brünnler, Kai
Deep Inference and Symmetry in Classical Proofs
description In this thesis we see deductive systems for classical propositional and predicate logic which use deep inference, i.e. inference rules apply arbitrarily deep inside formulas, and a certain symmetry, which provides an involution on derivations. Like sequent systems, they have a cut rule which is admissible. Unlike sequent systems, they enjoy various new interesting properties. Not only the identity axiom, but also cut, weakening and even contraction are reducible to atomic form. This leads to inference rules that are local, meaning that the effort of applying them is bounded, and finitary, meaning that, given a conclusion, there is only a finite number of premises to choose from. The systems also enjoy new normal forms for derivations and, in the propositional case, a cut elimination procedure that is drastically simpler than the ones for sequent systems.
author2 Technische Universität Dresden, Informatik
author_facet Technische Universität Dresden, Informatik
Brünnler, Kai
author Brünnler, Kai
author_sort Brünnler, Kai
title Deep Inference and Symmetry in Classical Proofs
title_short Deep Inference and Symmetry in Classical Proofs
title_full Deep Inference and Symmetry in Classical Proofs
title_fullStr Deep Inference and Symmetry in Classical Proofs
title_full_unstemmed Deep Inference and Symmetry in Classical Proofs
title_sort deep inference and symmetry in classical proofs
publisher Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden
publishDate 2003
url http://nbn-resolving.de/urn:nbn:de:swb:14-1064911987703-38192
http://nbn-resolving.de/urn:nbn:de:swb:14-1064911987703-38192
http://www.qucosa.de/fileadmin/data/qucosa/documents/1073/1064911987703-3819.pdf
work_keys_str_mv AT brunnlerkai deepinferenceandsymmetryinclassicalproofs
_version_ 1716470841871433728