The paper studies many-dimensional modal logics corresponding to products of Kripke frames. It proves results on axiomatisability, the finite model property and decidability for product logics, by applying a rather elaborated modal logic technique: p-morphisms, the finite depth method, normal forms, filtrations. Applications to first order predicate logics are considered too. The introduction and the conclusion contain a discussion of many related results and open problems in the area.

ABSTRACT The paper studies propositional logics in a bimodal language, in which the first modality is interpreted as the local truth, and the second as the universal truth. The logic S4UC is introduced, which is finitely axiomatizable, has the f.m.p. and is determined by every connected separable metric space.

This paper concerns modal logics appearing from the temporal ordering of domains in two-dimensional Minkowski spacetime. As R. Goldblatt has proved recently, the logic of the whole plane isS4.2. We consider closed or open convex polygons and closed or open domains bounded by simple differentiable curves; this leads to the logics:S4,S4.1,S4.2 orS4.1.2.

Recent studies in semantics of modal and superintuitionistic predicate logics provided many examples of incompleteness, especially for Kripke semantics. So there is a problem: to find an appropriate possible- world semantics which is equivalent to Kripke semantics at the propositional level and which is strong enough to prove general completeness results. The present paper introduces a new semantics of Kripke metaframes' generalizing some earlier notions. The main innovation is in considering "n"-tuples of individuals as abstract "n"-dimensional vectors', together with some (...) transformations of these vectors. Soundness of the semantics is proved to be equivalent to some non- logical properties of metaframes; and thus we describe the maximal semantics of Kripke- type. (shrink)

We consider modal logics whose intermediate fragments lie between the logic of infinite problems [20] and the Medvedev logic of finite problems [15]. There is continuum of such logics [19]. We prove that none of them is finitely axiomatizable. The proof is based on methods from [12] and makes use of some graph-theoretic constructions (operations on coverings, and colourings).

In the first part of this paper we introduced products of modal logics and proved basic results on their axiomatisability and the f.m.p. In this continuation paper we prove a stronger result - the product f.m.p. holds for products of modal logics in which some of the modalities are reflexive or serial. This theorem is applied in classical first-order logic, we identify a new Square Fragment of the classical logic, where the basic predicates are binary and all quantifiers are relativised, (...) and for which we show the f.m.p. in the classical sense. Also we prove that SF not included in Guarded Fragment and that it can be embedded into the equational theory of relational algebras. (shrink)

In this paper we improve the results of [2] by proving the product f.m.p. for the product of minimal n-modal and minimal n-temporal logic. For this case we modify the finite depth method introduced in [1]. The main result is applied to identify new fragments of classical first-order logic and of the equational theory of relation algebras, that are decidable and have the finite model property.

Intermediate prepositional logics we consider here describe the setI() of regular informational types introduced by Yu. T. Medvedev [7]. He showed thatI() is a Heyting algebra. This algebra gives rise to the logic of infinite problems from [13] denoted here asLM 1. Some other definitions of negation inI() lead to logicsLM n (n ). We study inclusions between these and other systems, proveLM n to be non-finitely axiomatizable (n ) and recursively axiomatizable (n ). We also show that formulas in (...) one variable do not separateLM from Heyting's logicH, andLM n (n ) from Scott's logic (H+S). (shrink)

Proc. of the 8th International Conference on Advances in Modal Logic, (AiML'2010).