8,470 research outputs found
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. We present the
formalism of proof-graphs for purely implicational logic, which are graphs of a
specific shape that are intended to capture the logical structure of a
deduction. The advantage of this formalism is that formulas can be shared in
the reduced proof.
In the present paper we give a precise definition of proof-graphs for the
minimal implicational logic, together with a normalization procedure for these
proof-graphs. In contrast to standard tree-like formalisms, our normalization
does not increase the number of nodes, when applied to the corresponding
minimal proof-graph representations.Comment: In Proceedings DCM 2013, arXiv:1403.768
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 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
Making proofs without Modus Ponens: An introduction to the combinatorics and complexity of cut elimination
This paper is intended to provide an introduction to cut elimination which is
accessible to a broad mathematical audience. Gentzen's cut elimination theorem
is not as well known as it deserves to be, and it is tied to a lot of
interesting mathematical structure. In particular we try to indicate some
dynamical and combinatorial aspects of cut elimination, as well as its
connections to complexity theory. We discuss two concrete examples where one
can see the structure of short proofs with cuts, one concerning feasible
numbers and the other concerning "bounded mean oscillation" from real analysis
Generic Modal Cut Elimination Applied to Conditional Logics
We develop a general criterion for cut elimination in sequent calculi for
propositional modal logics, which rests on absorption of cut, contraction,
weakening and inversion by the purely modal part of the rule system. Our
criterion applies also to a wide variety of logics outside the realm of normal
modal logic. We give extensive example instantiations of our framework to
various conditional logics. For these, we obtain fully internalised calculi
which are substantially simpler than those known in the literature, along with
leaner proofs of cut elimination and complexity. In one case, conditional logic
with modus ponens and conditional excluded middle, cut elimination and
complexity were explicitly stated as open in the literature
- …