Graduate studies at Western
Journal of Symbolic Logic 40 (1):35-40 (1975)
|Abstract||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)|
|Through your library||Configure|
Similar books and articles
George Goguadze, Carla Piazza & Yde Venema (2003). Simulating Polyadic Modal Logics by Monadic Ones. Journal of Symbolic Logic 68 (2):419-462.
Maarten De Rijke (1992). The Modal Logic of Inequality. Journal of Symbolic Logic 57 (2):566 - 584.
Holger Sturm & Frank Wolter (2001). First-Order Expressivity for S5-Models: Modal Vs. Two-Sorted Languages. Journal of Philosophical Logic 30 (6):571-591.
G. Aldo Antonelli & Richmond H. Thomason (2002). Representability in Second-Order Propositional Poly-Modal Logic. Journal of Symbolic Logic 67 (3):1039-1054.
Balder ten Cate (2006). Expressivity of Second Order Propositional Modal Logic. Journal of Philosophical Logic 35 (2):209-223.
Balder ten Cate (2006). Expressivity of Second Order Propositional Modal Logic. Journal of Philosophical Logic 35 (2):209 - 223.
A. V. Chagrov & L. A. Chagrova (1995). Algorithmic Problems Concerning First-Order Definability of Modal Formulas on the Class of All Finite Frames. Studia Logica 55 (3):421 - 448.
Eva Hoogland & Maarten Marx (2002). Interpolation and Definability in Guarded Fragments. Studia Logica 70 (3):373 - 409.
Juha Kontinen & Jakub Szymanik (2011). Characterizing Definability of Second-Order Generalized Quantifiers. In L. Beklemishev & R. de Queiroz (eds.), Proceedings of the 18th Workshop on Logic, Language, Information and Computation, Lecture Notes in Artificial Intelligence 6642. Springer.
Ernst Zimmermann (2003). Elementary Definability and Completeness in General and Positive Modal Logic. Journal of Logic, Language and Information 12 (1):99-117.
Added to index2009-01-28
Total downloads5 ( #170,270 of 739,656 )
Recent downloads (6 months)1 ( #61,680 of 739,656 )
How can I increase my downloads?