English
Related papers

Related papers: The Logic of Approximate Dependence

200 papers

In this paper, we axiomatize the negatable consequences in dependence and independence logic by extending the systems of natural deduction of the logics given in (Kontinen and Vaananen 2013) and (Hannula 2015). We prove a characterization…

Logic · Mathematics 2018-12-19 Fan Yang

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

I consider the question of which dependencies are safe for a Team Semantics-based logic FO(D), in the sense that they do not increase its expressive power over sentences when added to it. I show that some dependencies, like totality,…

Logic · Mathematics 2018-09-12 Pietro Galliani

The logic LAE discussed in this paper is based on an approximate entailment relation. LAE generalises classical propositional logic to the effect that conclusions can be drawn with a quantified imprecision. To this end, properties are…

Logic · Mathematics 2018-08-31 Thomas Vetterlein

We advance a doxastic interpretation for many of the logical connectives considered in Dependence Logic and in its extensions, and we argue that Team Semantics is a natural framework for reasoning about beliefs and belief updates.

Artificial Intelligence · Computer Science 2013-05-22 Pietro Galliani

This paper uses category theory to develop an entirely new approach to approximate game theory. Game theory is the study of how different agents within a multi-agent system take decisions. At its core, game theory asks what an optimal…

Computer Science and Game Theory · Computer Science 2025-09-26 Neil Ghani

Independence logic cannot be effectively axiomatized. However, first-order consequences of independence logic sentences can be axiomatized. In this article we give an explicit axiomatization and prove that it is complete in this sense. The…

Logic · Mathematics 2015-10-14 Miika Hannula

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

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

The FKG theorem says that the POSITIVE LATTICE CONDITION, an easily checkable hypothesis which holds for many natural families of events, implies POSITIVE ASSOCIATION, a very useful property. Thus there is a natural and useful theory of…

Probability · Mathematics 2007-06-13 Robin Pemantle

We consider approximation or recovery of functions based on a finite number of function evaluations. This is a well-studied problem in optimal recovery, machine learning, and numerical analysis in general, but many fundamental insights were…

Numerical Analysis · Mathematics 2026-04-07 David Krieg , Mario Ullrich

Dependence logic provides an elegant approach for introducing dependencies between variables into the object language of first-order logic. In [1] generalized quantifiers were introduced in this context. However, a satisfactory account was…

Logic · Mathematics 2024-04-29 Fredrik Engström

We propose and axiomatize preferences on a product state space in light of uncertainty regarding the dependency of different payoff-relevant factors. Dependence structures allow to decompose probabilities and allow to pin down behavior…

Theoretical Economics · Economics 2026-05-28 Gerrit Bauch , Lorenz Hartmann

We present a complete logic for reasoning with functional dependencies (FDs) with semantics defined over classes of commutative integral partially ordered monoids and complete residuated lattices. The dependencies allow us to express…

Databases · Computer Science 2015-07-07 Vilem Vychodil

The analyzability of the universe into subsystems requires a concept of the "independence" of the subsystems, of which the relativistic quantum world supports many distinct notions which either coincide or are trivial in the classical…

Quantum Physics · Physics 2009-02-16 Stephen J. Summers

We study various notions of dependency in semiring team semantics. Semiring teams are essentially database relations, where each tuple is annotated with some element from a positive semiring. We consider semiring generalizations of several…

Logic in Computer Science · Computer Science 2025-10-10 Minna Hirvonen

We provide a complete axiomatization of modal inclusion logic - team-based modal logic extended with inclusion atoms. We review and refine an expressive completeness and normal form theorem for the logic, define a natural deduction proof…

Logic · Mathematics 2025-03-13 Aleksi Anttila , Matilda Häggblom , Fan Yang

In this article we provide a substantial discussion on the statistical concept of conditional independence, which is not routinely mentioned in most elementary statistics and mathematical statistics textbooks. Under the assumption of…

Other Statistics · Statistics 2020-03-10 Jun Hu , Xianggui Qu

The hypothesis that matter is made of some ultimate and indivisible objects, together the restricted relativity principle, establishes a constraint on the kind of variables we are allowed to use for the variational description of elementary…

General Physics · Physics 2008-11-26 Martin Rivas

Approximation theory is concerned with the ability to approximate functions by simpler and more easily calculated functions. The first question we ask in approximation theory concerns the {\it possibility of approximation}. Is the given…

Classical Analysis and ODEs · Mathematics 2007-05-23 Allan Pinkus