English
Related papers

Related papers: A Logic for Arguing About Probabilities in Measure…

200 papers

Given a knowledge base KB containing first-order and statistical facts, we consider a principled method, called the random-worlds method, for computing a degree of belief that some formula Phi holds given KB. If we are reasoning about a…

Artificial Intelligence · Computer Science 2009-09-25 A. J. Grove , J. Y. Halpern , D. Koller

Measurement uncertainty relations are quantitative bounds on the errors in an approximate joint measurement of two observables. They can be seen as a generalization of the error/disturbance tradeoff first discussed heuristically by…

Quantum Physics · Physics 2014-05-01 Paul Busch , Pekka Lahti , Reinhard F Werner

We generalize Bohr's complementarity principle for wave and particle properties to arbitrary quantum systems. We begin by noting that a particle-like state is represented by a spatially-localized wave function and its narrow probability…

Quantum Physics · Physics 2010-12-17 J. A. Vaccaro

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

By invoking quantum estimation theory we formulate bounds of errors in quantum measurement for arbitrary quantum states and observables in a finite-dimensional Hilbert space. We prove that the measurement errors of two observables satisfy…

Quantum Physics · Physics 2013-05-29 Yu Watanabe , Takahiro Sagawa , Masahito Ueda

In quantum logic, i.e., within the structure of the Hilbert lattice imposed on all closed linear subspaces of a Hilbert space, the assignment of truth values to quantum propositions (i.e., experimentally verifiable propositions relating to…

Quantum Physics · Physics 2019-01-25 Arkady Bolotin

Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in…

Artificial Intelligence · Computer Science 2012-03-19 Vibhav Gogate , Pedro Domingos

We introduce some new logics of imperfect information by adding atomic formulas corresponding to inclusion and exclusion dependencies to the language of first order logic. The properties of these logics and their relationships with other…

Logic · Mathematics 2011-06-14 Pietro Galliani

We develop a theory for describing composite objects in physics. These can be static objects, such as tables, or things that happen in spacetime (such as a region of spacetime with fields on it regarded as being composed of smaller such…

Quantum Physics · Physics 2013-03-20 Lucien Hardy

We produce a probabilistic space from logic, both classical and quantum, which is in addition partially ordered in such a way that entropy is monotone. In particular do we establish the following equation: Quantitative Probability = Logic +…

Quantum Physics · Physics 2009-09-29 Bob Coecke

We define the probability of an equation in a finite algebra as the proportion of tuples in its domain that satisfy it. We call the probabilistic spectrum of an algebra the set of probability values obtained when the equation varies. We…

Logic · Mathematics 2026-04-10 Carles Cardó

Information theory is built on probability measures and by definition a probability measure has total mass 1. Probability measures are used to model uncertainty, and one may ask how important it is that the total mass is one. We claim that…

Information Theory · Computer Science 2022-02-08 Peter Harremoës

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

Group Theory · Mathematics 2007-05-23 Jason Fulman

We develop dimension theoretic methods for propositional team based logics. Such quantitative methods were defined for team based first-order logic in a recent paper by Hella, Luosto and the third author and were used to obtain strong…

Logic · Mathematics 2026-02-27 Matilda Häggblom , Minna Hirvonen , Jouko Väänänen

Quantum metrology is a general term for methods to precisely estimate the value of an unknown parameter by actively using quantum resources. In particular, some classes of entangled states can be used to significantly suppress the…

Quantum Physics · Physics 2015-05-01 Takanori Sugiyama

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

Uncertainty quantification is a critical aspect of machine learning models, providing important insights into the reliability of predictions and aiding the decision-making process in real-world applications. This paper proposes a novel way…

Machine Learning · Computer Science 2024-01-02 Yusuf Sale , Paul Hofman , Lisa Wimmer , Eyke Hüllermeier , Thomas Nagler

We describe likelihood-based statistical tests for use in high energy physics for the discovery of new phenomena and for construction of confidence intervals on model parameters. We focus on the properties of the test procedures that allow…

Data Analysis, Statistics and Probability · Physics 2013-06-25 Glen Cowan , Kyle Cranmer , Eilam Gross , Ofer Vitells

We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…

Logic in Computer Science · Computer Science 2021-04-27 Melissa Antonelli , Ugo Dal Lago , Paolo Pistone

We introduce and prove the consistency of a new set theoretic axiom we call the \emph{Invariant Ideal Axiom}. The axiom enables us to provide (consistently) a full topological classification of countable sequential groups, as well as fully…

General Topology · Mathematics 2022-04-08 Michael Hrušák , Alexander Shibakov
‹ Prev 1 4 5 6 7 8 10 Next ›