English
Related papers

Related papers: Propositional modal logic with implicit modal quan…

200 papers

Recent ideas about epistemic modals and indicative conditionals in formal semantics have significant overlap with ideas in modal logic and dynamic epistemic logic. The purpose of this paper is to show how greater interaction between formal…

Logic in Computer Science · Computer Science 2017-08-07 Wesley H. Holliday , Thomas F. Icard

Non-iterative normal modal logics are defined by axioms of modal degree 1. In this paper we use calculations with normal forms to determine the set of all possible non-iterative normal modal logics, unimodal propositional extensions of K.…

Logic · Mathematics 2021-03-26 Adrian Soncodi

We consider the extension of two variable logic with quantifiers that state that the number of elements where a formula holds should belong to a given ultimately periodic set. We show that both satisfiability and finite satisfiability of…

Logic in Computer Science · Computer Science 2024-04-05 Michael Benedikt , Egor V. Kostylev , Tony Tan

In order to enrich dynamic semantic theories with a `pragmatic' capacity, we combine dynamic and nonmonotonic (preferential) logics in a modal logic setting. We extend a fragment of Van Benthem and De Rijke's dynamic modal logic with…

cmp-lg · Computer Science 2008-02-03 Jan Jaspars , Megumi Kameyama

We deal with the fragment of modal logic consisting of implications of formulas built up from the variables and the constant `true' by conjunction and diamonds only. The weaker language allows one to interpret the diamonds as the uniform…

Logic · Mathematics 2013-07-16 Lev Beklemishev

The usual reading of logical implication "A implies B" as "if A then B" fails in intuitionistic logic: there are formulas A and B such that "A implies B" is not provable, even though B is provable whenever A is provable. Intuitionistic…

Logic in Computer Science · Computer Science 2018-10-18 Andrea Condoluci , Matteo Manighetti

We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…

Logic in Computer Science · Computer Science 2014-01-17 Vincent Aravantinos , Ricardo Caferra , Nicolas Peltier

Logical bilateralism challenges traditional concepts of logic by treating assertion and denial as independent yet opposed acts. While initially devised to justify classical logic, its constructive variants show that both acts admit…

Logic in Computer Science · Computer Science 2026-05-05 Victor Barroso-Nascimento , Maria Osório , Elaine Pimentel

We propose stratified institutions (a decade old generalised version of the theory of institutions of Goguen and Burstall) as a fully abstract model theoretic approach to modal logic. This allows for a uniform treatment of model theoretic…

Logic · Mathematics 2016-02-18 Răzvan Diaconescu

This article develops a novel framework for modal logic based on the idea of stratified actualization, rather than the classical model of global possible worlds. Traditional Kripke semantics treat modal operators as quantification over…

Logic in Computer Science · Computer Science 2025-06-24 Alexandre Le Nepvou

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

Logic · Mathematics 2020-02-11 Robert Goldblatt

A probabilistic propositional logic, endowed with an epistemic component for asserting (non-)compatibility of diagonizable and bounded observables, is presented and illustrated for reasoning about the random results of projective…

Logic · Mathematics 2018-03-20 A. Sernadas , J. Rasga , C. Sernadas , L. Alcácer , A. B. Henriques

We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of a given logic and relational structures used to define the…

Logic in Computer Science · Computer Science 2011-03-02 Zoran Majkic

In response to a concern raised by Horty, this paper develops a two-tiered, preference-based semantic framework for modeling defeasible conditional obligations. The paper extends a Hansson-Lewis style preference semantics for dyadic deontic…

Logic in Computer Science · Computer Science 2026-05-01 Xavier Parent

We give a sufficient condition for Kripke completeness of modal logics enriched with the transitive closure modality. More precisely, we show that if a logic admits what we call definable filtration (ADF), then such an expansion of the…

Logic · Mathematics 2020-11-05 Stanislav Kikot , Ilya Shapirovsky , Evgeny Zolin

In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish…

Logic · Mathematics 2009-05-05 Karim Nour , Abir Nour

Propositional and modal inclusion logic are formalisms that belong to the family of logics based on team semantics. This article investigates the model checking and validity problems of these logics. We identify complexity bounds for both…

Logic in Computer Science · Computer Science 2017-04-25 Lauri Hella , Antti Kuusisto , Arne Meier , Jonni Virtema

We prove completeness, interpolation, decidability and an omitting types theorem for certain multi dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach…

Logic · Mathematics 2013-02-14 Tarek Sayed Ahmed , Mohammad Assem

Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we study a particular family of these logics, extending the…

Logic in Computer Science · Computer Science 2025-12-01 Daniil Kozhemiachenko , Igor Sedlár

In the present paper we consider modal propositional logic and look for the constraints that are imposed to the propositions of the special type $\Box a$ by the structure of the relevant finite Kripke frame. We translate the usual language…

Logic · Mathematics 2019-01-29 Riccardo Camerlo , Giovanni Pistone , Fabio Rapallo
‹ Prev 1 4 5 6 7 8 10 Next ›