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
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 30,798
Through your library
References found in this work BETA

No references found.

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.
Expressivity of Second Order Propositional Modal Logic.ten Cate Balder - 2006 - Journal of Philosophical Logic 35 (2):209-223.

View all 8 citations / Add more citations

Similar books and articles
Added to PP index

Total downloads
12 ( #389,602 of 2,202,423 )

Recent downloads (6 months)
1 ( #300,203 of 2,202,423 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature