Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T07:04:51.185Z Has data issue: false hasContentIssue false

FIRST-ORDER POSSIBILITY MODELS AND FINITARY COMPLETENESS PROOFS

Published online by Cambridge University Press:  02 September 2019

MATTHEW HARRISON-TRAINOR*
Affiliation:
School of Mathematics and Statistics, Victoria University of Wellington
*
*SCHOOL OF MATHEMATICS AND STATISTICS VICTORIA UNIVERSITY OF WELLINGTON WELLINGTON, NEW ZEALAND E-mail: matthew.harrisontrainor@vuw.ac.nzURL: http://homepages.ecs.vuw.ac.nz/~harrism1/
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This article 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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2019