This category needs an editor. We encourage you to help if you are qualified.
Volunteer, or read more about what this involves.
Related categories

10 found
Order:
  1. The Logic of Sequence Frames.Fabio Lampert - forthcoming - Review of Symbolic Logic:1-44.
    This paper investigates and develops generalizations of two-dimensional modal logics to any finite dimension. These logics are natural extensions of multidimensional systems known from the literature on logics for a priori knowledge. We prove a completeness theorem for propositional n-dimensional modal logics and show them to be decidable by means of a systematic tableau construction.
    Remove from this list   Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  2. Nested Sequents for Intuitionistic Modal Logics Via Structural Refinement.Tim Lyon - 2021 - In Anupam Das & Sara Negri (eds.), Automated Reasoning with Analytic Tableaux and Related Methods: TABLEAUX 2021. 93413 Cham, Germany: pp. 409-427.
    We employ a recently developed methodology -- called "structural refinement" -- to extract nested sequent systems for a sizable class of intuitionistic modal logics from their respective labelled sequent systems. This method can be seen as a means by which labelled sequent systems can be transformed into nested sequent systems through the introduction of propagation rules and the elimination of structural rules, followed by a notational translation. The nested systems we obtain incorporate propagation rules that are parameterized with formal grammars, (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  3. A Critical Assessment of Pollock’s Work on Logic-Based Argumentation with Suppositions.Mathieu Beirlaen, Jesse Heyninck & Christian Straßer - 2018 - In Proceedings of the Nmr. pp. 63--72.
  4. Thoroughly Relativistic Perspectives.Mark Ressler - 2012 - Notre Dame Journal of Formal Logic 53 (1):89-112.
    This article formulates five relative systems to evaluate the charge of self-refutation with regard to global relativism. It is demonstrated that all five of these systems support models with at least one thoroughly relativistic perspective. However, when these systems are extended to include an operator expressing the valuation of statements in a perspective, only one relative system, based on a nonnormal modal logic, supports a thoroughly relativistic perspective.
    Remove from this list   Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  5. Elementary Canonical Formulae: A Survey on Syntactic, Algorithmic, and Modeltheoretic Aspects.W. Conradie, V. Goranko & D. Vakarelov - 2005 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 17-51.
    In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called \emph{elementary}. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called \emph{canonical}. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main ideas and (...)
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark   3 citations  
  6. Questions and Logical Analysis of Natural Language: The Case of Transparent Intensional Logic.Michal Peliš - 2004 - Logique and Analyse 185:217–226.
  7. Sahlqvist Formulas Unleashed in Polyadic Modal Languages.Valentin Goranko & Dimiter Vakarelov - 2002 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 221-240.
    We propose a generalization of Sahlqvist formulas to polyadic modal languages by representing such languages in a combinatorial PDL style and thus, in particular, developing what we believe to be the right syntactic approach to Sahlqvist formulas at all. The class of polyadic Sahlqvist formulas PSF defined here expands essentially the so far known one. We prove first-order definability and canonicity for the class PSF.
    Remove from this list   Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  8. Modal Logic and Universal Algebra I: Modal Axiomatizations of Structures.Valentin Goranko & Dimiter Vakarelov - 2000 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 265-292.
    We study the general problem of axiomatizing structures in the framework of modal logic and present a uniform method for complete axiomatization of the modal logics determined by a large family of classes of structures of any signature.
    Remove from this list   Direct download  
     
    Export citation  
     
    Bookmark  
  9. Languages of Possibility. [REVIEW]Mark Richard - 1994 - Philosophical Review 103 (1):139.
  10. Languages of Possibility. [REVIEW]Joseph Melia - 1990 - Philosophical Quarterly 40 (159):271.