Sciweavers

1322 search results - page 90 / 265
» Unsound Theorem Proving
Sort
View
CSL
2010
Springer
13 years 8 months ago
Untyping Typed Algebraic Structures and Colouring Proof Nets of Cyclic Linear Logic
Abstract. We prove "untyping" theorems: in some typed theories (semirings, Kleene algebras, residuated lattices, involutive residuated lattices), typed equations can be d...
Damien Pous
CORR
2008
Springer
90views Education» more  CORR 2008»
13 years 7 months ago
Cauchy's Arm Lemma on a Growing Sphere
We propose a variant of Cauchy's Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between ...
Zachary Abel, David Charlton, Sébastien Col...
IPL
2006
92views more  IPL 2006»
13 years 7 months ago
A constructive approach to sequential Nash equilibria
We present a Coq-formalised proof that all non-cooperative, sequential games have a Nash equilibrium point. Our proof methodology follows the style advocated by LCFstyle theorem p...
René Vestergaard
JAPLL
2006
104views more  JAPLL 2006»
13 years 7 months ago
A proof-centric approach to mathematical assistants
We present an approach to mathematical assistants which uses readable, executable proof scripts as the central language for interaction. We examine an implementation that combines...
Lucas Dixon, Jacques D. Fleuriot
DAM
2007
82views more  DAM 2007»
13 years 7 months ago
Every toroidal graph without adjacent triangles is (4, 1)*-choosable
In this paper, a structural theorem about toroidal graphs is given that strengthens a result of Borodin on plane graphs. As a consequence, it is proved that every toroidal graph w...
Baogang Xu, Haihui Zhang