Related papers: 63 Years of the MacDowell-Specker Theorem
From 1873 to 1897, Georg Cantor worked on developing set theory, and despite a strong initial resistance, it rapidly became accepted as the foundation of mathematics. In this work, however, we'll demonstrate that Cantor's use of infinity is…
We investigate the cyclic proof theory of extensions of Peano Arithmetic by (finitely iterated) inductive definitions. Such theories are essential to proof theoretic analyses of certain `impredicative' theories; moreover, our cyclic systems…
We present a new elementary proof of the existence of the least and the greatest solutions to initial value problems in the conditions of Peano's existence theorem. Our proof is based on a modification of Perron's method which allows us to…
We provide a systematic, thorough treatment of the foundations of probability theory and stochastic processes along the lines of E. Bishop's constructive analysis. Every existence result presented shall be a construction; and the input…
Kochen-Specker theorems assure the breakdown of certain types of non-contextual hidden variable theories through the non-existence of global, holistic frame functions; alas they do not allow us to identify where this breakdown occurs, nor…
The Spencer operator, introduced by D.C. Spencer fifty years ago, is rarely used in mathematics today and, up to our knowledge, has never been used in engineering applications or mathematical physics. The main purpose of this paper, an…
We give a survey on generalized Krein algebras $K_{p,q}^{\alpha,\beta}$ and their applications to Toeplitz determinants. Our methods originated in a paper by Mark Krein of 1966, where he showed that $K_{2,2}^{1/2,1/2}$ is a Banach algebra.…
We deal with models of Peano arithmetic (specifically with a question of Ali Enayat). The methods are from creature forcing. We find an expansion of N such that its theory has models with no (elementary) end extensions. In fact there is a…
In this paper we give a short, elementary proof of the following too extreme cases of the Leopoldt conjecture: the case when $\K/\Q$ is a solvable extension and the case when it is a totally real extension in which $p$ splits completely.…
We establish a variety of extensions to the Erdos-Rado Theorem, particularly involving ordinal numbers, and always involving ordinary partition relations. Most of the results can be regarded as consequences of the Ramification Principle,…
Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of full uniform reflection of $\mathsf{PA}$. This result is commonly known as Feferman's completeness theorem. The purpose of this…
We investigate mixing properties of piecewise affine non-Markovian maps acting on $[0,1]^2$ or $[0,1]^3$ and preserving the Lebesgue measure, which are natural generalizations of the {\it heterochaos baker maps} introduced in [Y. Saiki, H.…
We extend Ueda's peak set theorem for subdiagonal subalgebras of tracial finite von Neumann algebras, to sigma-finite von Neumann algebras (that is, von Neumann algebras with a faithful state; which includes those on a separable Hilbert…
In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…
We prove the projective plane $\rp^2$ is an absolute extensor of a finite-dimensional metric space $X$ if and only if the cohomological dimension mod 2 of $X$ does not exceed 1. This solves one of the remaining difficult problems (posed by…
Using the algebraic structure of the Stone-Cech compactification of the integers, Furstenberg and Glasner proved that for arbitrary k, every piecewise syndetic set contains a piecewise syndetic set of k-term arithmetic progressions. We…
This paper is part of a project that is based on the notion of dialectical system, introduced by Magari as a way of capturing trial and error mathematics. In previous work, we investigated the expressive and computational power of…
In 1891 Cantor presented two proofs with the purpose to establish a general theorem that any set can be replaced by a set of greater power. Cantor's power set theorem can be considered to be an extension of Cantor's 1891 second proof and…
Ever since the proof of asymptotic normality of maximum likelihood estimator by Cramer (1946), it has been understood that a basic technique of the Taylor series expansion suffices for asymptotics of $M$-estimators with…
Erd\H{o}s similarity conjecture was proposed by P. Erd\H{o}s in 1974. The conjecture remains open for exponentially decaying sequences as well as Cantor sets that have both Newhouse thickness and Hausdorff dimension zero. In this article,…