1410 search results - page 100 / 282 » Proving theorems by reuse |
NN
2006
Springer
13 years 10 months ago
2006
Springer
- Since the discovery of the SOMs by T. Kohonen, many results have been found in order to get a better description of their behaviour. Most of them are very convincing but from a m...
JNS
2010
13 years 8 months ago
2010
This paper is concerned with the Becker-D¨oring (BD) system of equations and their relationship to the Lifschitz-Slyozov-Wagner (LSW) equations. A diffusive version of the LSW eq...
SLOGICA
2010
13 years 8 months ago
2010
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
CADE
2008
Springer
14 years 10 months ago
2008
Springer
Abstract. We implement an algorithm for extracting appropriate collections of classic-like sound and complete tableaux rules for a large class of finite-valued logics. Its output c...
CALCO
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Parameterised monads have the same relationship to adjunctions with parameters as monads do to adjunctions. In this paper, we investigate algebras for parameterised monad...