Related papers: An Unusual Proof that the Reals are Uncountable
The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…
In contrast with software-generated randomness (called pseudo-randomness), quantum randomness is provable incomputable, i.e.\ it is not exactly reproducible by any algorithm. We provide experimental evidence of incomputability --- an…
The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order…
We consider the immediate consequence of an arguable addition to the standard Deduction Theorems of first order theories.
We prove a curious identity for the Bernoulli numbers.
We give a self-contained proof of the preservation theorem for proper countable support iterations known as "tools-preservation," "Case A" or "first preservation theorem" in the literature. We do not assume that the forcings add reals.
A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…
We prove a multivariate Lagrange-Good formula for functionals of uncountably many variables and investigate its relation with inversion formulas using trees. We clarify the cancellations that take place between the two aforementioned…
The famous G\"odel incompleteness theorem says that for every sufficiently rich formal theory (containing formal arithmetic in some natural sense) there exist true unprovable statements. Such statements would be natural candidates for being…
The necessary and sufficient conditions for differentiability of a function of several real variables stated and proved and its ramifications discussed.
A definition of what counts as an explanation of mathematical statement, and when one explanation is better than another, is given. Since all mathematical facts must be true in all causal models, and hence known by an agent, mathematical…
We provide an alternative proof that $\sqrt{2}$ is irrational that does not begin with the assumption that $\sqrt{2}$ is in fact rational.
Inspired by computer assisted proofs in analysis, we present an interval approach to real-number computations.
We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.
In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We…
Practicing mathematicians often assume that mathematical claims, when they are true, have good reasons to be true. Such a state of affairs is "unreasonable", in Wigner's sense, because basic results in computational complexity suggest that…
We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…
Probably we have observed a new simple phenomena dealing with approximations to two real numbers.
There are several theorems named after the Italian mathematician Vitali. In this note we provide a simple proof of an extension of Vitali's Theorem on the existence of non-measurable sets. Specifically, we show, without using any…
In a recent paper, Cabbolet argues that the PBR theorem is nonreal since in the ensemble interpretation of quantum mechanics the entangled measurement used in the derivation of the PBR theorem is nonexisting. However, Cabbolet (1) doesn't…