You are not currently logged in.
Access JSTOR through your library or other institution:
An Elementary Construction for a Non-Elementary Procedure
Maarten Marx and Szabolcs Mikulás
Studia Logica: An International Journal for Symbolic Logic
Vol. 72, No. 2, Many-Dimensional Logical Systems (Nov., 2002), pp. 253-263
Published by: Springer
Stable URL: http://www.jstor.org/stable/20016463
Page Count: 11
You can always find the topics here!Topics: Finite model property, Modal logic, Logic, Decidability, Product labeling, Commutativity, Induction assumption, Rectangles, Satisfiability, Decision making
Were these topics helpful?See somethings inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
We consider the problem of the product finite model property for binary products of modal logics. First we give a new proof for the product finite model property of the logic of products of Kripke frames, a result due to Shehtman. Then we modify the proof to obtain the same result for logics of products of Kripke frames satisfying any combination of seriality, reflexivity and symmetry. We do not consider the transitivity condition in isolation because it leads to infinity axioms when taking products.
Studia Logica: An International Journal for Symbolic Logic © 2002 Springer