Sciweavers

3690 search results - page 1 / 738
» Computation with classical sequents
Sort
View
CSL
2003
Springer
14 years 4 months ago
Atomic Cut Elimination for classical Logic
System SKS is a set of rules for classical propositional logic presented in the calculus of structures. Like sequent systems and unlike natural deduction systems, it has an explici...
Kai Brünnler
MSCS
2008
57views more  MSCS 2008»
13 years 10 months ago
Computation with classical sequents
Steffen van Bakel, Pierre Lescanne
LPAR
2001
Springer
14 years 3 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
TLCA
1999
Springer
14 years 3 months ago
Strong Normalisation of Cut-Elimination in Classical Logic
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
Christian Urban, Gavin M. Bierman
IANDC
2000
70views more  IANDC 2000»
13 years 10 months ago
A Uniform Procedure for Converting Matrix Proofs into Sequent-Style Systems
Abstract. We present a uniform algorithm for transforming machine-found matrix proofs in classical, constructive, and modal logics into sequent proofs. It is based on unified repre...
Christoph Kreitz, Stephan Schmitt