Modal logic with the difference modality of topological T0-spaces
We prove completeness for some normal modal predicate logics in the standard Kripke semantics with expanding domains. We consider quantified versions of propositional logics with the axiom of density plus some others (transitivity, confluence). The method of proof modifies the technique developed for other cases (without density) by S. Ghilardi, G. Corsi and D. Skvorstov; but now we arrange the whole construction in a game-theoretic style.
We investigate the relationship between recursive enumerability and elementary frame deﬁnability in ﬁrst-order predicate modal logic. On the one hand, it is wellknown that every ﬁrst-order predicate modal logic complete with respect to an elementary class of Kripke frames, i.e., a class of frames deﬁnable by a classical ﬁrst-order formula, is recursively enumerable. On the other, numerous examples are known of predicate modal logics, based on “natural” propositional modal logics with essentially second-order Kripke semantics, that are either not recursively enumerable or Kripke incomplete. This raises the question of whether every Kripke complete, recursively enumerable predicate modal logic can be characterized by an elementary class of Kripke frames. We answer this question in the negative, by constructing a normal predicate modal logic which is Kripke complete, recursively enumerable, but not complete with respect to an elementary class of frames. We also present an example of a normal predicate modal logic that is recursively enumerable, Kripke complete, and not complete with respect to an elementary class of rooted frames, but is complete with respect to an elementary class of frames that are not rooted.
The celebrated theorem proved by Goldblatt and Thomason in 1974 gives necessary and sufficient conditions for an elementary class of Kripke frames to be modally definable. Here we obtain a local analogue of this result, which deals with modal definability of classes of pointed frames. Furthermore, we generalize it to the case of n-frames, which are frames with n distinguished worlds. For talking about n-frames, we generalize modal formulas to modal expressions. While a modal formula is evaluated at a single world of a model, a modal expression with n individual variables is evaluated at an n-tuple of worlds, just as a first-order formula with n free variables. We introduce operations on n-frames that preserve validity of modal expressions, and show that closure under these operations is a necessary and sufficient condition for an elementary class of n-frames to be modally definable. We also discuss the relationship between modal expressions and hybrid logic and leave open questions.
In this paper we study the propositional fragment of the joint logic of problems and propositions HC introduced by Melikhov. We provide Kripke semantics for this logic and show that HC is complete with respect to those models and has the finite model property. We consider examples of the HC-models usage. In particular, we prove that HC is a conservative extension of the logic H4. We also show that the logic HC is complete with respect to Kripke frames with sets of worlds introduced by Artemov and Protopopescu.
Bibliography: 31 titles.
This volume is dedicated to Leo Esakia’s contributions to the theory of modal and intuitionistic systems. Leo Esakia was one of the pioneers in developing duality theory for modal and intuitionistic logics, and masterfully utilizing it to obtain some major results in the area. The volume consists of 10 chapters, written by leading experts, that discuss Leo’s original contributions and consequent developments that have shaped the current state of the field.
Filtration is a standard tool for establishing the finite model property of modal logics. We consider logics and classes of frames that admit filtration, and identify some operations on them that preserve this property. In particular, the operation of adding the inverse or the transitive closure of a relation is shown to be safe in this sense. These results are then used to prove that every regular grammar logic with converse admits filtration. We present filtration constructions for right-linear and left-linear grammar logics. We also give a simple example of a grammar modal logic that is undecidable and hence does not admit filtration.
This is a chapter in a book dedicated to Leo Esakia’s contributions to the theory of modal and intuitionistic systems. In this chapter we study modal logics of topological spaces in the combined language with the derivational modality and the difference modality. We give axiomatizations and prove completeness for the following classes: all spaces, T1 -spaces, dense-in-themselves spaces, a zero-dimensional dense-in-itself separable metric space, R^n (n ≥ 2). We also discuss the correlation between languages with different combinations of the topological, the derivational, the universal and the difference modality in terms of definability.
A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.
Let k be a field of characteristic zero, let G be a connected reductive algebraic group over k and let g be its Lie algebra. Let k(G), respectively, k(g), be the field of k- rational functions on G, respectively, g. The conjugation action of G on itself induces the adjoint action of G on g. We investigate the question whether or not the field extensions k(G)/k(G)^G and k(g)/k(g)^G are purely transcendental. We show that the answer is the same for k(G)/k(G)^G and k(g)/k(g)^G, and reduce the problem to the case where G is simple. For simple groups we show that the answer is positive if G is split of type A_n or C_n, and negative for groups of other types, except possibly G_2. A key ingredient in the proof of the negative result is a recent formula for the unramified Brauer group of a homogeneous space with connected stabilizers. As a byproduct of our investigation we give an affirmative answer to a question of Grothendieck about the existence of a rational section of the categorical quotient morphism for the conjugating action of G on itself.
Let G be a connected semisimple algebraic group over an algebraically closed field k. In 1965 Steinberg proved that if G is simply connected, then in G there exists a closed irreducible cross-section of the set of closures of regular conjugacy classes. We prove that in arbitrary G such a cross-section exists if and only if the universal covering isogeny Ĝ → G is bijective; this answers Grothendieck's question cited in the epigraph. In particular, for char k = 0, the converse to Steinberg's theorem holds. The existence of a cross-section in G implies, at least for char k = 0, that the algebra k[G]G of class functions on G is generated by rk G elements. We describe, for arbitrary G, a minimal generating set of k[G]G and that of the representation ring of G and answer two Grothendieck's questions on constructing generating sets of k[G]G. We prove the existence of a rational (i.e., local) section of the quotient morphism for arbitrary G and the existence of a rational cross-section in G (for char k = 0, this has been proved earlier); this answers the other question cited in the epigraph. We also prove that the existence of a rational section is equivalent to the existence of a rational W-equivariant map T- - - >G/T where T is a maximal torus of G and W the Weyl group.