Related papers: Comparing Weakest Precondition and Weakest Liberal…
One of the remarkable notions in the recent development of quantum physics is the weak value related to weak measurements. We emulate it as a two-time conditional expectation in a classical stochastic model. We use the well known…
The rigid relation principle, introduced in this article, asserts that every set admits a rigid binary relation. This follows from the axiom of choice, because well-orders are rigid, but we prove that it is neither equivalent to the axiom…
Counterfactual explanation generation is a powerful method for Explainable Artificial Intelligence. It can help users understand why machine learning models make specific decisions, and how to change those decisions. Evaluating the…
The language of probability is used to define several different types of conditional statements. There are four principal types: subjunctive, material, existential, and feasibility. Two further types of conditionals are defined using the…
The weak equivalence principle is studied in a space with noncommutativity of coordinates and noncommutativity of momenta. We find conditions on the parameters of noncommutativity which give the possibility to recover the equivalence…
We propose a usage of a weak value for a quantum processing between preselection and postselection. While the weak value of a projector of 1 provides a process with certainty like the probability of 1, the weak value of -1 negates the…
In this paper a conditional logic is defined and studied. This conditional logic, Deterministic Bayesian Logic, is constructed as a deterministic counterpart to the (probabilistic) Bayesian conditional. The logic is unrestricted, so that…
We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…
We develop a duality for (modal) lattices that need not be distributive, and use it to study positive (modal) logic beyond distributivity, which we call weak positive (modal) logic. This duality builds on the Hofmann, Mislove and Stralka…
Conditional probabilities are a core concept in machine learning. For example, optimal prediction of a label $Y$ given an input $X$ corresponds to maximizing the conditional probability of $Y$ given $X$. A common approach to inference tasks…
In this paper, all rings are commutative with nonzero identity. Let $M$ be an $R$-module. A proper submodule $N$ of $M$ is called a classical prime submodule, if for each $m \in M$ and elements $a,b\in R$, $abm\in N$ implies that $am\in N$…
Many people have proposed definitions of `weak n-category'. Ten of them are presented here. Each definition is given in two pages, with a further two pages on what happens when n = 0, 1, or 2. The definitions can be read independently.…
Language is not only used to transmit neutral information; we often seek to persuade by arguing in favor of a particular view. Persuasion raises a number of challenges for classical accounts of belief updating, as information cannot be…
Recently, several researchers have claimed that conclusions obtained from a Bayes factor (or the posterior odds) may contradict those obtained from Bayesian posterior estimation. In this short paper, we wish to point out that no such…
Retrocausal models of QM add further weight to the conflict between causality and the possible existence of free will. We analyze a simple closed causal loop ensuing from the interaction between two systems with opposing thermodynamic time…
Computational interpretations of linear logic allow static control of memory resources: the data produced by the program are endowed through its type with attributes that determine its life cycle, and guarantee safe deallocation. The use of…
The time evolution of the two-time conditional probability of the classical stochastic process is described in an analogous form of the quantum mechanical wave equations. By using it, we emulate the same strange behaviors as those of the…
Every statement of the Ramsey theory of finite structures corresponds to the fact that a particular category has the Ramsey property. We can, then, compare the strength of Ramsey statements by comparing the ``Ramsey strength'' of the…
This work provides some general theorems about unconditional and conditional weak convergence of empirical processes in the case of Poisson sampling designs. The theorems presented in this work are stronger than previously published…
Branching and weak probabilistic bisimilarities are two well-known notions capturing behavioral equivalence between nondeterministic probabilistic systems. For probabilistic systems, divergence is of major concern. Recently several…