28 research outputs found

    The Modal mu-Calculus and The Gödel-Löb Logic

    Get PDF
    We show that the modal µ-calculus over GL collapses to the modal fragment by showing that the fixpoint formula is reached after two iterations and answer to a question posed by van Benthem in [vBe06]. Further, we introduce the modal µ∼-calculus by allowing fixpoint constructors for any formula where the fixpoint variable appears guarded but not necessarily positive and show that this calculus over GL collapses to the modal fragment, too. The latter result allows us a new proof of the de Jongh, Sambin Theorem and provides a simple algorithm to construct the fixpoint formula

    The Modal μ-Calculus Hierarchy on Restricted Classes of Transition Systems

    Get PDF
    We discuss the strictness of the modal µ-calculus hierarchy over some restricted classes of transition systems. First, we show that the hierarchy is strict over reflexive frames. By proving the finite model theorem for reflexive systems the same results holds for finite models. Second, we prove that over transitive systems the hierarchy collapses to the alternation-free fragment. In order to do this the finite model theorem for transitive transition systems is also proved. Further, we verify that if symmetry is added to transitivity the hierarchy collapses to the purely modal fragment

    Fixed-point elimination in the intuitionistic propositional calculus

    Full text link
    It is a consequence of existing literature that least and greatest fixed-points of monotone polynomials on Heyting algebras-that is, the algebraic models of the Intuitionistic Propositional Calculus-always exist, even when these algebras are not complete as lattices. The reason is that these extremal fixed-points are definable by formulas of the IPC. Consequently, the μ\mu-calculus based on intuitionistic logic is trivial, every μ\mu-formula being equivalent to a fixed-point free formula. We give in this paper an axiomatization of least and greatest fixed-points of formulas, and an algorithm to compute a fixed-point free formula equivalent to a given μ\mu-formula. The axiomatization of the greatest fixed-point is simple. The axiomatization of the least fixed-point is more complex, in particular every monotone formula converges to its least fixed-point by Kleene's iteration in a finite number of steps, but there is no uniform upper bound on the number of iterations. We extract, out of the algorithm, upper bounds for such n, depending on the size of the formula. For some formulas, we show that these upper bounds are polynomial and optimal

    Explicit Evidence Systems with Common Knowledge

    Full text link
    Justification logics are epistemic logics that explicitly include justifications for the agents' knowledge. We develop a multi-agent justification logic with evidence terms for individual agents as well as for common knowledge. We define a Kripke-style semantics that is similar to Fitting's semantics for the Logic of Proofs LP. We show the soundness, completeness, and finite model property of our multi-agent justification logic with respect to this Kripke-style semantics. We demonstrate that our logic is a conservative extension of Yavorskaya's minimal bimodal explicit evidence logic, which is a two-agent version of LP. We discuss the relationship of our logic to the multi-agent modal logic S4 with common knowledge. Finally, we give a brief analysis of the coordinated attack problem in the newly developed language of our logic

    Elliptical optical solitary waves in a finite nematic liquid crystal cell

    Get PDF
    2015 Elsevier B.V. The addition of orbital angular momentum has been previously shown to stabilise beams of elliptic cross-section. In this article the evolution of such elliptical beams is explored through the use of an approximate methodology based on modulation theory. An approximate method is used as the equations that govern the optical system have no known exact solitary wave solution. This study brings to light two distinct phases in the evolution of a beam carrying orbital angular momentum. The two phases are determined by the shedding of radiation in the form of mass loss and angular momentum loss. The first phase is dominated by the shedding of angular momentum loss through spiral waves. The second phase is dominated by diffractive radiation loss which drives the elliptical solitary wave to a steady state. In addition to modulation theory, the chirp variational method is also used to study this evolution. Due to the significant role radiation loss plays in the evolution of an elliptical solitary wave, an attempt is made to couple radiation loss to the chirp variational method. This attempt furthers understanding as to why radiation loss cannot be coupled to the chirp method. The basic reason for this is that there is no consistent manner to match the chirp trial function to the generated radiating waves which is uniformly valid in time. Finally, full numerical solutions of the governing equations are compared with solutions obtained using the various variational approximations, with the best agreement achieved with modulation theory due to its ability to include both mass and angular momentum losses to shed diffractive radiation

    Light confinement via periodic modulation of the refractive index

    Get PDF
    We investigate, both theoretically and numerically, light confine- ment in dielectric structures with a transverse refractive index distribution pe- riodically modulated in the longitudinal coordinate. We demonstrate that light can be guided even in the balanced limit when the average refractive index con- trast vanishes in the direction of propagation, a dynamic trapping phenomenon analogous to the Kapitza effect in quantum mechanics. Finally, with reference to segmented waveguides with an unbalanced index modulation, we address the interplay of dynamic and static confinements

    Justifying induction on modal  -formulae

    No full text
    corecore