Related papers: Fast-collapsing theories
The reflection principle is the statement that if a sentence is provable then it is true. Reflection principles have been studied for first-order theories, but they also play an important role in propositional proof complexity. In this…
Determinism is established in quantum mechanics by tracing the probabilities in the Born rules back to the absolute (overall) phase constants of the wave functions and recognizing these phase constants as pseudorandom numbers. The reduction…
We shed new light on Heisenberg's uncertainty principle in the sense of Beurling, by offering an essentially different proof which permits us to weaken the assumptions substantially, and examples show that the result is sharp. The proof…
The first version of this paper gave another proof of the Kropholler Conjecture, which gives a relative version of Stallings Ends Theorem, following an earlier incorrect proof. It has been pointed out by Sam Shepherd that the the second…
This article critically reappraises arguments in support of Cantor's theory of transfinite numbers. The following results are reported: i) Cantor's proofs of nondenumerability are refuted by analyzing the logical inconsistencies in…
For a long time, Collatz Conjecture has been assumed to be true, although a formal proof has eluded all efforts to date. In this article, evidence is presented that suggests such an assumption is incorrect. By analysing the stopping times…
The Collatz conjecture is explored using polynomials based on a binary numeral system. It is shown that the degree of the polynomials, on average, decreases after a finite number of steps of the Collatz operation, which provides a weak…
The compactness phenomenon is one of the featured aspects of structuralism in mathematics. In simple and broad words, a compactness property holds in a structure if a related property is satisfied by sufficiently many substructures of that…
To resolve the quantum measurement problem, we propose an objective collapse theory in which both the wavefunction and the process of collapse are regarded as ontologically objective. The theory, which we call the entangling-speed-threshold…
J. v. Neumann justified the collapse postulate by the empirical fact of the repeatability of a measurement at a single quantum system. However, in his quantum mechanical treatment of the measurement process repeatability emerges without…
It is shown that the pillars of transfinite set theory, namely the uncountability proofs, do not hold. (1) Cantor's first proof of the uncountability of the set of all real numbers does not apply to the set of irrational numbers alone, and,…
We establish the exact overlaps conjecture for iterated functions systems on the real line with algebraic contractions and arbitrary translations.
In this paper, we present a constructive proof of Herschfeld's Convergence Theorem. Our formulation differs from Herschfeld's in a few ways: We consider radicals that nest transfinitely many times, as these are essential to the proof;…
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…
We prove Los conjecture = Morley theorem in ZF, with the same characterization (of first order countable theories categorical in aleph_alpha for some (equivalently for every) ordinal alpha>0. Another central result here is, in this context:…
A well-known version of Rowbottom's theorem for supercompactness ultrafilters leads naturally to notions of two-cardinal Ramseyness and corresponding normal ideals introduced herein. Generalizing results of Baumgartner [7, 8], Feng [22] and…
An important part of textual inference is making deductions involving monotonicity, that is, determining whether a given assertion entails restrictions or relaxations of that assertion. For instance, the statement 'We know the epidemic…
The association of information with entropy has been argued on plausibility arguments involving the operation of imaginary engines and beings, and it is not a universal theorem. In this paper, a theorem by Charles Bennett on reversible…
In the recent paper [Jin, Kolda & Ward, arXiv:1909.04801], it is proved that the Kronecker fast Johnson-Lindenstrauss transform (KFJLT) is, in fact, a Johnson-Lindenstrauss transform, which had previously only been conjectured. In this…
By Rabinowitsch' trick Hilbert's Nullstellensatz follows from the weak Nullstellensatz (Rabinowitsch 1929). The weak version can be shown with elimination theory. Hilbert's original proof is also based on successive elimination. Lasker…