English
Related papers

Related papers: Toward the van Benthem Characterization Theorem fo…

200 papers

In this paper we investigate certain systems of propositional intuitionistic modal logic defined semantically in terms of neighborhood structures. We discuss various restrictions imposed on those frames but our constant approach is to…

Logic · Mathematics 2018-01-19 Tomasz Witczak

We investigate multi-agent epistemic modal logic with common knowledge modalities for groups of agents and obtain van Benthem style model-theoretic characterisations, in terms of bisimulation invariance of classical first-order logic over…

Logic · Mathematics 2021-12-22 Felix Canavoi , Martin Otto

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of Linear Logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have…

Logic in Computer Science · Computer Science 2015-09-07 Daniele Porello , Nicolas Troquard

This paper establishes a comprehensive theory of runtime monitorability for Hennessy-Milner logic with recursion, a very expressive variant of the modal $\mu$-calculus. It investigates the monitorability of that logic with a linear-time…

Logic in Computer Science · Computer Science 2019-02-04 Luca Aceto , Antonis Achilleos , Adrian Francalanza , Anna Ingólfsdóttir , Karoliina Lehtinen

We expand the notion of characteristic formula to infinite finitely presentable subdirectly irreducible algebras. We prove that there is a continuum of varieties of Heyting algebras containing infinite finitely presentable subdirectly…

Logic in Computer Science · Computer Science 2012-08-14 Alex Citkin

In this paper, we give an extension of the J\'{o}nsson-Tarski representation theorem for both normal and non-normal modal algebras so that it preserves countably many infinitary meets and joins. To extend the J\'{o}nsson-Tarski…

Logic · Mathematics 2023-05-24 Yoshihito Tanaka

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…

Logic · Mathematics 2024-10-29 Rafał Gruszczyński , Zhiguang Zhao

Weak Kleene logics are three-valued logics characterized by the presence of an infectious truth-value. In their external versions, as they were originally introduced by Bochvar and Hallden, these systems are equipped with an additional…

Logic · Mathematics 2024-07-24 Stefano Bonzio , Nicolò Zamperlin

Structures based on polarities have been used to provide relational semantics for propositional logics that are modelled algebraically by non-distributive lattices with additional operators. This article develops a first order notion of…

Logic · Mathematics 2023-11-08 Robert Goldblatt

Interpretability logics are endowed with relational semantics \`a la Kripke: Veltman semantics. For certain applications though, this semantics is not fine-grained enough. Back in 1992, in the research group of de Jongh, the notion of…

Logic · Mathematics 2020-07-10 Joost J. Joosten , Jan Mas Rovira , Luka Mikec , Mladen Vuković

In this work we describe preferential Description Logics of typicality, a nonmonotonic extension of standard Description Logics by means of a typicality operator T allowing to extend a knowledge base with inclusions of the form T(C) v D,…

Artificial Intelligence · Computer Science 2020-04-24 Laura Giordano , Valentina Gliozzi , Antonio Lieto , Nicola Olivetti , Gian Luca Pozzato

We give labeled natural deduction systems for a family of tense logics extending the basic linear tense logic Kl. We prove that our systems are sound and complete with respect to the usual Kripke semantics, and that they possess a number of…

Logic in Computer Science · Computer Science 2008-03-25 Luca Viganò , Marco Volpe

In this paper, we propose a new neighborhood semantics for contingency logic, by introducing a simple property in standard neighborhood models. This simplifies the neighborhood semantics given in (Fan and van Ditmarsch, 2015), but does not…

Logic · Mathematics 2018-02-08 Jie Fan

Three extensions and reinterpretations of nonclassical probabilities are reviewed. (i) We propose to generalize the probability axiom of quantum mechanics to self-adjoint positive operators of trace one. Furthermore, we discuss the…

Quantum Physics · Physics 2007-05-23 Karl Svozil

There has been renewed interest in recent years in McKinsey and Tarski's interpretation of modal logic in topological spaces and their proof that S4 is the logic of any separable dense-in-itself metric space. Here we extend this work to the…

Logic · Mathematics 2023-11-08 Robert Goldblatt , Ian Hodkinson

Inquisitive modal logic, InqML, is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that…

Logic in Computer Science · Computer Science 2017-07-28 Ivano Ciardelli , Martin Otto

We study model and frame definability of various modal logics. Let ML(A+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We show that a class of Kripke models…

Logic · Mathematics 2018-12-17 Katsuhiko Sano , Jonni Virtema

The proof theory and semantics of intuitionistic modal logics have been studied by Simpson in terms of Prawitz-style labelled natural deduction systems and Kripke models. An alternative to model-theoretic semantics is provided by…

Logic · Mathematics 2025-07-10 Yll Buzoku , David. J. Pym

We extend to natural deduction the approach of Linear Nested Sequents and of 2-sequents. Formulas are decorated with a spatial coordinate, which allows a formulation of formal systems in the original spirit of natural deduction -- only one…

Logic in Computer Science · Computer Science 2021-04-27 Simone Martini , Andrea Masini , Margherita Zorzi
‹ Prev 1 3 4 5 6 7 10 Next ›