2517 search results - page 42 / 504 » Specifying Weak Sets |
109
click to vote
SIAMCO
2008
14 years 11 months ago
2008
The aim of this paper is to adapt the Viability Theorem from differential inclusions (governing the evolution of vectors in a finite dimensional space) to so-called morphological i...
ACS
2010
14 years 12 months ago
2010
There are infinitely many variants of the notion of Kan fibration that, together with suitable choices of cofibrations and the usual notion of weak equivalence of simplicial sets, ...
119
click to vote
JC
2011
14 years 6 months ago
2011
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
126
click to vote
VMCAI
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...
TACS
1994
Springer
15 years 3 months ago
1994
Springer
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...