Part of the Texts and Monographs in Computer Science book series (MCS)
Semantics of Quasi-Boolean Expressions
In deriving programs, it is often useful to consider certain expressions as well-defined although they contain subexpressions to which no value can reasonably be attributed. For instance, one wishes to consider the expression
as false when i = n, without worrying whether or not n is in the subscript range of array a. Expressions like these are called quasi-boolean in . Traditionally, they are treated by introducing the conditional connectives cand and cor [2, chapter 4] [4, §4.1].
$$ 0 \leqslant i < n and a\left[ i \right] = 0 $$
KeywordsEquivalence Relation Propositional Calculus Logical Atom Finite Expression Ordinary Logic
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
© Springer-Verlag New York, Inc. 1990