265 search results - page 9 / 53 » How to Prove Inductive Theorems |
CSL
2007
Springer
14 years 1 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...
EGCDMAS
2004
13 years 9 months ago
2004
Security policies are abstract descriptions of how a system should behave to be secure. They typically express what is obligatory, permitted, or forbidden in the system. When the s...
TLCA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
AISC
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Origami (paper folding) has a long tradition in Japan's culture and education. We are developing a computational origami system, based on symbolic computation system...
IJCAI
1997
13 years 9 months ago
1997
Theoremsin automated theorem proving are usually proved by logical formal proofs. However,there is a subset of problems which humanscan prove in a different wayby the use of geome...