English
Related papers

Related papers: Independence of Essential Sets in Finite Implicati…

200 papers

Usual math sets have special types: countable, compact, open, occasionally Borel, rarely projective, etc. Each such set is described by a single Set Theory formula with parameters unrelated to other formulas. Exotic expressions involving…

Logic in Computer Science · Computer Science 2026-04-01 Leonid A. Levin

The representation of independence relations generally builds upon the well-known semigraphoid axioms of independence. Recently, a representation has been proposed that captures a set of dominant statements of an independence relation from…

Artificial Intelligence · Computer Science 2012-07-19 Peter de Waal , Linda C. van der Gaag

In this paper, we show that coherent sets of gambles and coherent lower and upper previsions can be embedded into the algebraic structure of information algebra. This leads firstly, to a new perspective of the algebraic and logical…

Artificial Intelligence · Computer Science 2021-04-28 Arianna Casanova , Juerg Kohlas , Marco Zaffalon

The coherence of an individual quantum state can be meaningfully discussed only when referring to a preferred basis. This arbitrariness can however be lifted when considering sets of quantum states. Here we introduce the concept of set…

Quantum Physics · Physics 2021-06-08 Sébastien Designolle , Roope Uola , Kimmo Luoma , Nicolas Brunner

Nice error bases have been introduced by Knill as a generalization of the Pauli basis. These bases are shown to be projective representations of finite groups. We classify all nice error bases of small degree, and all nice error bases with…

Quantum Physics · Physics 2023-11-27 Andreas Klappenecker , Martin Roetteler

The main result of the paper is that a system of invariant subspaces of a (completely non-unitary) Hilbert space contraction $T$ with finite defects (rank$(I-T^*T)<\infty$, rank$(I-TT^*)<\infty$) is an unconditional basis (Riesz basis) if…

Functional Analysis · Mathematics 2016-09-06 Serguei Treil

The ordinary Structure Identity Principle states that any property of set-level structures (e.g., posets, groups, rings, fields) definable in Univalent Foundations is invariant under isomorphism: more specifically, identifications of…

A lattice-theoretic framework is introduced that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures. Semi-lattices are associated with CI statements and a…

Artificial Intelligence · Computer Science 2014-08-12 Mathias Niepert , Dirk Van Gucht , Marc Gyssens

A lattice-theoretic framework is introduced that permits the study of the conditional independence (CI) implication problem relative to the class of discrete probability measures. Semi-lattices are associated with CI statements and a…

Artificial Intelligence · Computer Science 2008-11-03 Mathias Niepert , Dirk Van Gucht , Marc Gyssens

One of the essential features of quantum mechanics is that most pairs of observables cannot be measured simultaneously. This phenomenon is most strongly manifested when observables are related to mutually unbiased bases. In this paper, we…

Quantum Physics · Physics 2015-05-27 M. Wiesniak , T. Paterek , A. Zeilinger

The cumulative hierarchy conception of set, which is based on the conception that sets are inductively generated from "former" sets, is generally considered a good way to create a set conception that seems safe from contradictions. This…

History and Overview · Mathematics 2011-11-16 Rafi Shalom

Incomplete preferences provide the epistemic foundation for models of imprecise subjective probabilities and utilities that are used in robust Bayesian analysis and in theories of bounded rationality. This paper presents a simple…

Statistics Theory · Mathematics 2007-06-13 Robert Nau

We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…

Data Structures and Algorithms · Computer Science 2025-11-04 Oscar Defrain , Arthur Ohana , Simon Vilmin

We study lattices in free abelian groups of infinite rank that are invariant under the action of the infinite symmetric group, with emphasis on finiteness of their equivariant bases. Our framework provides a new method for proving…

Combinatorics · Mathematics 2023-09-15 Dinh Van Le , Tim Römer

We provide a short and elementary proof for the recently proved result by G. da Prato and H. Frankowska that -- under minimal assumptions -- a closed set is invariant with respect to a stochastic control system if and only if it is…

Optimization and Control · Mathematics 2007-11-08 Rainer Buckdahn , Marc Quincampoix , Catherine Rainer , Josef Teichmann

The notion of clause set cycle abstracts a family of methods for automated inductive theorem proving based on the detection of cyclic dependencies between clause sets. By discerning the underlying logical features of clause set cycles, we…

Logic in Computer Science · Computer Science 2022-08-05 Stefan Hetzl , Jannik Vierling

Exposure mappings facilitate investigations of complex causal effects when units interact in experiments. Current methods require experimenters to use the same exposure mappings both to define the effect of interest and to impose…

Statistics Theory · Mathematics 2023-03-14 Fredrik Sävje

Given a block of a finite group, any source algebra has a basis invariant under the multiplicative actions of the defect group. Is such a basis a characteristic biset of the block fusion system? If the basis can be chosen to consist…

Representation Theory · Mathematics 2019-09-05 Laurence Barker , Matthew Gelvin

We extend the treatment of functional dependence, the basic concept of dependence logic, to include the possibility of dependence with a limited number of exceptions. We call this approximate dependence. The main result of the paper is a…

Logic · Mathematics 2014-08-20 Jouko Väänänen

We generalize the notion of consequence relation standard in abstract treatments of logic to accommodate intuitions of relevance. The guiding idea follows the \emph{use criterion}, according to which in order for some premises to have some…

Logic · Mathematics 2024-11-20 Guillermo Badia , Petr Cintula , Libor Behounek , Andrew Tedder