Semantics of Quasi-Boolean Expressions

  • A. Bijlsma
Part of the Texts and Monographs in Computer Science book series (MCS)


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
$$ 0 \leqslant i < n and a\left[ i \right] = 0 $$
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 [3]. Traditionally, they are treated by introducing the conditional connectives cand and cor [2, chapter 4] [4, §4.1].


Equivalence 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.

Unable to display preview. Download preview PDF.


  1. [1]
    R. L. Barber. The Spine of Software. John Wiley & Sons, Chichester, 1987.Google Scholar
  2. [2]
    E. W. Dijkstra. A Discipline of Programming. Prentice-Hall, Englewood Cliffs, 1976.MATHGoogle Scholar
  3. [3]
    E. W. Dijkstra and W. H. J. Feijen. The linear search revisited. Struct. Prog., 10: 5–9, 1989.Google Scholar
  4. [4]
    D. Gries. The Science of Programming. Springer-Verlag, New-York, 1981.MATHGoogle Scholar
  5. [5]
    E. C. R. Hehner, L. E. Gupta, and A. J. Malton. Predicative methodology. Acta Informatica, 23: 487–505, 1986.MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag New York, Inc. 1990

Authors and Affiliations

  • A. Bijlsma
    • 1
  1. 1.Department of Mathematics and Computing ScienceEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations