First-order definability in modal logic

Journal of Symbolic Logic 40 (1):35-40 (1975)

It is shown that a formula of modal propositional logic has precisely the same models as a sentence of the first-order language of a single dyadic predicate iff its class of models is closed under ultraproducts. as a corollary, any modal formula definable by a set of first-order conditions is always definable by a single such condition. these results are then used to show that the formula (lmp 'validates' mlp) is not first-order definable
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2272267
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

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

References found in this work BETA

Non-Standard Analysis.Abraham Robinson, J. W. Addison, Leon Henkin & Alfred Tarski - 1969 - Journal of Symbolic Logic 34 (2):292-294.
An Ascending Chain of S4 Logics.Kit Fine - 1974 - Theoria 40 (2):110-116.
Decidability of S4.Krister Segerberg - 1968 - Theoria 34 (1):7-20.
Decidability of S4.1.Krister Segerberg - 1968 - Theoria 34 (1):7.

Add more references

Citations of this work BETA

Varieties of Complex Algebras.Robert Goldblatt - 1989 - Annals of Pure and Applied Logic 44 (3):173-242.
Mathematical Modal Logic: A View of its Evolution.Robert Goldblatt - 2003 - Journal of Applied Logic 1 (5-6):309-392.
Expressivity of Second Order Propositional Modal Logic.Balder Ten Cate - 2006 - Journal of Philosophical Logic 35 (2):209-223.

View all 13 citations / Add more citations

Similar books and articles


Added to PP index

Total views
20 ( #450,881 of 2,279,914 )

Recent downloads (6 months)
1 ( #828,945 of 2,279,914 )

How can I increase my downloads?


My notes

Sign in to use this feature