Partiality and Nondeterminacy in Program Proofs
Joseph M. Morris, Alexander Bunkenburg · Formal Aspects of Computing · 1998
Abstract. Specifications and programs make much use of nondeterministic and/or partial expressions, i.e. expressions which may yield several or no outcomes for some values of their free variables. Traditional 2-valued logics do not comfortably accommodate reasoning about undefined expressions, and do not cater at all for nondeterministic expressions. We seek to rectify this with a 4-valued typed logic E4 which classifies formulae as either “true”, “false”, “neither true nor false”, or “possibly true, possibly false”. The logic is derived in part from the 2-valued logic E and the 3-valued LPF, and preserves most of the theorems of E . Indeed, the main result is that nondeterminacy can be added to a logic covering partiality at little cost.