123 search results - page 10 / 25 » The Deduction Theorem for Strong Propositional Proof Systems |
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
We investigate some syntactic properties of Wadler’s dual calculus, a term calculus which corresponds to classical sequent logic in the same way that Parigot’s λµ calculus co...
IANDC
2010
14 years 8 months ago
2010
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
FROCOS
2009
Springer
15 years 4 months ago
2009
Springer
In an attempt to improve automation capabilities in the Coq proof assistant, we develop a tactic for the propositional fragment based on the DPLL procedure. Although formulas natur...
CADE
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. We present a theorem proving environment for the development of reliable and efficient group communication systems. Our approach makes methods of automated deduction appl...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...