Sciweavers

28 search results - page 2 / 6
» Proof search and Co-NP completeness for many-valued logics
Sort
View
AISC
2004
Springer
13 years 10 months ago
Proof Search in Minimal Logic
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
Helmut Schwichtenberg
JELIA
1998
Springer
13 years 8 months ago
A Matrix Characterization for MELL
We present a matrix characterization of logical validity in the multiplicative fragment of linear logic with exponentials. In the process we elaborate a methodology for proving mat...
Heiko Mantel, Christoph Kreitz
CORR
2010
Springer
165views Education» more  CORR 2010»
13 years 4 months ago
Cut-Elimination and Proof Search for Bi-Intuitionistic Tense Logic
We consider an extension of bi-intuitionistic logic with the traditional modalities , , and from tense logic Kt. Proof theoretically, this extension is obtained simply by extendin...
Rajeev Goré, Linda Postniece, Alwen Tiu
TPHOL
2009
IEEE
13 years 11 months ago
Extended First-Order Logic
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...
Chad E. Brown, Gert Smolka
TABLEAUX
1997
Springer
13 years 8 months ago
Free Variable Tableaux for Propositional Modal Logics
Free-variable semantic tableaux are a well-established technique for first-order theorem proving where free variables act as a meta-linguistic device for tracking the eigenvariabl...
Bernhard Beckert, Rajeev Goré