Related papers: On a theorem of Shapiro

We describe a formal proof of the independence of the continuum hypothesis ($\mathsf{CH}$) in the Lean theorem prover. We use Boolean-valued models to give forcing arguments for both directions, using Cohen forcing for the consistency of…

In partial answer to a question posed by Arnie Miller (http://www.math.wisc.edu/~miller/res/problem.pdf) and X. Caicedo, we obtain sufficient conditions for an L_{omega_1,omega} theory to have an independent axiomatization. As a consequence…

We show that there is an arithmetical formula F such that ZF proves that F is independent of PA and yet, unlike other arithmetical independent statements, the truth value of F cannot at present be established in ZF or in any other trusted…

The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised…

Two theorems about the P versus NP problem be proved in this article (1) There exists a language $L$, that the statement $L \in \textbf{P}$ is independent of ZFC. (2) There exists a language $L \in \textbf{NP}$, for any polynomial time…

We give a new proof of quantum Shannon-McMillan theorem, extending it to AF $C^*$-systems. Our proof is based on the variational principle, instead of the classical Shannon-McMillan theorem.

We consider a generalized version (GES) of the wellknown Severini-Egoroff theorem in real analysis, first shown to be undecidable in ZFC by Tomasz Weiss. This independence is easily derived from suitable hypotheses on some cardinal…

It is discussed that Zeeman's theorem can be directly obtained from Liouville's theorem if we assume sufficient differentiability.

In this paper we prove Shapiro's 1958 Conjecture on exponential polynomials, assuming Schanuel's Conjecture.

Our main result, Theorem 3.3, uses Friedman's Jump Free Theorem, Theorem 2.7, which he has shown to be independent of ZFC, the usual axioms of set theory. We conjecture that Theorem 3.3, a straight forward translation of the statement of…

In this paper we present a simpler proof of the fact that no inequality between $\mathrm{cof}(\mathcal{SN})$ and $\mathfrak{c}$ can be decided in ZFC by using well-known tecniques and results.

It is proved in $\mathsf{ZF}$ (without the axiom of choice) that, for all infinite sets $M$, there are no surjections from $\omega\times M$ onto $\mathscr{P}(M)$.

In this paper, we prove that the weighted BMO space as follows $${\rm BMO}^{p}(\omega)=\Big\{f\in L^{1}_{\rm loc}:\sup_{Q}\|\chi_{Q}\|^{-1}_{L^{p}(\omega)}\big\|(f-f_{Q})\omega^{-1}\chi_{Q}\big\|_{L^{p}(\omega)}<\infty\Big\}$$ is…

In this note we exhibit a very simple proof of McNaughton Theorem, almost right out of the definitions, and at the same time we observe that this theorem does not depend of Chang's completeness theorem.

In \cite{cartier2}, Pierre Cartier conjectured that for any non commutative formal power series $\Phi$ on $X=\{x_0,x_1\}$ with coefficients in a $\Q$-extension, $A$, subjected to some suitable conditions, there exists an unique algebra…

G\"odel's first and second incompleteness theorems are corner stones of modern mathematics. In this article we present a new proof of these theorems for ZFC and theories containing ZFC, using Chaitin's incompleteness theorem and a very…

Let X be a smooth curve over a finite field of characteristic p, let l be a prime number different from p, and let L be an irreducible lisse l-adic sheaf on X whose determinant is of finite order. By a theorem of Lafforgue, for each prime…

We generalize Goodstein's theorem (Goodstein 1944) and Cichon's independence proof (Cichon 1983) to $\Pi^1_1-\mathrm{CA}_0$ using results from (Wilken 2026). The method is generalizable to stronger notation systems that provide unique terms…

I develop in depth the machinery of $(\mathcal L, n)$-models originally introduced by Shelah and, independently in a slightly different form by Kripke. This machinery allows fairly routine constructions of true but unprovable sentences in…

We give a constructive proof of Carpenter's Theorem due to Kadison. Unlike the original proof our approach also yields the real case of this theorem.