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.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:swb:14-1064911987703-38192 |
| Date | 25 August 2003 |
| Creators | Brünnler, Kai |
| Contributors | 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 |
| Publisher | Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:doctoralThesis |
| Format | application/pdf |
Page generated in 0.0064 seconds