123 search results - page 8 / 25 » The Deduction Theorem for Strong Propositional Proof Systems |
63
Voted
COCO
2004
Springer
15 years 3 months ago
2004
Springer
An NP search problem is the problems of finding a witness to the given NP predicate, and TFNP is the class of total NP search problems. TFNP contains a number of subclasses conta...
102
click to vote
RTA
2004
Springer
15 years 3 months ago
2004
Springer
Logical systems in natural deduction style are usually presented in the Gentzen style. A different definition of natural deduction, that corresponds more closely to proofs in ord...
IANDC
2006
14 years 9 months ago
2006
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...