Related papers: Induction rules in bounded arithmetic
Following the renewed interest in the topic [1], we revisit the problem of assigning probabilities to classes of Feynman paths passing through specified space-time regions. We show that by assigning of probabilities to interfering…
Statistical Inference is the process of determining a probability distribution over the space of parameters of a model given a data set. As more data becomes available this probability distribution becomes updated via the application of…
Modern text-to-image (T2I) models amplify harmful societal biases, challenging their ethical deployment. We introduce an inference-time method that reliably mitigates social bias while keeping prompt semantics and visual context…
We compute the boundary entropies for the allowed boundary conditions of the SU(2)-invariant principal chiral model at level k=1. We used the reflection factors determined in a previous work. As a by-product we obtain some miscellaneous…
We study kth order systems of two rational difference equations $$x_n=\frac{\alpha+\sum^{k}_{i=1}\beta_{i}x_{n-i} + \sum^{k}_{i=1}\gamma_{i}y_{n-i}}{A+\sum^{k}_{j=1}B_{j}x_{n-j} + \sum^{k}_{j=1}C_{j}y_{n-j}},\quad n\in\mathbb{N},$$…
Bayesian inference is limited in scope because it cannot be applied in idealized contexts where none of the hypotheses under consideration is true and because it is committed to always using the likelihood as a measure of evidential…
Proof by induction plays a central role in formal verification. However, its automation remains as a formidable challenge in Computer Science. To solve inductive problems, human engineers often have to provide auxiliary lemmas manually. We…
Within the Kolmogorov theory of probability, Bayes' rule allows one to perform statistical inference by relating conditional probabilities to unconditional probabilities. As we show here, however, there is a continuous set of alternative…
An inductive probabilistic classification rule must generally obey the principles of Bayesian predictive inference, such that all observed and unobserved stochastic quantities are jointly modeled and the parameter uncertainty is fully…
The variational framework for learning inducing variables (Titsias, 2009a) has had a large impact on the Gaussian process literature. The framework may be interpreted as minimizing a rigorously defined Kullback-Leibler divergence between…
We describe high order accurate and stable finite difference schemes for the initial-boundary value problem associated with the magnetic induction equations. These equations model the evolution of a magnetic field due to a given velocity…
We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is…
It has been shown that word embeddings derived from large corpora tend to incorporate biases present in their training data. Various methods for mitigating these biases have been proposed, but recent work has demonstrated that these methods…
Peculiar measurements can be obtained on systems that undergo both pre- and post-selection. We prove a conjecture from [1] on logical Pre- and Post-Selection (PPS) paradoxes for a restricted case. We prove that all of these paradoxes admit…
We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…
Recently we presented a concise survey of the formulation of the induction and coinduction principles, and some concepts related to them, in five different fields mathematical fields, hence shedding some light on the precise relation…
A well-known problem in the theory of dependent types is how to handle so-called nested data types. These data types are difficult to program and to reason about in total dependently typed languages such as Agda and Coq. In particular, it…
We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…
System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as $A\wedge B$ and $B\wedge A$, or $A\Rightarrow(B\wedge C)$ and $(A\Rightarrow B)\wedge(A\Rightarrow C)$ are made equal. System I enjoys…
We investigate the injective types and the algebraically injective types in univalent mathematics, both in the absence and in the presence of propositional resizing. Injectivity is defined by the surjectivity of the restriction map along…