English
Related papers

Related papers: Collapsing Constructive and Intuitionistic Modal L…

200 papers

The method K\"urbis used to formalise definite descriptions with a binary quantifier I, such that I$x[F,G]$ indicates `the F is G', is examined and improved upon in this work. K\"urbis first looked at I in intuitionistic logic and its…

Logic in Computer Science · Computer Science 2025-01-03 Yaroslav Petrukhin

There has been a significant interest in extending various modal logics with intersection, the most prominent examples being epistemic and doxastic logics with distributed knowledge. Completeness proofs for such logics tend to be…

Logic in Computer Science · Computer Science 2020-04-07 Yì N. Wáng , Thomas Ågotnes

In this paper, we propose two-sorted modal logics for the representation and reasoning of concepts arising from rough set theory (RST) and formal concept analysis (FCA). These logics are interpreted in two-sorted bidirectional frames, which…

Logic · Mathematics 2023-09-11 Prosenjit Howlader , Churn-Jung Liau

Intuitionistic epistemic logic introduces an epistemic operator, which reflects the intended BHK semantics of intuitionism, to intuitionistic logic. The fundamental assumption concerning intuitionistic knowledge and belief is that it is the…

Logic · Mathematics 2016-01-14 Tudor Protopopescu

We present a justification logic corresponding to the modal logic of transitive closure $\mathsf{K}^+$ and establish a normal realization theorem relating these two systems. The result is obtained by means of a sequent calculus allowing…

Logic · Mathematics 2024-11-25 Daniyar Shamkanov

Modal logics allow reasoning about various modes of truth: for example, what it means for something to be possibly true, or to know that something is true as opposed to merely believing it. This report describes embeddings of propositional…

Logic in Computer Science · Computer Science 2022-05-16 John Rushby

We present a new uniform method for studying modal companions of superintuitionistic rule systems and related notions, based on the machinery of stable canonical rules. Using this method, we obtain alternative proofs of the Blok-Esakia…

Logic · Mathematics 2025-08-27 Nick Bezhanishvili , Antonio Maria Cleani

Satisfiability checking for monotone modal logic is known to be (only) NP-complete. We show that this remains true when the logic is extended with aconjunctive and alternation-free fixpoint operators as well as the universal modality; the…

Logic in Computer Science · Computer Science 2020-05-05 Daniel Hausmann , Lutz Schröder

Under the Curry--Howard isomorphism, the syntactic structure of programs can be modeled using birelational Kripke structures equipped with intuitionistic and modal relations. Intuitionistic relations capture scoping through persistence,…

Logic in Computer Science · Computer Science 2026-02-11 Yuito Murase , Akinori Maniwa

Recent years witness a growing interest in nonstandard epistemic logics of "knowing whether", "knowing what", "knowing how", and so on. These logics are usually not normal, i.e., the standard axioms and reasoning rules for modal logic may…

Artificial Intelligence · Computer Science 2016-11-22 Tao Gu , Yanjing Wang

We consider bisimulation-invariant monadic second-order logic over various classes of finite transition systems. We present several combinatorial characterisations of when the expressive power of this fragment coincides with that of the…

Logic in Computer Science · Computer Science 2019-05-17 Achim Blumensath , Felix Wolf

We compare different epistemic notions in the presence of awareness of propositional variables: the logics of implicit knowledge (in which explicit knowledge is definable), explicit knowledge, and speculative knowledge. Different notions of…

Logic in Computer Science · Computer Science 2013-10-29 Hans van Ditmarsch , Tim French , Fernando R. Velazquez-Quesada , Yi N. Wang

We derive an intuitionistic version of G\"odel-L\"ob modal logic ($\sf{GL}$) in the style of Simpson, via proof theoretic techniques. We recover a labelled system, $\sf{\ell IGL}$, by restricting a non-wellfounded labelled system for…

Logic in Computer Science · Computer Science 2023-09-04 Anupam Das , Iris van der Giessen , Sonia Marin

This work is a mathematician's attempt to understand intuitionistic logic. It can be read in two ways: as a research paper interspersed with lengthy digressions into rethinking of standard material; or as an elementary (but highly…

Logic · Mathematics 2017-05-02 Sergey A. Melikhov

Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic…

Logic · Mathematics 2015-04-13 Grigory K. Olkhovikov

We find a translation with particularly nice properties from intuitionistic propositional logic in countably many variables to intuitionistic propositional logic in two variables. In addition, the existence of a possibly-not-as-nice…

Logic · Mathematics 2007-05-23 Michael O'Connor

We present three examples of \textit{multi-topological} semantics for intuitionistic modal logic with one modal operator $\Box$ (which behaves in some sense like necessity). We show that it is possible to treat neighborhood models,…

Logic · Mathematics 2019-03-19 Tomasz Witczak

Modal dependence logics are modal logics defined on the basis of team semantics and have the downward closure property. In this paper, we introduce sound and complete deduction systems for the major modal dependence logics, especially those…

Logic · Mathematics 2018-12-19 Fan Yang

Debates concerning philosophical grounds for the validity of classical and intuitionistic logics often have the very nature of logical proofs as one of the main points of controversy. The intuitionist advocates for a strict notion of…

Logic in Computer Science · Computer Science 2025-04-07 Victor Nascimento , Luiz Carlos Pereira , Elaine Pimentel

To provide a categorical semantics for co-intuitionistic logic one has to face the fact, noted by Tristan Crolard, that the definition of co-exponents as adjuncts of coproducts does not work in the category Set, where coproducts are…

Logic in Computer Science · Computer Science 2015-07-01 Gianluigi Bellin
‹ Prev 1 4 5 6 7 8 10 Next ›