ABSTRACT
In this chapter we shall extend the canonical model technique introduced in Chapter 6 to LPC. We shall show how to define, for each modal system S, a canonical model for S + BF, relative to some language ££ of modal LPC, which will have the property that for any wff a of ££, |-s a iff a is valid in that model. We shall then look at the consequences of this for the completeness of systems of modal LPC. In particular we shall look at the relation between the completeness of a propositional system S and the completeness of S 4-BF.1
