In several applications of sequent calculi going beyond pure logic, an introduction of suitably defined rules seems to be more profitable than addition of extra axiomatic sequents. A program of formalization of mathematical theories via rules of special sort was developed successfully by Negri and von Plato. In this paper a general theorem on possible ways of transforming axiomatic sequents into rules in sequent calculi is proved. We discuss its possible applications and provide some case studies for illustration
In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic i...
Multiary sequent terms were originally introduced as a tool for proving termination of permutative ...
When defined with general elimination/application rules, natural deduction and $\lambda$-calculus b...
In several applications of sequent calculi going beyond pure logic, an introduction of suitably defi...
A class of axiomatic theories with arbitrary quantifier alternations is identified and a conversion ...
In the previous chapter we developed linear logic in the form of natural deduction, which is appropr...
There is a quite intentional resemblance between the Cut Rule and Aristotle´s Syllogism. In this pap...
The multiary version of the $\lambda$-calculus with generalized applications integrates smoothly bot...
Treballs Finals del Màster de Lògica Pura i Aplicada, Facultat de Filosofia, Universitat de Barcelon...
AbstractMasini, A., 2-Sequent calculus: a proof theory of modalities, Annals of Pure and Applied Log...
A sequent calculus with the subformula property has long been recognised as a highly favourable star...
The paper is devoted to the study of one of the aspects of the so-called Evidence Algorithm programm...
. We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are i...
In this thesis we consider generic tools and techniques for the proof-theoretic investigation of not...
We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent i...
In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic i...
Multiary sequent terms were originally introduced as a tool for proving termination of permutative ...
When defined with general elimination/application rules, natural deduction and $\lambda$-calculus b...
In several applications of sequent calculi going beyond pure logic, an introduction of suitably defi...
A class of axiomatic theories with arbitrary quantifier alternations is identified and a conversion ...
In the previous chapter we developed linear logic in the form of natural deduction, which is appropr...
There is a quite intentional resemblance between the Cut Rule and Aristotle´s Syllogism. In this pap...
The multiary version of the $\lambda$-calculus with generalized applications integrates smoothly bot...
Treballs Finals del Màster de Lògica Pura i Aplicada, Facultat de Filosofia, Universitat de Barcelon...
AbstractMasini, A., 2-Sequent calculus: a proof theory of modalities, Annals of Pure and Applied Log...
A sequent calculus with the subformula property has long been recognised as a highly favourable star...
The paper is devoted to the study of one of the aspects of the so-called Evidence Algorithm programm...
. We describe a sequent calculus, based on work of Herbelin, of which the cut-free derivations are i...
In this thesis we consider generic tools and techniques for the proof-theoretic investigation of not...
We introduce a systematic procedure to transform large classes of (Hilbert) axioms into equivalent i...
In 1994 Herbelin started and partially achieved the programme of showing that, for intuitionistic i...
Multiary sequent terms were originally introduced as a tool for proving termination of permutative ...
When defined with general elimination/application rules, natural deduction and $\lambda$-calculus b...