1322 search results - page 200 / 265 » Unsound Theorem Proving |
COMPUTING
2007
13 years 8 months ago
2007
The Krawczyk and the Hansen-Sengupta interval operators are closely related to the interval Newton operator. These interval operators can be used as existence tests to prove exist...
JANCL
2008
13 years 8 months ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
JCT
2008
13 years 8 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
JCT
2006
13 years 8 months ago
2006
Consider two locally finite rooted trees as equivalent if each of them is a topological minor of the other, with an embedding preserving the tree-order. Answering a question of va...
ENTCS
2007
13 years 8 months ago
2007
We use the interactive theorem prover Isabelle to prove that the algebraic axiomatization of bisimulation equivalence in the pi-calculus is sound and complete. This is the first ...