Journal of Symbolic Logic 55 (3):1090-1098 (1990)

Sergei Artemov
CUNY Graduate Center
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 \nvdash 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
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2274475
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,039
Through your library

References found in this work BETA

The Predicate Modal Logic of Provability.Franco Montagna - 1984 - Notre Dame Journal of Formal Logic 25 (2):179-189.
The Unprovability of Consistency. An Essay in Modal Logic.C. Smoryński - 1979 - Journal of Symbolic Logic 46 (4):871-873.

Add more references

Citations of this work BETA

Liar-Type Paradoxes and the Incompleteness Phenomena.Makoto Kikuchi & Taishi Kurahashi - 2016 - Journal of Philosophical Logic 45 (4):381-398.
An Arithmetically Complete Predicate Modal Logic.Yunge Hao & George Tourlakis - 2021 - Bulletin of the Section of Logic 50 (4):513-541.
Fixed-Point Properties for Predicate Modal Logics.Sohei Iwata & Taishi Kurahashi - 2020 - Annals of the Japan Association for Philosophy of Science 29:1-25.

Add more citations

Similar books and articles


Added to PP index

Total views
50 ( #226,506 of 2,506,014 )

Recent downloads (6 months)
1 ( #416,828 of 2,506,014 )

How can I increase my downloads?


My notes