Related papers: On a Theorem by Bezboruah & Shepherdson

Pusey, Barrett, and Rudolph introduce a new no-go theorem for hidden-variables models of quantum theory. We make precise the class of models targeted and construct equivalent models that evade the theorem. The theorem requires assumptions…

We first partly develop a mathematical notion of stable consistency intended to reflect the actual consistency property of human beings. Then we give a generalization of the first and second G\"odel incompleteness theorem to stably…

We generalize the Arzel\`a-Ascoli theorem in the space of continuous maps on a compact interval with values in Euclidean N-space by providing a quantitative link between the Hausdorff measure of noncompactness in this space and a natural…

This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…

The paper presents fundamental metrical theorems for a class of continued fraction-like expansions known as $\theta$-expansions. We first prove Khinchine's Weak Law of Large Numbers for the sum of digits, followed by the Diamond-Vaaler…

Roussel and Rubio proved a lemma which is essential in the proof of the Strong Perfect Graph Theorem. We give a new short proof of the main case of this lemma. In this note, we also give a short proof of Hayward's decomposition theorem for…

We study quantitative versions of the Schur property and weak sequential completeness, proceeding thus with investigations started by G. Godefroy, N. Kalton and D. Li and continued by H. Pfitzner and the authors. We show that the Schur…

It was shown by Visser that Peano Arithmetic has the property that any two bi-interpretable extensions of it (in the same language) are equivalent. Enayat proposed to refer to this property of a theory as tightness and to carry out a more…

We present, in detail and with a modern rigor, the two title proofs. The Weak Jordan Theorem (WJT) states that the complement of any topological circuit in the plane is disconnected.

We prove that the class of all ordinals Ord is not weakly compact with respect to definable classes. Specifically, in any model of ZFC, the definable tree property fails for Ord, in that there is a definable Ord tree with no definable…

In this work we prove the undecidability (and $\Sigma^0_1$-completeness) of several theories of semirings with fixed points. The generality of our results stems from recursion theoretic methods, namely the technique of effective…

Let $\operatorname{Con}(\mathbf T)\!\restriction\!x$ denote the finite consistency statement "there are no proofs of contradiction in $\mathbf T$ with $\leq x$ symbols". For a large class of natural theories $\mathbf T$, Pudl\'ak has shown…

In this paper we prove that no consistent finitely axiomatized theory one-dimensionally interprets its own extension with predicative comprehension. This constitutes a result with the flavor of the Second Incompleteness Theorem whose…

We give a criterion for the weak convergence of unit Borel measures on the N-dimensional Berkovich projective space over a complete non-archimedean field. As an application, we give a sufficient condition for equidistribution in terms of a…

We study the effective versions of several notions related to incompleteness, undecidability and inseparability along the lines of Pour-El's insights. Firstly, we strengthen Pour-El's theorem on the equivalence between effective essential…

A proof of G\"odel's incompleteness theorem is given. With this new proof a transfinite extension of G\"odel's theorem is considered. It is shown that if one assumes the set theory ZFC on the meta level as well as on the object level, a…

We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…

There is no recursively enumerable sequence of sufficiently strong 2-consistent r.e. theories such that each proves the $2$-consistency of the next. Montalb\'an and Shavrukov independently asked whether this result generalizes to…

We prove the following version of the first incompleteness theorem that simultaneously strengthens Mostowski's theorem and Vaught's theorem: For any c.e. family $\{ T_i \}_{i \in \omega}$ of consistent extensions of Tarski, Mostowski and…

We show that Nash-Williams' theorem asserting that the countable transfinite sequences of elements of a better-quasi-ordering ordered by embeddability form a better-quasi-ordering is provable in the subsystem of second order arithmetic…