Theorems of hyperarithmetic analysis occupy an unusual neighborhood in the realms of reverse mathematics and recursion-theoretic complexity. They lie above all the fixed iterations of the Turing jump but below ATR $_{0}$. There is a long history of proof-theoretic principles which are THAs. Until the papers reported on in this communication, there was only one mathematical example. Barnes, Goh, and Shore [1] analyze an array of ubiquity theorems in graph theory descended from Halin’s [9] work on rays in (...) graphs. They seem to be typical applications of ACA $_{0}$ but are actually THAs. These results answer Question 30 of Montalbán’s Open Questions in Reverse Mathematics [19] and supply several other natural principles of different and unusual levels of complexity.This work led in [25] to a new neighborhood of the reverse mathematical zoo: almost theorems of hyperarithmetic analysis. When combined with ACA $_{0}$ they are THAs but on their own are very weak. Denizens both mathematical and logical are provided. Generalizations of several conservativity classes are defined and these ATHAs as well as many other principles are shown to be conservative over RCA $_{0}$ in all these senses and weak in other recursion-theoretic ways as well. These results answer a question raised by Hirschfeldt and reported in [19] by providing a long list of pairs of principles one of which is very weak over RCA $_{0}$ but over ACA $_{0}$ is equivalent to the other which may be strong or very strong going up a standard hierarchy and at the end being stronger than full second-order arithmetic. (shrink)

Theorems of hyperarithmetic analysis (THAs) occupy an unusual neighborhood in the realms of reverse mathematics and recursion theoretic complexity. They lie above all the fixed (recursive) iterations of the Turing Jump but below ATR $_{0}$ (and so $\Pi _{1}^{1}$ -CA $_{0}$ or the hyperjump). There is a long history of proof theoretic principles which are THAs. Until Barnes, Goh, and Shore [ta] revealed an array of theorems in graph theory living in this neighborhood, there was only one mathematical (...) denizen. In this paper we introduce a new neighborhood of theorems which are almost theorems of hyperarithmetic analysis (ATHAs). When combined with ACA $_{0}$ they are THAs but on their own they are very weak. We generalize several conservativity classes ( $\Pi _{1}^{1}$, r- $\Pi _{2}^{1}$, and Tanaka) and show that all our examples (and many others) are conservative over RCA $_{0}$ in all these senses and weak in other recursion theoretic ways as well. We provide denizens, both mathematical and logical. These results answer a question raised by Hirschfeldt and reported in Montalbán [2011] by providing a long list of pairs of principles one of which is very weak over RCA $_{0}$ but over ACA $_{0}$ is equivalent to the other which may be strong (THA) or very strong going up a standard hierarchy and at the end being stronger than full second order arithmetic. (shrink)

A statement of hyperarithmetic analysis is a sentence of second order arithmetic S such that for every Y⊆ω, the minimum ω-model containing Y of RCA0 + S is HYP, the ω-model consisting of the sets hyperarithmetic in Y. We provide an example of a mathematical theorem which is a statement of hyperarithmetic analysis. This statement, that we call INDEC, is due to Jullien [13]. To the author's knowledge, no other already published, purely mathematical statement (...) has been found with this property until now. We also prove that, over RCA0, INDEC is implied by [Formula: see text] and implies ACA0, but of course, neither ACA0, nor ACA 0+ imply it. We introduce five other statements of hyperarithmetic analysis and study the relations among them. Four of them are related to finitely-terminating games. The fifth one, related to iterations of the Turing jump, is strictly weaker than all the other statements that we study in this paper, as we prove using Steel's method of forcing with tagged trees. (shrink)

Halin in 1965 proved that if a graph has [Formula: see text] many pairwise disjoint rays for each [Formula: see text] then it has infinitely many pairwise disjoint rays. We analyze the complexity of this and other similar results in terms of computable and proof theoretic complexity. The statement of Halin’s theorem and the construction proving it seem very much like standard versions of compactness arguments such as König’s Lemma. Those results, while not computable, are relatively simple. They only (...) use arithmetic procedures or, equivalently, finitely many iterations of the Turing jump. We show that several Halin-type theorems are much more complicated. They are among the theorems of hyperarithmetic analysis. Such theorems imply the ability to iterate the Turing jump along any computable well ordering. Several important logical principles in this class have been extensively studied beginning with work of Kreisel, H. Friedman, Steel and others in the 1960s and 1970s. Until now, only one purely mathematical example was known. Our work provides many more and so answers Question 30 of Montalbán’s Open Questions in Reverse Mathematics in 2011. Some of these theorems including ones in Halin in 1965 are also shown to have unusual proof theoretic strength as well. (shrink)

Jullien's indecomposability theorem states that if a scattered countable linear order is indecomposable, then it is either indecomposable to the left, or indecomposable to the right. The theorem was shown by Montalbán to be a theorem of hyperarithmetic analysis. We identify the strength of the theorem relative to standard reverse mathematics markers. We show that it lies strictly between weak [Formula: see text] choice and [Formula: see text] comprehension.

Solovay has shown that if F: [ω] ω → 2 is a clopen partition with recursive code, then there is an infinite homogeneous hyperarithmetic set for the partition (a basis result). Simpson has shown that for every 0 α , where α is a recursive ordinal, there is a clopen partition F: [ω] ω → 2 such that every infinite homogeneous set is Turing above 0 α (an anti-basis result). Here we refine these results, by associating the "order type" (...) of a clopen set with the Turing complexity of the infinite homogeneous sets. We also consider the Nash-Williams barrier theorem and its relation to the clopen Ramsey theorem. (shrink)

Jullien's indecomposability theorem (INDEC) states that if a scattered countable linear order is indecomposable, then it is either indecomposable to the left, or indecomposable to the right. The theorem was shown by Montalbán to be a theorem of hyperarithmetic analysis, and then, in the base system RCA₀ plus ${\mathrm{\Sigma }}_{1}^{1}\text{\hspace{0.17em}}$ induction, it was shown by Neeman to have strength strictly between weak ${\mathrm{\Sigma }}_{1}^{1}$ choice and ${\mathrm{\Delta }}_{1}^{1}$ comprehension. We prove in this paper that ${\mathrm{\Sigma (...) }}_{1}^{1}$ induction is needed for the reversal of INDEC, that is for the proof that INDEC implies weak ${\mathrm{\Sigma }}_{1}^{1}$ choice. This is in contrast with the typical situation in reverse mathematics, where reversals can usually be refined to use only ${\mathrm{\Sigma }}_{1}^{0}$ induction. (shrink)

This paper provides a philosophical analysis of the ongoing controversy surrounding R.A. Fisher's famous ‘fundamental theorem’ of natural selection. The difference between the ‘traditional’ and ‘modern’ interpretations of the theorem is explained. I argue that proponents of the modern interpretation have captured Fisher's intended meaning correctly and shown that the theorem is mathematically correct, pace the traditional consensus. However, whether the theorem has any real biological significance remains an unresolved issue. I argue that the answer (...) depends on whether we accept Fisher's non-standard notion of environmental change, on which the theorem rests; arguments for and against this notion are explored. I suggest that there is a close link between Fisher's fundamental theorem and the modern ‘gene's eye’ view of evolution. Introduction What Does the Fundamental Theorem Say? Key Concepts Explained Alleged Significance of the FTNS Traditional versus Modern Interpretations of the FTNS The Modern Interpretation Illustrated Fisher's Concept of ‘Environmental Change’ Causality and the Modern Interpretation The Significance of the FTNS Re-considered Appendix CiteULike Connotea Del.icio.us What's this? (shrink)

In their logical analysis of theorems about disjoint rays in graphs, Barnes, Shore, and the author (hereafter BGS) introduced a weak choice scheme in second-order arithmetic, called the $\Sigma ^1_1$ axiom of finite choice (hereafter finite choice). This is a special case of the $\Sigma ^1_1$ axiom of choice ( $\Sigma ^1_1\text {-}\mathsf {AC}_0$ ) introduced by Kreisel. BGS showed that $\Sigma ^1_1\text {-}\mathsf {AC}_0$ suffices for proving many of the aforementioned theorems in graph theory. While it is not (...) known if these implications reverse, BGS also showed that those theorems imply finite choice (in some cases, with additional induction assumptions). This motivated us to study the proof-theoretic strength of finite choice. Using a variant of Steel forcing with tagged trees, we show that finite choice is not provable from the $\Delta ^1_1$ -comprehension scheme (even over $\omega $ -models). We also show that finite choice is a consequence of the arithmetic Bolzano–Weierstrass theorem (introduced by Friedman and studied by Conidis), assuming $\Sigma ^1_1$ -induction. Our results were used by BGS to show that several theorems in graph theory cannot be proved using $\Delta ^1_1$ -comprehension. Our results also strengthen results of Conidis. (shrink)

We say that a linear ordering is extendible if every partial ordering that does not embed can be extended to a linear ordering which does not embed either. Jullien’s theorem is a complete classification of the countable extendible linear orderings. Fraïssé’s conjecture, which is actually a theorem, is the statement that says that the class of countable linear ordering, quasiordered by the relation of embeddability, contains no infinite descending chain and no infinite antichain. In this paper we study (...) the strength of these two theorems from the viewpoint of Reverse Mathematics and Effective Mathematics. As a result of our analysis we get that they are equivalent over the basic system of .We also prove that Fraïssé’s conjecture is equivalent, over , to two other interesting statements. One that says that the class of well founded labeled trees, with labels from {+,−}, and with a very natural order relation, is well quasiordered. The other statement says that every linear ordering which does not contain a copy of the rationals is equimorphic to a finite sum of indecomposable linear orderings.While studying the proof theoretic strength of Jullien’s theorem, we prove the extendibility of many linear orderings, including ω2 and η, using just . Moreover, for all these linear orderings, , we prove that any partial ordering, , which does not embed has a linearization, hyperarithmetic in , which does not embed. (shrink)

We present an analogue of Gödel’s second incompleteness theorem for systems of second-order arithmetic. Whereas Gödel showed that sufficiently strong theories that are $\Pi ^0_1$ -sound and $\Sigma ^0_1$ -definable do not prove their own $\Pi ^0_1$ -soundness, we prove that sufficiently strong theories that are $\Pi ^1_1$ -sound and $\Sigma ^1_1$ -definable do not prove their own $\Pi ^1_1$ -soundness. Our proof does not involve the construction of a self-referential sentence but rather relies on ordinal analysis.

We characterize the completely determined Borel subsets of HYP as exactly the [Formula: see text] subsets of HYP. As a result, HYP believes there is a Borel well-ordering of the reals, that the Borel Dual Ramsey Theorem fails, and that every Borel d-regular bipartite graph has a Borel perfect matching, among other examples. Therefore, the Borel Dual Ramsey Theorem and several theorems of descriptive combinatorics are not theories of hyperarithmetic analysis. In the case of the Borel (...) Dual Ramsey Theorem, this answers a question of Astor, Dzhafarov, Montalbán, Solomon and the third author. (shrink)

In this paper I argue that Feferman's theorem does not signify the existence of skeptic-satisfying consistency proofs. However, my argument for this is much different than other arguments (most particularly Resnik's) for the same claim. The argument that I give arises form an analysis of the notion of 'expression', according to which the specific character of that notion is seen as varying from one context of application (of a result of arithmetic metamathematics) to another.

This paper is a commentary on the focal article by Grafen and on earlier papers of his on which many of the results of this focal paper depend. Thus it is in effect a commentary on the “formal Darwinian project”, the focus of this sequence of papers. Several problems with this sequence are raised and discussed. The first of these concerns fitness maximization. It is often claimed in these papers that natural selection leads to a maximization of fitness and that (...) this view is claimed in Fisher’s “fundamental theorem of natural selection”. These claims are refuted, and various incorrect statements about the meaning and interpretation of the fundamental theorem of natural selection, in this sequence and in other papers by other authors, are discussed. Next, much of the work in this sequence rests on the first Price equation. In the deterministic (infinite population) case this equation is no more than the standard classical equation relating to changes in gene frequencies. In the stochastic case the equation gives the change in gene frequencies as the sum of two terms (the second of which vanishes in the deterministic case). These two terms are of essentially equal importance in the situation considered in the focal article, yet one of Grafen’s results ignores the second term in the stochastic analysis. This is associated with a wavering between deterministic and stochastic analyses and the use of the Price fitness concept and the classical fitness concept. These comments cast doubts on Grafen’s optimization theory. (shrink)

Although skeptical of the prohibitive power of no-hidden-variables theorems, John Bell was himself responsible for the two most important ones. I describe some recent versions of the lesser known of the two (familiar to experts as the "Kochen-Specker theorem") which have transparently simple proofs. One of the new versions can be converted without additional analysis into a powerful form of the very much better known "Bell's Theorem," thereby clarifying the conceptual link between these two results of Bell.

A previously unexplored method, combining logical and mathematical elements, is shown to yield substantial numerical improvements in the area of Diophantine approximations. Kreisel illustrated the method abstractly by noting that effective bounds on the number of elements are ensured if Herbrand terms from ineffective proofs ofΣ2-finiteness theorems satisfy certain simple growth conditions. Here several efficient growth conditions for the same purpose are presented that are actually satisfied in practice, in particular, by the proofs of Roth's theorem due to Roth (...) himself and to Esnault and Viehweg. The analysis of the former yields an exponential bound of order exp in place of exp given by Davenport and Roth in 1955, whereαis algebraic of degreed≥ 2 and ∣α−pq−1∣ shrink)

Greenberger. Horne. Shimony, and Zeilinger gave a new version of the Bell theorem without using inequalities (probabilities). Mermin summarized it concisely; but Bohm and Hiley criticized Mermin's proof from contextualists' point of view. Using the branching space-time language, in this paper a proof will be given that is free of these difficulties. At the same time we will also clarify the limits of the validity of the theorem when it is taken as a proof that quantum mechanics is (...) not compatible with a deterministic world nor with a world that permits correlated space-related events without a common cause. (shrink)

H.P. Stapp has proposed a number of demonstrations of a Bell-type theorem which dispensed with an assumption of hidden variables, but relied only upon locality together with an assumption that experimenters can choose freely which of several incompatible observables to measure. In recent papers his strategy has centered upon counterfactual conditionals. Stapp’s paper in American Journal of Physics, 2004, replies to objections raised against earlier expositions of this strategy and proposes a simplified demonstration. The new demonstration is criticized, several (...) subtleties in the logic of counterfactuals are pointed out, and the proofs of J.S. Bell and his followers are advocated. (shrink)

Ordinal analysis is a research program wherein recursive ordinals are assigned to axiomatic theories. According to conventional wisdom, ordinal analysis measures the strength of theories. Yet what is the attendant notion of strength? In this paper we present abstract characterizations of ordinal analysis that address this question. -/- First, we characterize ordinal analysis as a partition of $\Sigma^1_1$-definable and $\Pi^1_1$-sound theories, namely, the partition whereby two theories are equivalent if they have the same proof-theoretic ordinal. We (...) show that no equivalence relation $\equiv$ is finer than the ordinal analysis partition if both: (1) $T\equiv U$ whenever $T$ and $U$ prove the same $\Pi^1_1$ sentences; (2) $T\equiv T+U$ for every set $U$ of true $\Sigma^1_1$ sentences. In fact, no such equivalence relation makes a single distinction that the ordinal analysis partition does not make. -/- Second, we characterize ordinal analysis as an ordering on arithmetically-definable and $\Pi^1_1$-sound theories, namely, the ordering wherein $T\leq U$ if the proof-theoretic ordinal of $T$ is less than or equal to the proof-theoretic ordinal of $U$. The standard ways of measuring the strength of theories are consistency strength and inclusion of $\Pi^0_1$ theorems. We introduce analogues of these notions---$\Pi^1_1$-reflection strength and inclusion of $\Pi^1_1$ theorems---in the presence of an oracle for $\Sigma^1_1$ truths, and prove that they coincide with the ordering induced by ordinal analysis. (shrink)

We analyse the extent of possible computations following Hogarth ([2004]) conducted in Malament–Hogarth (MH) spacetimes, and Etesi and Németi ([2002]) in the special subclass containing rotating Kerr black holes. Hogarth ([1994]) had shown that any arithmetic statement could be resolved in a suitable MH spacetime. Etesi and Németi ([2002]) had shown that some relations on natural numbers that are neither universal nor co-universal, can be decided in Kerr spacetimes, and had asked specifically as to the extent of computational limits there. (...) The purpose of this note is to address this question, and further show that MH spacetimes can compute far beyond the arithmetic: effectively Borel statements (so hyperarithmetic in second-order number theory, or the structure of analysis) can likewise be resolved: Theorem A. If H is any hyperarithmetic predicate on integers, then there is an MH spacetime in which any query ? n H ? can be computed. In one sense this is best possible, as there is an upper bound to computational ability in any spacetime, which is thus a universal constant of that spacetime. Theorem C. Assuming the (modest and standard) requirement that spacetime manifolds be paracompact and Hausdorff, for any spacetime there will be a countable ordinal upper bound, , on the complexity of questions in the Borel hierarchy computable in it. Introduction 1.1 History and preliminaries Hyperarithmetic Computations in MH Spacetimes 2.1 Generalising SADn regions 2.2 The complexity of questions decidable in Kerr spacetimes An Upper Bound on Computational Complexity for Each Spacetime CiteULike Connotea Del.icio.us What's this? (shrink)

We show that the full set of Fierz identities which are used to compute electro-weak interactions reported by Y. Takahashi can be considered as particular cases of the Clifford product between multivector Cartan maps. Moreover, we think that our approach can be generalized to higher-dimensional models.We discuss the factorization and inversion theorems for the recovery of the spinor from its multivectorial Cartan map.A new classification given by P. Lounesto is applied to the recovered spinors for Cl1,3 space-time symmetry and SU(2)×U(1) (...) isotopic group. (shrink)

Kohlenbach's proof mining program deals with the extraction of effective information from typically ineffective proofs. Proof mining has its roots in Kreisel's pioneering work on the so-called unwinding of proofs. The proof mining of classical mathematics is rather restricted in scope due to the existence of sentences without computational content which are provable from the law of excluded middle and which involve only two quantifier alternations. By contrast, we show that the proof mining of classical Nonstandard Analysis has a (...) very large scope. In particular, we will observe that this scope includes any theorem of pure Nonstandard Analysis, where 'pure' means that only nonstandard definitions are used. In this note, we survey results in analysis, computability theory, and Reverse Mathematics. (shrink)

This article sets up a graph-theoretical framework for argumentation-analysis (dialectical analysis) which expands classical argument-analysis. Within this framework, a main theorem on the existence of inconsistencies in debates is stated and proved: the vicious circle theorem. Subsequently, two corollaries which generalize the main theorem are derived. Finally, a brief outlook is given on further expansions and possible applications of the developed framework.

This article contributes to the revision of the procedure of robustness analysis of mathematical models in epistemic democracy using the systematic review method. It identifies the drawbacks of robustness analysis in epistemic democracy in terms of sample universality and inference from samples with the same results. To exemplify the effectiveness of systematic review, this article conducted a pilot review of diversity trumps ability theorem models, which are mathematical models of deliberation often cited by epistemic democrats. A review (...) of nine models extracted from 352 papers exemplifies the effectiveness of robustness analysis supplemented by systematic review in epistemic democracy. (shrink)

SummaryIn 1693, Gottfried Wilhelm Leibniz published in the Acta Eruditorum a geometrical proof of the fundamental theorem of the calculus. It is shown that this proof closely resembles Isaac Barrow's proof in Proposition 11, Lecture 10, of his Lectiones Geometricae, published in 1670. This comparison provides evidence that Leibniz gained substantial help from Barrow's book in formulating and presenting his geometrical formulation of this theorem. The analysis herein also supports the work of J. M. Child, who in (...) 1920 studied the early manuscripts of Leibniz and concluded that he had frequently copied his diagrams from Barrow's book, but without acknowledgement. It is also shown that the diagram of Leibniz associated with his 1693 proof has often been reproduced with errors that make some aspects of his text difficult to comprehend. (shrink)

Reverse analyses of three proofs of the Sylvester-Gallai theorem lead to three different and incompatible axiom systems. In particular, we show that proofs respecting the purity of the method, using only notions considered to be part of the statement of the theorem to be proved, are not always the simplest, as they may require axioms which proofs using extraneous predicates do not rely upon.

Stability definitions for describing human behavior under conflict when coalitions may form are generalized within the Graph Model for Conflict Resolution and algebraic formulations of these definitions are provided to allow computer implementation. The more general definitions of coalitional stabilities relax the assumption of transitive graphs capturing movements under the control of decision makers, either independently or cooperatively, and allow the convenient expansion to the case of coalitions of the four basic individual stabilities consisting of Nash stability, general metarationality, symmetric (...) metarationality, and sequential stability. To permit the various coalitional stabilities to be efficiently calculated and conveniently encoded within a decision support system, algebraic expressions for the coalitional stabilities are provided in this research. Furthermore, a range of the theorems establish the mathematical credibility of employing the innovative algebraic approach to conflict resolution when coalitions are present. Finally, a conflict over the proposed exportation of bulk water from Lake Gisborne within the Canadian Province of Newfoundland and Labrador is modelled and analyzed to illustrate the practical application of the different coalitional stabilities and the strategic insights they provide. (shrink)

A Husserlian phenomenological approach to logic treats concepts in terms of their experiential meaning rather than in terms of reference, sets of individuals, and sentences. The present article applies such an approach in turn to the reasoning operative in various paradoxes: the simple Liar, the complex Liar paradoxes, the Grelling-type paradoxes, and Gödel’s Theorem. It finds that in each case a meaningless statement, one generated by circular definition, is treated as if were meaningful, and consequently as either true or (...) false, although in fact it is neither. The situation is further complicated by the fact that the sentence used to express the meaningless statement is ambiguous, and may also be used to express a meaningful statement. The paradoxes result from a failure to distinguish between the two meanings the sentence may have. (shrink)

In treatises or advanced textbooks on theoretical physics, it is apparent that the way mathematics is used is very different from what is to be found in books of mathematics. There is, for example, no close connection between books on analysis, on the one hand, and any classical textbook in quantum mechanics, for example, Schiff, [11], or quite recent books, for example Ryder, [10], on quantum field theory. The differences run a good deal deeper than the fact that the (...) books on theoretical physics are not written in the definition-theorem-proof style characteristic of pure mathematics. Although a good many propositions are proved in the books on physics, there are almost with exception no existential proofs, and consequently there is no really serious systematic use of quantifiers. Another important characteristic is the free use of infinitesimals. In fact, most results would not lose anything, from a physicist's point of view, by leaving them in approximate form, i.e., instead of strict equalities or inequalities, using equalities or inequalities only up to an infinitesimal.The discrepancy between the way mathematics is ordinarily done in theoretical physics and the way it is built up from a foundational standpoint in any of the standard modern views raises the question of whether it might be possible to construct quite directly a rigorous foundation that reflects a significant part of this standard practice in theoretical physics. Other parts of standard practice in physics, for example, the use of physically intuitive but nonrigorous arguments, are not present in our system. (shrink)

A recent no-go theorem (Frauchiger and Renner in Nat Commun 9(1):3711, 2018) establishes a contradiction from a specific application of quantum theory to a multi- agent setting. The proof of this theorem relies heavily on notions such as ‘knows’ or ‘is certain that’. This has stimulated an analysis of the theorem by Nurgalieva and del Rio (in: Selinger P, Chiribella G (eds) Proceedings of the 15th international conference on quantum physics and logic (QPL 2018). EPTCS 287, (...) Open Publishing Association, Waterloo, 2018), in which they claim that it shows the “[i]nadequacy of modal logic in quantum settings” (ibid.). In this paper, we will offer a significantly extended and refined reconstruction of the theorem in multi-agent modal logic. We will then show that a thorough reconstruction of the proof as given by Frauchiger and Renner requires the reflexivity of access relations (system T). However, a stronger theorem is possible that already follows in serial frames, and hence also holds in systems of doxastic logic (such as KD45). After proving this, we will discuss the general implications for different interpretations of quantum probabilities as well as several options for dealing with the result. (shrink)

ABSTRACT This paper reports on an empirical performance analysis of four modal theorem provers on benchmark suites of randomly generated formulae. The theorem provers tested are the Davis-Putnam-based procedure KSAT, the tableaux-based system KRZIS, the sequent-based Logics Workbench, and a translation approach combined with the first-order theorem prover SPASS. Our benchmark suites are sets of multi-modal formulae in a certain normal form randomly generated according to the scheme of Giunchiglia and Sebastiani [GS 96a, GS 96b]. We (...) investigate the quality of the random modal formulae and show that the scheme has some shortcomings, which may lead to mistaken conclusions. We propose improvements to the evaluation method and show that the translation approach provides a viable alternative to the other approaches. (shrink)

This article presents a weak system of intuitionistic second-order arithmetic, WKV, a subsystem of the one in S.C. Kleene, R.E. Vesley [The Foundations of Intuitionistic Mathematics: Especially in Relation to Recursive Functions, North-Holland Publishing Company, Amsterdam, 1965]. It is then shown that some statements of real analysis, like a version of the Heine–Borel Theorem, and some statements of logic, e.g. compactness of classical proposition calculus, are equivalent to the Fan Theorem in this system.

Many existence propositions in constructive analysis are implied by the lesser limited principle of omniscience LLPO; sometimes one can even show equivalence. It was discovered recently that some existence propositions are equivalent to Bouwer's fan theorem FAN if one additionally assumes that there exists at most one object with the desired property. We are providing a list of conditions being equivalent to FAN, such as a unique version of weak König's lemma. This illuminates the relation between FAN and (...) LLPO. Furthermore, we give a short and elementary proof of the fact that FAN is equivalent to each positive valued function with compact domain having positive infimum. (shrink)

The prime number theorem, established by Hadamard and de la Vallée Poussin independently in 1896, asserts that the density of primes in the positive integers is asymptotic to 1/ln x. Whereas their proofs made serious use of the methods of complex analysis, elementary proofs were provided by Selberg and Erdos in 1948. We describe a formally verified version of Selberg's proof, obtained using the Isabelle proof assistant.

The hidden-variable theorems of Bell and followers depend upon an assumption, namely the hidden-variable assumption, that conflicts with the precepts of quantum philosophy. Hence from an orthodox quantum perspective those theorems entail no faster-than-light transfer of information. They merely reinforce the ban on hidden variables. The need for some sort of faster-than-light information transfer can be shown by using counterfactuals instead of hidden variables. Shimony’s criticism of that argument fails to take into account the distinction between no-faster-than-light connection in one (...) direction and that same condition in both directions. The argument can be cleanly formulated within the framework of a fixed past, open future interpretation of quantum theory, which neatly accommodates the critical assumptions that the experimenters are free to choose which experiments they will perform. The assumptions are compatible with the Tomonaga–Schwinger formulation of quantum field theory, and hence with orthodox quantum precepts, and with the relativistic requirement that no prediction pertaining to an outcome in one region can depend upon a free choice made in a region spacelike-separated from the first. (shrink)