PP-2001-22: A Unifying Completeness Theorem in Quantified Modal logic

PP-2001-22: Corsi, Giovanna (2001) A Unifying Completeness Theorem in Quantified Modal logic. [Report]

[img] Text (Full Text)
PP-2001-22.text.ps.gz

Download (137kB)
[img] Text (Abstract)
PP-2001-22.abstract.txt

Download (709B)

Abstract

A general strategy for proving completeness theorems for quantified modal logics is provided. Starting from free quantified modal logic K, with or without identity, extensions obtained either by adding the principle of universal instantiation or the converse of the Barcan formula or the Barcan formula are considered and proved complete in a uniform way. Completeness theorems are also shown for systems with the extended Barcan rule as well as for some quantified extensions of the propositional modal logic B. The incompleteness of Q'.B+BF is proved too.

Item Type: Report
Report Nr: PP-2001-22
Series Name: Prepublication (PP) Series
Year: 2001
Uncontrolled Keywords: quantified modal logic, Kripke semantics, completeness
Subjects: Logic
Date Deposited: 12 Oct 2016 14:36
Last Modified: 12 Oct 2016 14:36
URI: https://eprints.illc.uva.nl/id/eprint/63

Actions (login required)

View Item View Item