Avoiding the undefined by underspecification

1. Bijlsma, A. Semantics of quasi-boolean expressions. In Feijen, W.H.J., et al (eds.) Beauty is Our Business, Springer-Verlag, New York, 1990, 27–35.

   Google Scholar 

2. Cheng, J.H., and C.B. Jones. On the usability of logics which handle partial functions. In: C. Morgan and J.C.P. Woodcock (eds.). Third Refinement Workshop, pp. 51–69. Workshops in Computing Series, Heidelberg, 1991.

   Google Scholar 

3. Constable, R.L., and M.J. O'Donnell. A Programming Logic. Winthrop, Cambridge, Massachusetts, 1978.

   Google Scholar 

4. Dijkstra, E.W., and C.S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag, New York 1990.

   Google Scholar 

5. Gries, D., and F.B. Schneider. A Logical Approach to Discrete Math. Springer-Verlag, New York, 1993.

   Google Scholar 

6. Gries, D., and F.B. Schneider. Equational propositional logic. IPL 53 (1995), 145–152.

   Article  Google Scholar 

7. Jones, C.B. Partial functions and logics: a warning. IPL 54 (1995), 65–68.

   Article  Google Scholar 

8. Jones, C.B., and C.A. Middelburg. A typed logic of partial functions reconstructed classically. Acta Informatica 31 (1994), 399–430.

   Article  Google Scholar 

9. Scott, D.S. Existence and description in formal logic. In R. Schoenman (ed.) Bertrand Russell, Philosopher of the Century. St. Leonards: Allen and Unwin, 1967, 181–200.

   Google Scholar 

Download references