Related papers: Probabilistic entailment and iterated conditionals
Theoretical considerations of Bell-inequality experiments usually assume identically prepared and independent pairs of particles. Here we consider pairs that exhibit both intra- and inter-pair entanglement. The pairs are taken from a large…
Similar formalisms have been independently developed in psychology, to deal with the issue of selective influences (deciding which of several experimental manipulations selectively influences each of several, generally non-independent,…
In this article, we review selective inference, a set of techniques for inference when the statistical question asked is a function of the data. This setting often arises in contemporary scientific workflows, where hypotheses and parameters…
In this paper we propose a categorical theory of intensionality. We first revisit the notion of intensionality, and discuss we its relevance to logic and computer science. It turns out that 1-category theory is not the most appropriate…
Algorithms for computing equilibria, optima, and fixed points in nonconvex problems often depend sensitively on practitioner-chosen initial conditions. When uniqueness of a solution is of interest, a common heuristic is to run such…
Composite likelihood has shown promise in settings where the number of parameters $p$ is large due to its ability to break down complex models into simpler components, thus enabling inference even when the full likelihood is not tractable.…
We give a finite-sample analysis of predictive inference procedures after model selection in regression with random design. The analysis is focused on a statistically challenging scenario where the number of potentially important…
Measuring how quickly iterative methods converge is essential in computational mathematics, but current approaches have significant limitations. Q-order analysis requires strict smoothness conditions, while R-order analysis lacks precision…
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…
The logic of hereditary Harrop formulas (HH) has proven useful for specifying a wide range of formal systems. This logic includes a form of hypothetical judgment that leads to dynamically changing sets of assumptions and that is key to…
Let (U \subset {\mathbb R}^3) be an open set and (f:U \to f(U) \subset {\mathbb R}^3) be a homeomorphism. Let (p \in U) be a fixed point. It is known that, if (\{p\}) is not an isolated invariant set, the sequence of the fixed point indices…
I show how probabilities arise in quantum physics by exploring implications of {\it environment - assisted invariance} or {\it envariance}, a recently discovered symmetry exhibited by entangled quantum systems. Envariance of perfectly…
We introduce the entangled quantum polynomial hierarchy $\mathsf{QEPH}$ as the class of problems that are efficiently verifiable given alternating quantum proofs that may be entangled with each other. We prove $\mathsf{QEPH}$ collapses to…
In this paper, we address conditional testing problems through the conformal inference framework. We define the localized conformal p-values by inverting prediction intervals and prove their theoretical properties. These defined p-values…
Modus ponens (\emph{from $A$ and "if $A$ then $C$" infer $C$}, short: MP) is one of the most basic inference rules. The probabilistic MP allows for managing uncertainty by transmitting assigned uncertainties from the premises to the…
We have recently introduced a measure of the bipartite entanglement of identical particles, E_P, based on the principle that entanglement should be accessible for use as a resource in quantum information processing. We show here that…
We introduce and investigate a simple model of conditional quantum dynamics. It allows for a discussion of the information-theoretic aspects of quantum measurements, decoherence, and environment-induced superselection (einselection).
Methods for probability updating, of which Bayesian conditionalization is the most well-known and widely used, are modeling tools that aim to represent the process of modifying an initial epistemic state, typically represented by a prior…
We study a renewal problem within a periodic environment, departing from the classical renewal theory by relaxing the assumption of independent and identically distributed inter-arrival times. Instead, the conditional distribution of the…
In this paper we develop cyclic proof systems for the problem of inclusion between the least sets of models of mutually recursive predicates, when the ground constraints in the inductive definitions belong to the quantifier-free fragments…