English
Related papers

Related papers: The Cox Theorem: Unknowns And Plausible Value

200 papers

The classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then it is placed into the framework of evidence theory. Several authors like Laskey, Lehner (1989) and Provan (1990) already…

Artificial Intelligence · Computer Science 2013-03-08 Jurg Kohlas , Paul-Andre Monney

Inspired by the quantitative $K$-theory, in this paper, we introduce the coarse Baum-Connes conjecture with filtered coefficients which generalizes the original conjecture. There are two advantages for the conjecture with filtered…

Operator Algebras · Mathematics 2025-06-24 Jianguo Zhang

Expert systems applications that involve uncertain inference can be represented by a multidimensional contingency table. These tables offer a general approach to inferring with uncertain evidence, because they can embody any form of…

Artificial Intelligence · Computer Science 2013-04-15 David S. Vaughan , Bruce M. Perrin , Robert M. Yadrick , Peter D. Holden , Karl G. Kempf

In this paper we define a class of polynomial functors suited for constructing coalgebras representing processes in which uncertainty plays an important role. In these polynomial functors we include upper and lower probability measures,…

Logic in Computer Science · Computer Science 2024-04-02 Andrés Gallardo , Ignacio Viglizzo

The Principle of Complementarity of Probabilities based on of noncommutative probability is introduced.

Quantum Physics · Physics 2011-05-10 Andrei Khrennikov , Sergei Kozyrev

We present a new system S for handling uncertainty in a quantified modal logic (first-order modal logic). The system is based on both probability theory and proof theory. The system is derived from Chisholm's epistemology. We concretize…

Artificial Intelligence · Computer Science 2018-05-29 Naveen Sundar Govindarajulu , Selmer Bringsjord

An agent often has a number of hypotheses, and must choose among them based on observations, or outcomes of experiments. Each of these observations can be viewed as providing evidence for or against various hypotheses. All the attempts to…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern , Riccardo Pucella

We study formal languages which are capable of fully expressing quantitative probabilistic reasoning and do-calculus reasoning for causal effects, from a computational complexity perspective. We focus on satisfiability problems whose…

Artificial Intelligence · Computer Science 2023-05-17 Benito van der Zander , Markus Bläser , Maciej Liśkiewicz

The logic of uncertainty is not the logic of experience and as well as it is not the logic of chance. It is the logic of experience and chance. Experience and chance are two inseparable poles. These are two dual reflections of one essence,…

General Finance · Quantitative Finance 2018-10-03 Oleg Yu Vorobyev

What would be the consequences if there were fundamental limits to our ability to experimentally explore the world? In this work we seriously consider this question. We assume the existence of statements whose truth value is not…

Quantum Physics · Physics 2024-09-11 Jacopo Surace

The Kochen-Specker theorem shows the impossibility for a hidden variable theory to consistently assign values to certain (finite) sets of observables in a way that is non-contextual and consistent with quantum mechanics. If we require…

Quantum Physics · Physics 2012-12-19 Alastair A. Abbott , Cristian S. Calude , Jonathan Conder , Karl Svozil

While a large body of work has scrutinized the meaning of conditional sentences, considerably less attention has been paid to formal models of their pragmatic use and interpretation. Here, we take a probabilistic approach to pragmatic…

Computation and Language · Computer Science 2022-10-14 Britta Grusdt , Daniel Lassiter , Michael Franke

We consider the theory of algebraically closed fields of characteristic zero with multivalued operations $x\mapsto x^r$ (raising to powers). It is in fact the theory of equations in exponential sums. In an earlier paper we have described…

Logic · Mathematics 2015-01-15 Boris Zilber

In the past century many fundamental results on unpredictability, undecidability and uncertainty have compelled scientists to grapple with the idea that some questions may never be resolved within our current theories. While this…

History and Philosophy of Physics · Physics 2020-05-19 Fabien Paillusson , Matthew Booth

The usual formulation of quantum theory is rather abstract. In recent work I have shown that we can, nevertheless, obtain quantum theory from five reasonable axioms. Four of these axioms are obviously consistent with both classical…

Quantum Physics · Physics 2007-05-23 Lucien Hardy

We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.

Logic in Computer Science · Computer Science 2016-01-08 Gilles Dowek , Ying Jiang

A primary motivation for reasoning under uncertainty is to derive decisions in the face of inconclusive evidence. However, Shafer's theory of belief functions, which explicitly represents the underconstrained nature of many reasoning…

Artificial Intelligence · Computer Science 2013-04-08 Thomas M. Strat

Established frameworks to understand problems with reproducibility in science begin with the relationship between our understanding of the prior probability of a claim and the statistical certainty that should be demanded of it, and explore…

Other Statistics · Statistics 2022-05-30 Maria Chikina , Wesley Pegden

Here, by introducing a version of Unexpected hanging paradox first we try to open a new way and a new explanation for paradoxes, similar to liar paradox. Also, we will show that we have a semantic situation which no syntactical logical…

Logic · Mathematics 2015-06-30 Farzad Didehvar

This paper modifies Jaynes's axioms of plausible reasoning and derives the minimum relative entropy principle, Bayes's rule, as well as maximum likelihood from first principles. The new axioms, which I call the Optimum Information…

Information Theory · Computer Science 2011-03-30 Alexis Akira Toda