Modal Predicate Logic Research Articles

Identity in modal logic theorem proving

THINKER is an automated natural deduction first-order theorem proving program. This paper reports on how it was adapted so as to prove theorems in modal logic. The method employed is an “indirect semantic method”, obtained by considering the semantic conditions involved in being a valid argument in these modal logics. The method is extended from propositional modal logic to predicate modal logic, and issues concerning the domain of quantification and “existence in a world's domain” are discussed. Finally, we look at the very interesting issues involved with adding identity to the theorem prover in the realm of modal predicate logic. Various alternatives are discussed.

Finite Kripke models and predicate logics of provability

AbstractThe paper proves a predicate version of Solovay's well-known theorem on provability interpretations of modal logic:If a closed modal predicate-logical formula R is not valid in some finite Kripke model, then there exists an arithmetical interpretation f such that PA ⊬ fR.This result implies the arithmetical completeness of arithmetically correct modal predicate logics with the finite model property (including the one-variable fragments of QGL and QS). The proof was obtained by adding “the predicate part” as a specific addition to the standard Solovay construction.

The predicate modal logic of provability.

On montre que des points fixes, quand ils existent sont uniques jusqu'a l'equivalence prouvable

Algebraic Semantics for Modal Predicate Logic

Algebraic Semantics for Modal Predicate Logic

An Introduction to Modal Logic.

This long-awaited book replaces Hughes and Cresswell's two classic studies of modal logic: An Introduction to Modal Logic and A Companion to Modal Logic.A New Introduction to Modal Logic is an entirely new work, completely re-written by the authors. They have incorporated all the new developments that have taken place since 1968 in both modal propositional logic and modal predicate logic, without sacrificing tha clarity of exposition and approachability that were essential features of their earlier works.The book takes readers from the most basic systems of modal propositional logic right up to systems of modal predicate with identity. It covers both technical developments such as completeness and incompleteness, and finite and infinite models, and their philosophical applications, especially in the area of modal predicate logic.

On the Undecidability of Monadic Modal Predicate Logic

On the Undecidability of Monadic Modal Predicate Logic