CSL
2002
Springer
13 years 11 months ago
2002
Springer
CSL
2002
Springer
13 years 11 months ago
2002
Springer
CSL
2002
Springer
13 years 11 months ago
2002
Springer
d Abstract) Marcin Jurdzi
CSL
2002
Springer
13 years 11 months ago
2002
Springer
Abstract. We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic...
CSL
2002
Springer
13 years 11 months ago
2002
Springer
In the process of interactive theorem proving one often works with incomplete higher order proofs. In this paper we address the problem of giving a correctness criterion for these ...
CSL
2002
Springer
13 years 11 months ago
2002
Springer
Ludics has been proposed by Girard as an abstract general approach to proof theory. We explain how its basic notions correspond to those of the "innocent strategy" apprao...
CSL
2002
Springer
13 years 11 months ago
2002
Springer
CSL
2002
Springer
13 years 11 months ago
2002
Springer
CSL
2002
Springer
13 years 11 months ago
2002
Springer
A propositional proof system is automatizable if there is an algorithm that, given a tautology, produces a proof in time polynomial in the size of its smallest proof. This notion ...
CSL
2002
Springer
13 years 11 months ago
2002
Springer
Abstract. We show that Gentzen's sequent calculus admits generalization of semi-terms of particularly simple form. This theorem extends one of the main results in [BS95] to la...