Related papers: On a Theorem by Bezboruah & Shepherdson
We prove a compactness theorem for pseudopower operations of the form $pp_{\Gamma(\mu,\sigma)}(\mu)$ where $\aleph_0<\sigma=cf(\sigma)\leq cf(\mu)$. Our main tool is a result that has Shelah's cov vs. pp Theorem as a consequence. We also…
We study the classes of filters F on N such that the weak and strong F-convergence of sequences in l1 coincide. We study also an analogue of l1 weak sequential completeness theorem for filter convergence.
Cummings, Foreman, and Magidor proved that Jensen's square principle is non-compact at $\aleph_\omega$, meaning that it is consistent that $\square_{\aleph_n}$ holds for all $n<\omega$ while $\square_{\aleph_\omega}$ fails. We investigate…
Ben-Israel and Vaidman (Found Phys (2017). doi:10.1007/s10701-017-0071-x) have raised objections to my arguments that there are cases where a quantum mechanical weak value can be said not to represent the system to which it pertains. They…
The Larson-Sweedler theorem says that a finite-dimensional bialgebra with a faithful integral is a Hopf algebra. The result has been generalized to finite-dimensional weak Hopf algebras by Vecserny\'es. In this paper, we show that the…
In this comment on the paper by F. Kaneda, S.-Y. Baek, M. Ozawa and K. Edamatsu [Phys. Rev. Lett. 112, 020402, 2014, arXiv:1308.5868], we point out that the claim of having refuted Heisenberg's error-disturbance relation is unfounded since…
In this paper, we provide a fairly general self-reference-free proof of the Second Incompleteness Theorem from Tarski's Theorem of the Undefinability of Truth.
A rather easy yet rigorous proof of a version of G\"odel's first incompleteness theorem is presented. The version is "each recursively enumerable theory of natural numbers with 0, 1, +, *, =, logical and, logical not, and the universal…
We indicate that an argument of da Costa and Doria in fact proves P=NP. This observation makes their argument appear dubious. We isolate a weak version of one of their lemmas which would already prove P=NP. We point out that even this weak…
We show how one can obtain solutions to the Arzel\`a-Ascoli theorem using suitable applications of the Bolzano-Weierstra{\ss} principle. With this, we can apply the results from \cite{aK} and obtain a classification of the strength of…
An ultimate universal theory -- a complete theory that accounts, via few and simple first principles, for all the phenomena already observed and that will ever be observed -- has been, and still is, the aspiration of most physicists and…
We present a new manifestation of G\"odel's second incompleteness theorem and discuss its foundational significance, in particular with respect to Hilbert's program. Specifically, we consider a proper extension of Peano arithmetic…
This work presents theorems which state (i) Z is a proper subset for any bijection f between A and Z, where Z is contained in P(A), A is a non-finite set and |Z|=|A|, and (ii) being Z a proper subset of P(A) nothing affirms or denies that…
We show weak* in measures on $\bar\O$/ weak-$L^1$ sequential continuity of $u\mapsto f(x,\nabla u):W^{1,p}(\O;\R^m)\to L^1(\O)$, where $f(x,\cdot)$ is a null Lagrangian for $x\in\O$, it is a null Lagrangian at the boundary for…
We develop the abstract framework for a proof-theoretic analysis of theories with scope beyond ordinal numbers, resulting in an analog of Ordinal Analysis aimed at the study of theorems of complexity $\Pi^1_2$. This is done by replacing the…
In this paper, we prove first that the iterates of a mean nonexpansive map defined on a weakly compact, convex set converge weakly to a fixed point in the presence of Opial's property and asymptotic regularity at a point. Next, we prove the…
Incomputability results in Formal Logic and the Theory of Computation (i.e., incompleteness and undecidability) have deep implications for the foundations of mathematics and computer science. Likewise, Social Choice Theory, a branch of…
This article describes a Turing machine which can solve for $\beta^{'}$ which is RE-complete. RE-complete problems are proven to be undecidable by Turing's accepted proof on the Entscheidungsproblem. Thus, constructing a machine which…
In the following paper we propose a model-theoretical way of comparing the "strength" of various truth theories which are conservative over PA. Let $\mathfrak{Th}$ denote the class of models of PA which admit an expansion to a model of…
Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert and Stephan initiated the search for complexity-theoretic analogs of Rice's Theorem. In particular, they proved that…