Sciweavers

TABLEAUX
1995
Springer
13 years 8 months ago
On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof...
Stephan Schmitt, Christoph Kreitz
RTA
2010
Springer
13 years 8 months ago
A Proof Calculus Which Reduces Syntactic Bureaucracy
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 ...
Alessio Guglielmi, Tom Gundersen, Michel Parigot
TABLEAUX
1999
Springer
13 years 8 months ago
The Non-Associative Lambek Calculus with Product in Polynomial Time
We prove, by introducing a new kind of sequent calculus, that the decision problem for the non-associative Lambek calculus with product belongs to PTIME. This solves an open prolem...
Philippe de Groote
LPAR
2001
Springer
13 years 9 months ago
A Local System for Classical Logic
Abstract. The calculus of structures is a framework for specifying logical systems, which is similar to the one-sided sequent calculus but more general. We present a system of infe...
Kai Brünnler, Alwen Fernanto Tiu
CSL
2001
Springer
13 years 9 months ago
Non-commutativity and MELL in the Calculus of Structures
We introduce the calculus of structures: it is more general than the sequent calculus and it allows for cut elimination and the subformula property. We show a simple extension of m...
Alessio Guglielmi, Lutz Straßburger
CSL
2004
Springer
13 years 10 months ago
Abstract Interpretation of Proofs: Classical Propositional Calculus
Interpretation of Proofs: Classical Propositional Calculus Martin Hyland DPMMS, Centre for Mathematical Sciences, University of Cambridge, England Representative abstract interpret...
Martin Hyland
TLCA
2007
Springer
13 years 10 months ago
An Isomorphism Between Cut-Elimination Procedure and Proof Reduction
Abstract. This paper introduces a cut-elimination procedure of the intuitionistic sequent calculus and shows that it is isomorphic to the proof reduction of the intuitionistic natu...
Koji Nakazawa
TLCA
2007
Springer
13 years 10 months ago
Completing Herbelin's Programme
Abstract. In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic implicational logic, there is a Curry-Howard interpretation of sequent c...
José Espírito Santo
TABLEAUX
2007
Springer
13 years 10 months ago
A Cut-Free Sequent Calculus for Bi-intuitionistic Logic
Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with...
Linda Buisman, Rajeev Goré
CIE
2007
Springer
13 years 10 months ago
Refocusing Generalised Normalisation
Abstract. When defined with general elimination/application rules, natural deduction and λ-calculus become closer to sequent calculus. In order to get real isomorphism, normalisa...
José Espírito Santo