22 found
Sort by:
  1. Anjolina G. de Oliveira, Ruy de Queiroz, Rajeev Alur, Max Kanovich, John Mitchell, Vladimir Voevodsky, Yoad Winter & Michael Zakharyaschev (2012). Philadelphia, PA, USA May 18–20, 2011. Bulletin of Symbolic Logic 18 (1).
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. Mikhail Sheremet, Frank Wolter & Michael Zakharyaschev (2010). A Modal Logic Framework for Reasoning About Comparative Distances and Topology. Annals of Pure and Applied Logic 161 (4):534-559.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  3. David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev (2006). Non-Primitive Recursive Decidability of Products of Modal Logics with Expanding Domains. Annals of Pure and Applied Logic 142 (1):245-268.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  4. David Gabelaia, Agi Kurucz, Frank Wolter & Michael Zakharyaschev (2005). Products of 'Transitive' Modal Logics. Journal of Symbolic Logic 70 (3):993-1021.
    We solve a major open problem concerning algorithmic properties of products of ‘transitive’ modal logics by showing that products and commutators of such standard logics as K4, S4, S4.1, K4.3, GL, or Grz are undecidable and do not have the finite model property. More generally, we prove that no Kripke complete extension of the commutator [K4,K4] with product frames of arbitrary finite or infinite depth (with respect to both accessibility relations) can be decidable. In particular, if.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  5. Roman Kontchakov, Agi Kurucz & Michael Zakharyaschev (2005). Undecidability of First-Order Intuitionistic and Modal Logics with Two Variables. Bulletin of Symbolic Logic 11 (3):428-438.
    We prove that the two-variable fragment of first-order intuitionistic logic is undecidable, even without constants and equality. We also show that the two-variable fragment of a quantified modal logic L with expanding first-order domains is undecidable whenever there is a Kripke frame for L with a point having infinitely many successors (such are, in particular, the first-order extensions of practically all standard modal logics like K, K4, GL, S4, S5, K4.1, S4.2, GL.3, etc.). For many quantified modal logics, including those (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  6. Frank Wolter & Michael Zakharyaschev (2005). A Logic for Metric and Topology. Journal of Symbolic Logic 70 (3):795 - 828.
    We propose a logic for reasoning about metric spaces with the induced topologies. It combines the 'qualitative' interior and closure operators with 'quantitative' operators 'somewhere in the sphere of radius r.' including or excluding the boundary. We supply the logic with both the intended metric space semantics and a natural relational semantics, and show that the latter (i) provides finite partial representations of (in general) infinite metric models and (ii) reduces the standard '∈-definitions' of closure and interior to simple constraints (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  7. Roman Kontchakov, Carsten Lutz, Frank Wolter & Michael Zakharyaschev (2004). Temporalising Tableaux. Studia Logica 76 (1):91 - 134.
    As a remedy for the bad computational behaviour of first-order temporal logic (FOTL), it has recently been proposed to restrict the application of temporal operators to formulas with at most one free variable thereby obtaining so-called monodic fragments of FOTL. In this paper, we are concerned with constructing tableau algorithms for monodic fragments based on decidable fragments of first-order logic like the two-variable fragment or the guarded fragment. We present a general framework that shows how existing decision procedures for first-order (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  8. Oliver Kutz, Holger Sturm, Nobu-Yuki Suzuki, Frank Wolter & Michael Zakharyaschev (2002). Axiomatizing Distance Logics. Journal of Applied Non-Classical Logics 12 (3-4):425-439.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. Carsten Lutz, Holger Sturm, Frank Wolter & Michael Zakharyaschev (2002). A Tableau Decision Algorithm for Modalized ALC with Constant Domains. Studia Logica 72 (2):199-232.
    The aim of this paper is to construct a tableau decision algorithm for the modal description logic K ALC with constant domains. More precisely, we present a tableau procedure that is capable of deciding, given an ALC-formula with extra modal operators (which are applied only to concepts and TBox axioms, but not to roles), whether is satisfiable in a model with constant domains and arbitrary accessibility relations. Tableau-based algorithms have been shown to be practical even for logics of rather high (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  10. Frank Wolter & Michael Zakharyaschev (2002). Axiomatizing the Monodic Fragment of First-Order Temporal Logic. Annals of Pure and Applied Logic 118 (1-2):133-145.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  11. Frank Wolter & Michael Zakharyaschev (2001). Decidable Fragments of First-Order Modal Logics. Journal of Symbolic Logic 66 (3):1415-1438.
    The paper considers the set ML 1 of first-order polymodal formulas the modal operators in which can be applied to subformulas of at most one free variable. Using a mosaic technique, we prove a general satisfiability criterion for formulas in ML 1 , which reduces the modal satisfiability to the classical one. The criterion is then used to single out a number of new, in a sense optimal, decidable fragments of various modal predicate logics.
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  12. Ian Hodkinson, Frank Wolter & Michael Zakharyaschev (2000). Decidable Fragments of First-Order Temporal Logics. Annals of Pure and Applied Logic 106 (1-3):85-134.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  13. Michael Zakharyaschev (2000). Multi-Dimensional Modal Logic, Maarten Marx and Yde Venema. Journal of Logic, Language and Information 9 (1):128-131.
  14. Yasuhito Suzuki, Frank Wolter & Michael Zakharyaschev (1998). Speaking About Transitive Frames in Propositional Languages. Journal of Logic, Language and Information 7 (3):317-339.
    This paper is a comparative study of the propositional intuitionistic (non-modal) and classical modal languages interpreted in the standard way on transitive frames. It shows that, when talking about these frames rather than conventional quasi-orders, the intuitionistic language displays some unusual features: its expressive power becomes weaker than that of the modal language, the induced consequence relation does not have a deduction theorem and is not protoalgebraic. Nevertheless, the paper develops a manageable model theory for this consequence and its extensions (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  15. Michael Zakharyaschev (1997). Canonical Formulas for K4. Part III: The Finite Model Property. Journal of Symbolic Logic 62 (3):950-975.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  16. Michael Zakharyaschev (1997). Canonical Formulas for Modal and Superintuitionistic Logics: A Short Outline. In M. de Rijke (ed.), Advances in Intensional Logic. Kluwer. 195--248.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  17. Michael Zakharyaschev (1997). Review: G. E. Hughes, M. J. Cresswell, A New Introduction to Modal Logic. [REVIEW] Journal of Symbolic Logic 62 (4):1483-1484.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  18. Michael Zakharyaschev (1997). The Greatest Extension of S4 Into Which Intuitionistic Logic is Embeddable. Studia Logica 59 (3):345-358.
    This paper gives a characterization of those quasi-normal extensions of the modal system S4 into which intuitionistic propositional logic Int is embeddable by the Gödel translation. It is shown that, as in the normal case, the set of quasi-normal modal companions of Int contains the greatest logic, M*, for which, however, the analog of the Blok-Esakia theorem does not hold. M* is proved to be decidable and Halldén-complete; it has the disjunction property but does not have the finite model property.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  19. Michael Zakharyaschev (1996). Canonical Formulas for K4. Part II: Cofinal Subframe Logics. Journal of Symbolic Logic 61 (2):421-449.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  20. Michael Zakharyaschev (1994). A New Solution to a Problem of Hosoi and Ono. Notre Dame Journal of Formal Logic 35 (3):450-457.
    This paper gives a new, purely semantic proof of the following theorem: if an intermediate propositional logic L has the disjunction property then a disjunction free formula is provable in L iff it is provable in intuitionistic logic. The main idea of the proof is to use the well-known semantic criterion of the disjunction property for "simulating" finite binary trees (which characterize the disjunction free fragment of intuitionistic logic) by general frames.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  21. Alexander Chagrov & Michael Zakharyaschev (1993). The Undecidability of the Disjunction Property of Propositional Logics and Other Related Problems. Journal of Symbolic Logic 58 (3):967-1002.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  22. Michael Zakharyaschev (1992). Canonical Formulas for K4. Part I: Basic Results. Journal of Symbolic Logic 57 (4):1377-1402.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation