Skip to main content
Open Access Publications from the University of California

First-order possibility models and finitary completeness proofs

  • Author(s): Harrison-Trainor, Matthew
  • et al.

This paper builds on Humberstone's idea of defining models of propositional modal logic where total possible worlds are replaced by partial possibilities. We follow a suggestion of Humberstone by introducing possibility models for quantified modal logic. We show that a simple quantified modal logic is sound and complete for our semantics. Although Holliday showed that for many propositional modal logics, it is possible to give a completeness proof using a canonical model construction where every possibility consists of finitely many formulas, we show that this is impossible to do in the first-order case. However, one can still construct a canonical model where every possibility consists of a computable set of formulas and thus still of finitely much information.

Main Content
For improved accessibility of PDF content, download the file to your device.
Current View