English
Related papers

Related papers: Questions and dependency in intuitionistic logic

200 papers

The basics of Intuitionistic Kripke-Platek set theory are developed, and some independence results among related classically equivalent theories are shown using Kripke models.

Logic · Mathematics 2015-10-05 Robert Lubarsky

We introduce a semantics for epistemic logic exploiting a belief base abstraction. Differently from existing Kripke-style semantics for epistemic logic in which the notions of possible world and epistemic alternative are primitive, in the…

Computer Science and Game Theory · Computer Science 2019-07-23 Emiliano Lorini

We explore various semantic understandings of dual intuitionistic logic by exploring the relationship between co-Heyting algebras and topological spaces. First, we discuss the relevant ideas in the setting of Heyting algebras and…

Logic · Mathematics 2024-11-26 Safal Raman Aryal

We study dependence and independence concepts found in quantum physics, especially those related to hidden variables and non-locality, through the lens of team semantics and probabilistic team semantics, adapting a relational framework…

Logic · Mathematics 2026-03-04 Samson Abramsky , Joni Puljujärvi , Jouko Väänänen

Many forms of dependence manifest themselves over time, with behavior of variables in dynamical systems as a paradigmatic example. This paper studies temporal dependence in dynamical systems from a logical perspective, by enriching a…

Logic in Computer Science · Computer Science 2024-03-29 Alexandru Baltag , Johan van Benthem , Dazhu Li

Team semantics is a semantical framework for the study of dependence and independence concepts ubiquitous in many areas such as databases and statistics. In recent works team semantics has been generalised to accommodate also multisets and…

Logic in Computer Science · Computer Science 2018-03-07 Arnaud Durand , Miika Hannula , Juha Kontinen , Arne Meier , Jonni Virtema

It is known that intuitionistic Kripke semantics can be generalized so that it can treat arbitrary propositional connectives characterized by truth functions. We extend this generalized Kripke semantics to first-order logic, and study how…

Logic · Mathematics 2022-05-13 Naosuke Matsuda , Kento Takagi

We propose an extension of Poole's independent choice logic based on a relaxation of the underlying independence assumptions. A credal semantics involving multiple joint probability mass functions over the possible worlds is adopted. This…

Logic in Computer Science · Computer Science 2018-06-22 Alessandro Antonucci , Alessandro Facchini

We introduce a new semantics for a logic of explicit and implicit beliefs based on the concept of multi-agent belief base. Differently from existing Kripke-style semantics for epistemic logic in which the notions of possible world and…

Artificial Intelligence · Computer Science 2018-12-19 Emiliano Lorini

The intuitionistic modal logics considered between Constructive K (CK) and Intuitionistic K (IK) differ in their treatment of the possibility (diamond) connective. It was recently rediscovered that some logics between CK and IK also…

Logic in Computer Science · Computer Science 2025-04-23 Jim de Groot , Ian Shillito , Ranald Clouston

We give an overview of some developments in dependence and independence logic. This is a tiny selection, intended for a newcomer, from a rapidly growing literature on the topic. Furthermore, we discuss conditional independence atoms and we…

Logic · Mathematics 2013-05-28 Pietro Galliani , Jouko Väänänen

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 they…

Logic · Mathematics 2023-06-22 Ivano Ciardelli , Martin Otto

This paper presents a simple decidable logic of functional dependence LFD, based on an extension of classical propositional logic with dependence atoms plus dependence quantifiers treated as modalities, within the setting of generalized…

Logic in Computer Science · Computer Science 2021-03-30 Alexandru Baltag , Johan van Benthem

This paper establishes and proves complexity results for entailment for cumulative propositional dependence logic and for cumulative propositional logic with team semantics. As recently shown, cumulative logics are famously characterised by…

Logic in Computer Science · Computer Science 2026-05-21 Kai Sauerwald , Juha Kontinen , Arne Meier

The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal…

Logic in Computer Science · Computer Science 2023-06-22 Miika Hannula

Causal multiteam semantics is a framework where probabilistic dependencies arising from data and causation between variables can be together formalized and studied logically. We consider several logics in the setting of causal multiteam…

Logic in Computer Science · Computer Science 2023-03-22 Fausto Barbero , Jonni Virtema

The importance of intuitionistic temporal logics in Computer Science and Artificial Intelligence has become increasingly clear in the last few years. From the proof-theory point of view, intuitionistic temporal logics have made it possible…

Logic in Computer Science · Computer Science 2023-06-22 Joseph Boudou , Martín Diéguez , David Fernández-Duque , Philip Kremer

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

Conditional independence is a crucial concept supporting adequate modelling and efficient reasoning in probabilistics. In knowledge representation, the idea of conditional independence has also been introduced for specific formalisms, such…

Artificial Intelligence · Computer Science 2024-12-19 Jesse Heyninck

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu