Journal Papers Interaction and Depth against Nondeterminism in Proof Search


Abstract

Deep inference is a proof theoretic methodology that generalizes the standard notion of inference of the sequent calculus, whereby inference rules become applicable at any depth inside logical expressions. Deep inference provides more freedom in the design of deductive systems for different logics and a rich combinatoric analysis of proofs. In particular, construction of exponentially shorter analytic proofs becomes possible, however with the cost of a greater nondeterminism than in the sequent calculus. In this paper, building on our previous work on proof search with deep inference, we show that, by exploiting an interaction and depth scheme in the logical expressions, the nondeterminism in proof search can be reduced without losing the shorter proofs and without sacrificing proof theoretic cleanliness. We demonstrate our method on deep inference systems for multiplicative linear logic and classical logic, discuss its proof complexity and its relation to focusing, and present implementations.



Paper Details

Authors

O. Kahramanogullari

Publication

Logical Methods in Computer Science, 10, ,

Download

http://arxiv.org/abs/1403.2628

Language

English
.