English
Related papers

Related papers: Intermediate logics in the setting of team semanti…

200 papers

We show that intuitionistic propositional logic is \emph{Carnap categorical}: the only interpretation of the connectives consistent with the intuitionistic consequence relation is the standard interpretation. This holds relative to the most…

Logic · Mathematics 2022-12-27 Haotian Tong , Dag Westerståhl

An extension of an abstract argumentation framework, called collective argumentation, is introduced in which the attack relation is defined directly among sets of arguments. The extension turns out to be suitable, in particular, for…

Artificial Intelligence · Computer Science 2007-05-23 Alexander Bochman

Consider a community of scientists whose labs are each capable of conducting a different set of experiments. The scientists want to work together to confirm a new hypothesis, but to ensure blindness, their labs generally prohibit the…

Logic in Computer Science · Computer Science 2026-05-01 Siddharth Namachivayam

We discuss an ongoing line of research in the relational (non topological) semantics of non-distributive logics. The developments we consider are technically rooted in dual characterization results and insights from unified correspondence…

Intuitionistic dependence logic was introduced by Abramsky and Vaananen (2009) as a variant of dependence logic under a general construction of Hodges' (trump) team semantics. It was proven that there is a translation from intuitionistic…

Logic · Mathematics 2018-12-19 Fan Yang

We present some applications of intermediate logics in the field of Answer Set Programming (ASP). A brief, but comprehensive introduction to the answer set semantics, intuitionistic and other intermediate logics is given. Some equivalence…

Logic in Computer Science · Computer Science 2007-05-23 Mauricio Osorio , Juan Antonio Navarro , Jose Arrazola

This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…

Logic · Mathematics 2023-03-21 Davide Emilio Quadrellaro

Several different proof translations exist between classical and intuitionistic logic (negative translations), and intuitionistic and linear logic (Girard translations). Our aims in this paper are (1) to consider extensions of…

Logic · Mathematics 2025-11-11 Gilda Ferreira , Paulo Oliva , Clarence Lewis Protin

Logics with team semantics provide alternative means for logical characterization of complexity classes. Both dependence and independence logic are known to capture non-deterministic polynomial time, and the frontiers of tractability in…

Logic in Computer Science · Computer Science 2019-03-27 Miika Hannula , Lauri Hella

Since the introduction by Hodges, and refinement by V\"a\"an\"anen, team semantic constructions have been used to generate expressively enriched logics still conserving nice properties, such as compactness or decidability. In contrast,…

Logic · Mathematics 2023-11-21 Fredrik Engström , Orvar Lorimer Olsson

In recent years, the logic of questions and dependencies has been investigated in the closely related frameworks of inquisitive logic and dependence logic. These investigations have assumed classical logic as the background logic of…

Logic · Mathematics 2020-11-11 Ivano Ciardelli , Rosalie Iemhoff , Fan Yang

We define a variant of team semantics called multiteam semantics based on multisets and study the properties of various logics in this framework. In particular, we define natural probabilistic versions of inclusion and independence atoms…

Logic in Computer Science · Computer Science 2015-12-22 Arnaud Durand , Miika Hannula , Juha Kontinen , Arne Meier , Jonni Virtema

This paper revisits the multi-agent epistemic logic presented in [10], where agents and sets of agents are replaced by abstract, intensional "names". We make three contributions. First, we study its model theory, providing adequate notions…

Logic in Computer Science · Computer Science 2021-06-23 Marta Bílková , Zoé Christoff , Olivier Roy

We introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new…

Logic · Mathematics 2020-08-19 Eveline Lehmann , Thomas Studer

Semiring semantics for first-order logic provides a way to trace how facts represented by a model are used to deduce satisfaction of a formula. Team semantics is a framework for studying logics of dependence and independence in diverse…

Logic in Computer Science · Computer Science 2023-03-15 Timon Barlag , Miika Hannula , Juha Kontinen , Nina Pardal , Jonni Virtema

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

This paper proposes a formal framework for modeling the interaction of causal and (qualitative) epistemic reasoning. To this purpose, we extend the notion of a causal model with a representation of the epistemic state of an agent. On the…

Artificial Intelligence · Computer Science 2020-11-02 Fausto Barbero , Katrin Schulz , Sonja Smets , Fernando R. Velázquez-Quesada , Kaibo Xie

Team semantics is the mathematical framework of modern logics of dependence and independence in which formulae are interpreted by sets of assignments (teams) instead of single assignments as in first-order logic. In order to deepen the…

Logic in Computer Science · Computer Science 2020-03-27 Miika Hannula , Juha Kontinen , Jonni Virtema

Interim analyses for group-sequential decision making are prevalent in clinical trials. Methodology is well established and has been routinely implemented over the last decades. Still, confusions and uncertainties on aspects of how to…

We introduce a new family of temporal logics designed to finely balance the trade-off between expressivity and complexity. Their key feature is the possibility of defining operators of a new kind that we call transformation operators. Some…

Logic in Computer Science · Computer Science 2024-09-09 Alessandro Ronca