Related papers: Failure of Normalization in Impredicative Type The…
In this paper we propose an interpretation for self-referential propositions in a "meta-model" N* of ZF. This meta-model N* is considered as an informal model of arithmetic that mathematicians often use when working with number theory.…
A knowledge system S describing a part of real world does in general not contain complete information. Reasoning with incomplete information is prone to errors since any belief derived from S may be false in the present state of the world.…
We consider the problem of removing the divergences in an arbitrary gauge-field theory (possibly nonrenormalizable). We show that this can be achieved by performing, order by order in the loop expansion, a redefinition of some parameters…
This paper shows that the interpolation theorem fails in the intuitionistic logic of constant domains. This result refutes two previously published claims that the interpolation property holds.
We consider the diffeomorphism invariant gravity coupled with the ideal fluid in the non-standard way. The Lorentz-invariance of the graviton propagator in such a theory considered as perturbation over flat background turns out to be broken…
We prove special cases of a general conjecture: If an invertible field theory admits a projectively topological boundary theory, then it has finite order in the abelian group of invertible field theories. One can substitute `gapped' for…
The prevalent interpretation of G\"odel's Second Theorem states that a sufficiently adequate and consistent theory does not prove its consistency. It is however not entirely clear how to justify this informal reading, as the formulation of…
We construct a theory in which the gravitational interaction is described only by torsion, but that generalizes the Teleparallel Theory still keeping the invariance of local Lorentz transformations in one particular case. We show that our…
We prove the irrationality of some factorial series. To do so we combine methods from elementary and analytic number theory with methods from the theory of uniform distribution.
In this paper we study the variance of the Euler totient function (normalized to $\varphi(n)/n$) in the integers $\mathbb{Z}$ and in the polynomial ring $\mathbb{F}_q[T]$ over a finite field $\mathbb{F}_q$. It turns out that in…
A central focus of data science is the transformation of empirical evidence into knowledge. As such, the key insights and scientific attitudes of deep thinkers like Fisher, Popper, and Tukey are expected to inspire exciting new advances in…
Hartle and Srednicki have argued that there is no observational evidence favoring our typicality. Here it is shown that such evidence does arise from including the `normalization principle' requirement that the sum of the likelihoods for…
We report an inconsistency found in probability theory (also referred to as measure-theoretic probability). For probability measures induced by real-valued random variables, we deduce an "equality" such that one side of the "equality" is a…
Any representational enterprise must omit variation in order to function. NASA still uses Newtonian mechanics, though Einstein superseded Newton, and the standard picture of scientific progress cannot explain how. A description that omitted…
Cox's well-known theorem justifying the use of probability is shown not to hold in finite domains. The counterexample also suggests that Cox's assumptions are insufficient to prove the result even in infinite domains. The same…
The idea of this approach towards proving the consistency of Quine's New Foundations set theory is to go in a completely untyped manner. So no contemplation about types is utilized here. All conceptualization pivots around proving a handful…
Boyer and Moore have discussed a recursive function that puts conditional expressions into normal form [1]. It is difficult to prove that this function terminates on all inputs. Three termination proofs are compared: (1) using a measure…
This paper introduces a novel type theory and logic for probabilistic reasoning. Its logic is quantitative, with fuzzy predicates. It includes normalisation and conditioning of states. This conditioning uses a key aspect that distinguishes…
We give in this paper a short semantical proof of the strong normalization for full propositional classical natural deduction. This proof is an adaptation of reducibility candidates introduced by J.-Y. Girard and simplified to the classical…
We introduce a system of monadic affine sized types, which substantially generalise usual sized types, and allows this way to capture probabilistic higher-order programs which terminate almost surely. Going beyond plain, strong…