Proof-graphs for Minimal Implicational Logic
It is well-known that the size of propositional classical proofs can be huge. Proof theoretical studies discovered exponential gaps between normal or cut free proofs and their respective non-normal proofs. The aim of this work is to study how to reduce the weight of propositional deductions. W...
Main Authors: | Marcela Quispe-Cruz, Edward Hermann Haeusler, Lew Gordeev |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2014-03-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1404.0082v1 |
Similar Items
-
Proof Compression and NP Versus PSPACE II
by: Lew Gordeev, et al.
Published: (2020-11-01) -
SOME RESULTS IN A PROOF-THEORY BASED ON GRAPHS
by: MARCELA QUISPE CRUZ
Published: (2014) -
[en] SOME RESULTS IN A PROOF-THEORY BASED ON GRAPHS
by: MARCELA QUISPE CRUZ
Published: (2017) -
Propositional Logics Complexity and the Sub-Formula Property
by: Edward Hermann Haeusler
Published: (2015-04-01) -
Two basic results on translations between logics
by: Edward Hermann Haeusler, et al.
Published: (2016-12-01)