1322 search results - page 89 / 265 » Unsound Theorem Proving |
LICS
1999
IEEE
14 years 3 hour ago
1999
IEEE
We prove full completeness of multiplicative linear logic (MLL) without MIX under the Chu interpretation. In particular we show that the cut-free proofs of MLL theorems are in a n...
ECOOP
1998
Springer
13 years 12 months ago
1998
Springer
This paper presents an imperative object calculus designed to support class-based programming via a combination of extensible objects and encapsulation. This calculus simplifies th...
CSR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We will show how padding techniques can be applied on onedimensional cellular automata by proving a transfer theorem on complexity classes (how one inclusion of classes i...
AISC
2008
Springer
13 years 9 months ago
2008
Springer
Many inequalities involving the functions ln, exp, sin, cos, etc., can be proved automatically by MetiTarski: a resolution theorem prover (Metis) modified to call a decision proced...
CCCG
2009
13 years 8 months ago
2009
We prove the following generalised empty pentagon theorem: for every integer 2, every sufficiently large set of points in the plane contains collinear points or an empty pentagon...