49 search results - page 7 / 10 » A Calculus for Schemas in Z |
LOGCOM
2010
13 years 2 months ago
2010
Gentzen systems are introduced for Spinks and Veroff's substructural logic corresponding to constructive logic with strong negation, and some logics in its vicinity. It has b...
ENTCS
2008
13 years 7 months ago
2008
Circus is a refinement language, in which specifications define both data and behavioural aspects of concurrent systems using a combination of Z and CSP. Its refinement theory and...
ADBIS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
FMSB
2008
13 years 9 months ago
2008
Abstract. This paper reports on the multi-scale modelling of an intestinal crypt cellular structure coupled with Wnt signalling. Using formal modelling techniques based on the stoc...
FSS
2006
13 years 7 months ago
2006
An implication operator A is said to be tied if there is a binary operation T that ties A; that is, the identity A(a, A(b, z)) = A(T (a, b), z) holds for all a, b, z. We aim at th...