20 search results - page 2 / 4 » Proof Search Tree and Cut Elimination |
RTA
2005
Springer
13 years 10 months ago
2005
Springer
We present constructive arithmetic in Deduction modulo with rewrite rules only. In natural deduction and in sequent calculus, the cut elimination theorem and the analysis of the st...
RTA
2010
Springer
13 years 9 months ago
2010
Springer
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
Abstract. In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theor...
CSL
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
AIML
2006
13 years 6 months ago
2006
We see a systematic set of cut-free axiomatisations for all the basic normal modal logics formed by some combination the axioms d, t, b, 4, 5. They employ a form of deep inference ...