195 search results - page 6 / 39 » Matrix-based Constructive Theorem Proving |
IPL
2006
13 years 6 months ago
2006
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...
AML
2011
13 years 1 months ago
2011
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2ω is a Gδσ-set then either...
JUCS
2010
13 years 1 months ago
2010
: Veldman proved that the contrapositive of countable binary choice is a theorem of full-fledged intuitionism, to which end he used a principle of continuous choice and the fan the...
CDC
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract— In the framework of the ISS Lyapunov formulation a small gain theorem has recently been proved which allows the explicit construction of Lyapunov functions for intercon...
MOC
2002
13 years 6 months ago
2002
This paper provides a novel approach to the construction of good lattice rules for the integration of Korobov classes of periodic functions over the unit s-dimensional cube. Theore...