3690 search results - page 12 / 738 » Computation with classical sequents |
188
click to vote
SIGCSE
2003
ACM
15 years 5 months ago
2003
ACM
Computer science has a reputation of being a discipline in a perpetual state of accelerated progress—a discipline in which our techniques, our hardware, our software systems, an...
BIRTHDAY
2007
Springer
15 years 6 months ago
2007
Springer
Superdeduction is a systematic way to extend a deduction system like the sequent calculus by new deduction rules computed from the user theory. We show how this could be done in a ...
89
Voted
IGPL
1998
14 years 11 months ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
APAL
2006
14 years 11 months ago
2006
I present a new syntactical method for proving the Interpolation Theorem for the implicational fragment of intuitionistic logic and its substructural subsystems. This method, like...
103
click to vote
AIML
2008
15 years 1 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...