English
Related papers

Related papers: A Natural Intuitionistic Modal Logic: Axiomatizati…

200 papers

Our concern is the completeness problem for spi-logics, that is, sets of implications between strictly positive formulas built from propositional variables, conjunction and modal diamond operators. Originated in logic, algebra and computer…

Logic in Computer Science · Computer Science 2026-01-21 Stanislav Kikot , Agi Kurucz , Yoshihito Tanaka , Frank Wolter , Michael Zakharyaschev

We develop polytopological semantics for various constructive, intuitionistic, and G\"odel--Dummett variations of $\mathsf{K4}$ and $\mathsf{S4}$. In our models, intuitionistic and modal operators are interpreted via various topologies over…

Logic · Mathematics 2026-04-28 Juan P. Aguilera , David Fernández-Duque , Leonardo Pacheco

Possibilistic logic has been proposed as a numerical formalism for reasoning with uncertainty. There has been interest in developing qualitative accounts of possibility, as well as an explanation of the relationship between possibility and…

Artificial Intelligence · Computer Science 2013-03-25 Craig Boutilier

We define and axiomatize three new logics based on the connexive logic $\mathsf{C}$, the modal logic $\mathsf{CnK}$ and the conditional logics $\mathsf{CnCK}$ and $\mathsf{CnCK}_R$. These logics display strong connexivity properties and are…

Logic · Mathematics 2025-12-12 Grigory K. Olkhovikov

In this paper we study the interaction between logic and probability. In particular, we show that the convex hull of evaluations of a broad class of logics is always effectively axiomatizable. We define a Birkhoff-style calculus for…

Logic · Mathematics 2025-12-22 Zalán Gyenis

The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic. In this…

Logic in Computer Science · Computer Science 2016-11-23 Corina Cirstea , Clemens Kupke , Dirk Pattinson

The multi-valued logic of {\L}ukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the axiom schema of double negation, [DNE]. However, our…

Logic in Computer Science · Computer Science 2014-08-18 Rob Arthan , Paulo Oliva

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

The logic of constant domains is intuitionistic logic extended with the so-called forall-shift axiom, a classically valid statement which implies the excluded middle over decidable formulas. Surprisingly, this logic is constructive and so…

Logic · Mathematics 2018-10-19 Federico Aschieri

In Outline of a Theory of Truth, Kripke introduces some of the central concepts of the logical study of truth and paradox. He informally defines some of these -- such as groundedness and paradoxicality -- using modal locutions. We introduce…

Logic · Mathematics 2025-03-27 James Walsh

Epistemic modal logic normally views an epistemic situation as a Kripke model. We consider a more basic approach: to view an epistemic situation as a set W of possible states/worlds -- maximal consistent sets of propositions -- with…

Logic · Mathematics 2016-10-18 Sergei Artemov

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

In this paper we analyse logic of false belief in intuitionistic setting. This logic, studied in its classical version by Steinsvold, Fan, Gilbert and Venturi, describes the following situation: a formula F is not satisfied in a given…

Logic · Mathematics 2020-12-16 Tomasz Witczak

The purpose of this paper is to introduce a bi-intuitionistic sequent calculus and to give proofs of admissibility for its structural rules. The calculus I will present, called SC2Int, is a sequent calculus for the bi-intuitionistic logic…

Logic in Computer Science · Computer Science 2020-10-01 Sara Ayhan

We advocate here the use of computational logic for systems biology, as a \emph{unified and safe} framework well suited for both modeling the dynamic behaviour of biological systems, expressing properties of them, and verifying these…

Quantitative Methods · Quantitative Biology 2020-10-07 Elisabetta de Maria , Joelle Despeyroux , Amy Felty , Pietro Liò , Carlos Olarte , Abdorrahim Bahrami

We present Lilac, a separation logic for reasoning about probabilistic programs where separating conjunction captures probabilistic independence. Inspired by an analogy with mutable state where sampling corresponds to dynamic allocation, we…

Programming Languages · Computer Science 2023-05-29 John M. Li , Amal Ahmed , Steven Holtzen

We generalize Fitting's work on Intuitionistic Kripke models of Set Theory using Ono and Komori's Residuated Kripke models. Based on these models, we provide a generalization of the von Neumann hierarchy in the context of Modal Residuated…

Logic · Mathematics 2024-05-09 Jose Moncayo , Pedro H. Zambrano

We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson

Generalizing standard monadic second-order logic for Kripke models, we introduce monadic second-order logic interpreted over coalgebras for an arbitrary set functor. We then consider invariance under behavioral equivalence of MSO-formulas.…

Logic in Computer Science · Computer Science 2019-03-14 Sebastian Enqvist , Fatemeh Seifan , Yde Venema

We define a strongly normalising proof-net calculus corresponding to the logic of strongly compact closed categories with biproducts. The calculus is a full and faithful representation of the free strongly compact closed category with…

Quantum Physics · Physics 2013-06-20 Samson Abramsky , Ross Duncan