Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T15:47:23.450Z Has data issue: false hasContentIssue false

Finite Kripke models and predicate logics of provability

Published online by Cambridge University Press:  12 March 2014

Sergei Artemov
Affiliation:
Steklov Mathematical Institute, Academy of Sciences of the USSR, 117966 Moscow, USSR
Giorgie Dzhaparidze
Affiliation:
Institute of Philosophy, Academy of Sciences of the Georgian SSR, 380009 Tbilisi, USSR

Abstract

The 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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1990

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable