We prove the following version of Hechler's classical theorem: For each partially ordered set (Q, ≤) with the property that every countable subset of Q has a strict upper bound in Q, there is a ccc forcing notion such that in the generic extension for each tall analytic P-ideal J (coded in the ground model) a cofinal subset of (J, ⊆*) is order isomorphic to (Q, ≤).

We prove the following theorem: For a partially ordered set Q such that every countable subset of Q has a strict upper bound, there is a forcing notion satisfying the countable chain condition such that, in the forcing extension, there is a basis of the null ideal of the real line which is order-isomorphic to Q with respect to set-inclusion. This is a variation of Hechler’s classical result in the theory of forcing. The corresponding theorem for the (...) meager ideal was established by Bartoszyński and Kada. (shrink)

We give a proof of Hechler's theorem that any \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\aleph_1$\end{document}-directed partial order can be embedded via a ccc forcing notion cofinally into \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\omega^\omega$\end{document} ordered by eventual dominance. The proof relies on the standard forcing relation rather than the variant introduced by Hechler.

It is shown that cardinals below a real-valued measurable cardinal can be split into finitely many intervals so that the powers of cardinals from the same interval are the same. This generalizes a theorem of Prikry [9]. Suppose that the forcing with a κ-complete ideal over κ is isomorphic to the forcing of λ-Cohen or random reals. Then for some τ<κ, λτ2κ and λ2<κ implies that 2κ=2τ= cov. In particular, if 2κ<κ+ω, then λ=2κ. This answers a question from [3]. (...) If A0, A1,..., An,… are sets of reals, then there are disjoint sets B0, B1,..., Bn,… such that BnAn and μ*=μ* for every n<ω, where μ* is the Lebes gue outer measure. For finitely many sets the result is due to N. Lusin. Let be a σ-centered forcing notion and An ¦n<ω subsets of P witnessing this. If P, An's and the relation of compatibility are Borel, then P adds a Cohen real. The forcing with a κ-complete ideal over a set X, ¦X¦κ cannot be isomorphic to a Hechler real forcing. This result was claimed in [3], but the proof given there works only for X of cardinality κ. (shrink)

Bell’s theorem admits several interpretations or ‘solutions’, the standard interpretation being ‘indeterminism’, a next one ‘nonlocality’. In this article two further solutions are investigated, termed here ‘superdeterminism’ and ‘supercorrelation’. The former is especially interesting for philosophical reasons, if only because it is always rejected on the basis of extra-physical arguments. The latter, supercorrelation, will be studied here by investigating model systems that can mimic it, namely spin lattices. It is shown that in these systems the Bell inequality can be (...) violated, even if they are local according to usual definitions. Violation of the Bell inequality is retraced to violation of ‘measurement independence’. These results emphasize the importance of studying the premises of the Bell inequality in realistic systems. (shrink)

Gleason's theorem for ������³ says that if f is a nonnegative function on the unit sphere with the property that f(x) + f(y) + f(z) is a fixed constant for each triple x, y, z of mutually orthogonal unit vectors, then f is a quadratic form. We examine the issues raised by discussions in this journal regarding the possibility of a constructive proof of Gleason's theorem in light of the recent publication of such a proof.

Historically, Ehrenfest’s theorem is the first one which shows that classical physics can emerge from quantum physics as a kind of approximation. We recall the theorem in its original form, and we highlight its generalizations to the relativistic Dirac particle and to a particle with spin and izospin. We argue that apparent classicality of the macroscopic world can probably be explained within the framework of standard quantum mechanics.

The paper considers the claim that quantum theories with a deterministic dynamics of objects in ordinary space-time, such as Bohmian mechanics, contradict the assumption that the measurement settings can be freely chosen in the EPR experiment. That assumption is one of the premises of Bell’s theorem. I first argue that only a premise to the effect that what determines the choice of the measurement settings is independent of what determines the past state of the measured system is needed for (...) the derivation of Bell’s theorem. Determinism as such does not undermine that independence . Only entanglement could do so. However, generic entanglement without collapse on the level of the universal wave-function can go together with effective wave-functions for subsystems of the universe, as in Bohmian mechanics. The paper argues that such effective wave-functions are sufficient for the mentioned independence premise to hold. (shrink)

This paper addresses the strength of Ramsey's theorem for pairs ($RT^2_2$) over a weak base theory from the perspective of 'proof mining'. Let $RT^{2-}_2$ denote Ramsey's theorem for pairs where the coloring is given by an explicit term involving only numeric variables. We add this principle to a weak base theory that includes weak König's Lemma and a substantial amount of $\Sigma^0_1$-induction (enough to prove the totality of all primitive recursive functions but not of all primitive recursive functionals). (...) In the resulting theory we show the extractability of primitive recursive programs and uniform bounds from proofs of $\forall\exists$-theorems. There are two components of this work. The first component is a general proof-theoretic result, due to the second author, that establishes conservation results for restricted principles of choice and comprehension over primitive recursive arithmetic PRA as well as a method for the extraction of primitive recursive bounds from proofs based on such principles. The second component is the main novelty of the paper: it is shown that a proof of Ramsey's theorem due to Erdős and Rado can be formalized using these restricted principles. So from the perspective of proof unwinding the computational content of concrete proofs based on $RT^2_2$ the computational complexity will, in most practical cases, not go beyond primitive recursive complexity. This even is the case when the theorem to be proved has function parameters f and the proof uses instances of $RT^2_2$ that are primitive recursive in f. (shrink)

We argue that Löb's Theorem implies a limitation on mechanism. Specifically, we argue, via an application of a generalized version of Löb's Theorem, that any particular device known by an observer to be mechanical cannot be used as an epistemic authority (of a particular type) by that observer: either the belief-set of such an authority is not mechanizable or, if it is, there is no identifiable formal system of which the observer can know (or truly believe) it to (...) be the theorem-set. This gives, we believe, an important and hitherto unnoticed connection between mechanism and the use of authorities by human-like epistemic agents. (shrink)

A proof of Bell’s theorem without inequalities is presented in which distant local setups do not need to be aligned, since the required perfect correlations are achieved for any local rotation of the local setups.

It was shown by Cholak, Jockusch, and Slaman that every computable 2-coloring of pairs admits an infinite low₂ homogeneous set H. We answer a question of the same authors by showing that H may be chosen to satisfy in addition $C\,\not \leqslant _T \,H$, where C is a given noncomputable set. This is shown by analyzing a new and simplified proof of Seetapun's cone avoidance theorem for Ramsey's theorem. We then extend the result to show that every computable (...) 2-coloring of pairs admits a pair of low₂ infinite homogeneous sets whose degrees form a minimal pair. (shrink)

Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated into second order arithmetic.

In his 1967 paper Vaught used an ingenious argument to show that every recursively enumerable first order theory that directly interprets the weak system VS of set theory is axiomatizable by a scheme. In this paper we establish a strengthening of Vaught's theorem by weakening the hypothesis of direct interpretability of VS to direct interpretability of the finitely axiomatized fragment VS2 of VS. This improvement significantly increases the scope of the original result, since VS is essentially undecidable, but VS2 (...) has decidable extensions. We also explore the ramifications of our work on finite axiomatizability of schemes in the presence of suitable comprehension principles. (shrink)

Arrow’s axiomatic foundation of social choice theory can be understood as an application of Tarski’s methodology of the deductive sciences—which is closely related to the latter’s foundational contribution to model theory. In this note we show in a model-theoretic framework how Arrow’s use of von Neumann and Morgenstern’s concept of winning coalitions allows to exploit the algebraic structures involved in preference aggregation; this approach entails an alternative indirect ultrafilter proof for Arrow’s dictatorship result. This link also connects Arrow’s seminal result (...) to key developments and concepts in the history of model theory, notably ultraproducts and preservation results. (shrink)

Haag’s theorem has been interpreted as establishing that quantum field theory cannot consistently represent interacting fields. Earman and Fraser have clarified how it is possible to give mathematically consistent calculations in scattering theory despite the theorem. However, their analysis does not fully address the worry raised by the result. In particular, I argue that their approach fails to be a complete explanation of why Haag’s theorem does not undermine claims about the empirical adequacy of particular quantum field (...) theories. I then show that such empirical adequacy claims are protected from Haag’s result by the techniques that are required to obtain theoretical predictions for realistic experimental observables. I conclude by showing how Haag’s theorem is illustrative of a general tension between the foundational significance of results that can be obtained in perturbation theory and non-perturbative characterizations of the content of quantum field theory. 1 Introduction2 Haag’s Theorem and the Interaction Picture3 Earman and Fraser on the Success of Scattering Theory4 Haag’s Theorem and Empirical Adequacy5 Conclusion. (shrink)

According to a recent paper by Tim Maudlin, Bell’s theorem has nothing to tell us about realism or the descriptive completeness of quantum mechanics. What it shows is that quantum mechanics is non-local, no more and no less. What I intend to do in this paper is to challenge Maudlin’s assertion about the import of Bell’s proof. There is much that I agree with in the paper; in particular, it does us the valuable service of demonstrating that Einstein’s objections (...) to quantum mechanics have nothing to do with its indeterminism. But I do think that Maudlin’s conclusion is overly cut-and-dried. Quantum mechanics is far from a unified edifice, and what Bell’s theorem shows depends on what version of quantum mechanics you look at. In particular, I’ll try to make the case that there’s an interesting, if ultimately uncompelling anti-realist construal of the import of Bell’s theorem. And I also want to suggest that locality isn’t quite as decisively defeated as Maudlin claims. (shrink)

A partition is finitary if all its members are finite. For a set A, $\mathscr {B}(A)$ denotes the set of all finitary partitions of A. It is shown consistent with $\mathsf {ZF}$ (without the axiom of choice) that there exist an infinite set A and a surjection from A onto $\mathscr {B}(A)$. On the other hand, we prove in $\mathsf {ZF}$ some theorems concerning $\mathscr {B}(A)$ for infinite sets A, among which are the following: (1) If there is a finitary (...) partition of A without singleton blocks, then there are no surjections from A onto $\mathscr {B}(A)$ and no finite-to-one functions from $\mathscr {B}(A)$ to A. (2) For all $n\in \omega $, $|A^n|<|\mathscr {B}(A)|$. (3) $|\mathscr {B}(A)|\neq |\mathrm {seq}(A)|$, where $\mathrm {seq}(A)$ is the set of all finite sequences of elements of A. (shrink)

In this short survey article, I discuss Bell’s theorem and some strategies that attempt to avoid the conclusion of non-locality. I focus on two that intersect with the philosophy of probability: (1) quantum probabilities and (2) superdeterminism. The issues they raised not only apply to a wide class of no-go theorems about quantum mechanics but are also of general philosophical interest.

In a recent paper (Okasha, Mind 120:83–115, 2011), Samir Okasha uses Arrow’s theorem to raise a challenge for the rationality of theory choice. He argues that, as soon as one accepts the plausibility of the assumptions leading to Arrow’s theorem, one is compelled to conclude that there are no adequate theory choice algorithms. Okasha offers a partial way out of this predicament by diagnosing the source of Arrow’s theorem and using his diagnosis to deploy an approach that (...) circumvents it. In this paper I explain why, although Okasha is right to emphasise that Arrow’s result is the effect of an informational problem, he is not right to locate this problem at the level of the informational input of a theory choice rule. Once the informational problem is correctly located, Arrow’s theorem may be dismissed as a problem. (shrink)

In response to recent work on the aggregation of individual judgments on logically connected propositions into collective judgments, it is often asked whether judgment aggregation is a special case of Arrowian preference aggregation. We argue for the converse claim. After proving two impossibility theorems on judgment aggregation (using "systematicity" and "independence" conditions, respectively), we construct an embedding of preference aggregation into judgment aggregation and prove Arrow’s theorem (stated for strict preferences) as a corollary of our second result. Although we (...) thereby provide a new proof of Arrow’s theorem, our main aim is to identify the analogue of Arrow’s theorem in judgment aggregation, to clarify the relation between judgment and preference aggregation, and to illustrate the generality of the judgment aggregation model. JEL Classi…cation: D70, D71.. (shrink)

We extend some results of Adam Kolany to show that large sets of satisfiable sentences generally contain equally large subsets of mutually consistent sentences. In particular, this is always true for sets of uncountable cofinality, and remains true for sets of denumerable cofinality if we put appropriate bounding conditions on the sentences. The results apply to both the propositional and the predicate calculus. To obtain these results, we use delta sets for regular cardinals, and, for singular cardinals, a generalization of (...) delta sets. All of our results are theorems in ZFC. (shrink)

Bell's theorem is expounded as an analysis in Bayesian probabilistic inference. Assume that the result of a spin measurement on a spin-1/2 particle is governed by a variable internal to the particle (local, “hidden”), and examine pairs of particles having zero combined angular momentum so that their internal variables are correlated: knowing something about the internal variable of one tells us something about that of the other. By measuring the spin of one particle, we infer something about its internal (...) variable; through the correlation, about the internal variable of the second particle, which may be arbitrarily distant and is by hypothesis unchanged by this measurement (locality); and make (probabilistic) prediction of spin observations on the second particle. Each link in this chain has a counterpart in the Bayesian analysis of the situation. Irrespective of the details of the internal variable description, such prediction is violated by measurements on many particle pairs, so that locality—effectively the only physics invoked—fails. The time ordering of the two measurements is not Lorentz-invariant, implying acausality. Quantum mechanics is irrelevant to this reasoning, although its correct predictions of the statistics of the results imply it has a nonlocal—acausal interpretation; one such, the “transactional” interpretation, is presented to demonstrable advantage, and some misconceptions about quantum theory are pursued. The “unobservability” loophole in photonic Bell experiments is proven to be closed. It is shown that this mechanism cannot be used for signalling; signalling would become possible only if the hidden variables, which we insist must underlie the statistical character of the observations (the alternative is to give up), are uncovered in deviations from quantum predictions. Their reticence is understood as a consequence of their nonlocality: it is not easy to isolate and measure something nonlocal. Once the hidden variables are found, all the problems of quantum field theory and of quantum gravity might melt away. (shrink)

Kenneth Arrow’s “impossibility” theorem—or “general possibility” theorem, as he called it—answers a very basic question in the theory of collective decision-making. Say there are some alternatives to choose among. They could be policies, public projects, candidates in an election, distributions of income and labour requirements among the members of a society, or just about anything else. There are some people whose preferences will inform this choice, and the question is: which procedures are there for deriving, from what is (...) known or can be found out about their preferences, a collective or “social” ordering of the alternatives from better to worse? The answer is startling. Arrow’s theorem says there are no such procedures whatsoever—none, anyway, that satisfy certain apparently quite reasonable assumptions concerning the autonomy of the people and the rationality of their preferences. The technical framework in which Arrow gave the question of social orderings a precise sense and its rigorous answer is now widely used for studying problems in welfare economics. The impossibility theorem itself set much of the agenda for contemporary social choice theory. Arrow accomplished this while still a graduate student. In 1972, he received the Nobel Prize in economics for his contributions. (shrink)

This paper initiates the reverse mathematics of social choice theory, studying Arrow's impossibility theorem and related results including Fishburn's possibility theorem and the Kirman–Sondermann theorem within the framework of reverse mathematics. We formalise fundamental notions of social choice theory in second-order arithmetic, yielding a definition of countable society which is tractable in RCA0. We then show that the Kirman–Sondermann analysis of social welfare functions can be carried out in RCA0. This approach yields a proof of Arrow's (...) class='Hi'>theorem in RCA0, and thus in PRA, since Arrow's theorem can be formalised as a Π01 sentence. Finally we show that Fishburn's possibility theorem for countable societies is equivalent to ACA0 over RCA0. (shrink)

G¨odel’s a theorem concerns an arithmetical statement and the truth of this statement does not depend on self-reference; nevertheless its interpretation is of tremendous interest. G¨odel’s theorem allows one to conclude that formal arithmetic is not axiomatizable. But there is another very interesting logico-philosophical result: the possibility of a statement to exist such that it is improvable in the object-theory and at the same time its truth is provable in the metatheory. It seems that in the real history (...) G¨odel’s theorem was absolutely unexpected, and even in retrospect, now it is difficult to point out logico-philosophical reasons for the above possibility. In my opinion though it was still conceivable at that time, but unfortunately the philosophers and logicians missed to notice it. In the terms of recursive arithmetic Hilbert’s programme can be formulated as follows: Build a decidable, complete, consistent logical system such that the class of derivable statements coincides with the class of the mathematical statements which are intuitively true; prove this equivalence by means of an arithmetization of the theory in the framework of the recursive arithmetic! Now, if the system is so strong as to admit the construction of the classical mathematics, then in particular it will contain the classical arithmetic. But Hilbert’s requirements reduce to a proof with the means of the recursive arithmetic, by arithmetization. So, on one hand the system will contain the arithmetic and, on the other hand it will be expressible in it, in order words the system will include its own syntax, as well as its own semantics. Now it is clear that Hilbert’s programme contains a possibility of a situation similar to some well known semantic antinomies, situations of self-reference. (shrink)

In set theory without the Axiom of Choice (), we investigate the problem of the placement of Łoś's Theorem () in the hierarchy of weak choice principles, and answer several open questions from the book Consequences of the Axiom of Choice by Howard and Rubin, as well as an open question by Brunner. We prove a number of results summarised in § 3.

In this paper I argue for an association between impurity and explanatory power in contemporary mathematics. This proposal is defended against the ancient and influential idea that purity and explanation go hand-in-hand (Aristotle, Bolzano) and recent suggestions that purity/impurity ascriptions and explanatory power are more or less distinct (Section 1). This is done by analyzing a central and deep result of additive number theory, Szemerédi’s theorem, and various of its proofs (Section 2). In particular, I focus upon the radically (...) impure (ergodic) proof due to Furstenberg (Section 3). Furstenberg’s ergodic proof is striking because it utilizes intuitively foreign and infinitary resources to prove a finitary combinatorial result and does so in a perspicuous fashion. I claim that Furstenberg’s proof is explanatory in light of its clear expression of a crucial structural result, which provides the “reason why” Szemerédi’s theorem is true. This is, however, rather surprising: how can such intuitively different conceptual resources “get a grip on” the theorem to be proved? I account for this phenomenon by articulating a new construal of the content of a mathematical statement, which I call structural content (Section 4). I argue that the availability of structural content saves intuitive epistemic distinctions made in mathematical practice and simultaneously explicates the intervention of surprising and explanatorily rich conceptual resources. Structural content also disarms general arguments for thinking that impurity and explanatory power might come apart. Finally, I sketch a proposal that, once structural content is in hand, impure resources lead to explanatory proofs via suitably understood varieties of simplification and unification (Section 5). (shrink)

May's Theorem [K. O. May, Econometrica 20 (1952) 680-684] characterizes majority voting on two alternatives as the unique preferential voting method satisfying several simple axioms. Here we show that by adding some desirable axioms to May's axioms, we can uniquely determine how to vote on three alternatives. In particular, we add two axioms stating that the voting method should mitigate spoiler effects and avoid the so-called strong no show paradox. We prove a theorem stating that any preferential voting (...) method satisfying our enlarged set of axioms, which includes some weak homogeneity and preservation axioms, agrees with Minimax voting in all three-alternative elections, except perhaps in some improbable knife-edged elections in which ties may arise and be broken in different ways. (shrink)

This paper proposes a solution to the problem of non-locality associated with Bell’s theorem, within the counterfactual approach to the problem. Our proposal is that a counterfactual definition of locality can be maintained, if a subsidiary hypothesis be rejected, “locality involving two counterfactuals”. This amounts to the acceptance of locality in the actual world, and a denial that locality is always valid in counterfactual worlds. This also introduces a metaphysical asymmetry between the factual and counterfactual worlds. This distinction is (...) analogous to what occurs in the derivations of Bell’s theorem which assume hidden-variables, where macroscopic locality can be maintained at the price of rejecting outcome independence. This can be interpreted as non-locality at the level of potentialities, which might be identified with the non-locality of counterfactual worlds. Our solution, presented for the CHSH inequality, is falsifiable, and we test it with two other setups, Bell’s original inequality and the EPR thought-experiment. (shrink)

In 1940 Dugundji proved that no system between S1 and S5 can be characterized by finite matrices. Dugundji’s result forced the development of alternative semantics, in particular Kripke’s relational semantics. The success of this semantics allowed the creation of a huge family of modal systems. With few adaptations, this semantics can characterize almost the totality of the modal systems developed in the last five decades. This semantics however has some limits. Two results of incompleteness showed that not every modal logic (...) can be characterized by Kripke frames. Besides, the creation of non-classical modal logics puts the problem of characterization of finite matrices very far away from the original scope of Dugundji’s result. In this sense, we will show how to update Dugundji’s result in order to make precise the scope and the limits of many-valued matrices as semantic of modal systems. A brief comparison with the useful Chagrov and Zakharyaschev’s criterion of tabularity for modal logics is provided. (shrink)

Leslie Tharp proves three theorems concerning epistemic and metaphysical modality for conventional modal predicate logic: every truth is a priori equivalent to a necessary truth, every truth is necessarily equivalent to an a priori truth, and every truth is a priori equivalent to a contingent truth. Lloyd Humberstone has shown that these theorems also hold in the modal system Actuality Modal Logic, the logic that results from the addition of the actuality operator to conventional modal logic. We show that Tharp’s (...) theorems fail for the expressively equivalent Subjunctive Modal Logic, the logic that was developed by Kai Wehmeier as an alternative to AML. We then argue that the existence of Tharp’s theorems for AML is due to a faulty interpretation of the notion of necessary truth, a feature that is not shared by SML. The paper concludes with an argument for the thesis that the existence of the distinction between truth at all worlds w and truth at all worlds w from the point of view of w as the actual world is an artifact owing to the interaction of the necessity and actuality operator. (shrink)

The energy-momentum tensor for a particular matter component summarises its local energy-momentum distribution in terms of densities and current densities. We re-investigate under what conditions these local distributions can be integrated to meaningful global quantities. This leads us directly to a classic theorem by Max von Laue concerning integrals of components of the energy-momentum tensor, whose statement and proof we recall. In the first half of this paper we do this within the realm of Special Relativity and in the (...) traditional mathematical language using components with respect to affine charts, thereby focusing on the intended physical content and interpretation. In the second half we show how to do all this in a proper differential-geometric fashion and on arbitrary space-time manifolds, this time focusing on the group-theoretic and geometric hypotheses underlying these results. Based on this we give a proper geometric statement and proof of Laue's theorem, which is shown to generalise from Minkowski space to space-times with significantly less symmetries. This result, which seems to be new, not only generalises but also clarifies the geometric content and hypotheses of Laue's theorem. A series of three appendices lists our conventions and notation and summarises some of the conceptual and mathematical background needed in the main text. (shrink)

Tarski's theorem essentially says that the Liar paradox is paradoxical in the minimal reflexive frame. We generalise this result to the Liar-like paradox $\lambda^\alpha$ for all ordinal $\alpha\geq 1$. The main result is that for any positive integer $n = 2^i(2j+1)$, the paradox $\lambda^n$ is paradoxical in a frame iff this frame contains at least a cycle the depth of which is not divisible by $2^{i+1}$; and for any ordinal $\alpha \geq \omega$, the paradox $\lambda^\alpha$ is paradoxical in a (...) frame iff this frame contains at least an infinite walk which has an arbitrarily large depth. We thus get that $\lambda^n$ has a degree of paradoxicality no more than $\lambda^m$ iff the multiplicity of 2 in the (unique) prime factorisation of $n$ is no more than that in the prime factorisation of $m$; and all tranfinite $\lambda^\alpha$ has the same degree of paradoxcality but has a higher degree of paradoxicality than any $\lambda^n$. (shrink)

Herbrand’s theorem is a central fact about classical logic, [9, 10]. It provides a constructive method for associating, with each first-order formula X, a sequence of formulas X1, X2, X3, . . . , so that X has a first-order proof if and only if some Xi is a tautology. Herbrand’s theorem serves as a constructive alternative to..

According to a popular narrative, in 1932 von Neumann introduced a theorem that intended to be a proof of the impossibility of hidden variables in quantum mechanics. However, the narrative goes, Bell later spotted a flaw that allegedly shows its irrelevance. Bell’s widely accepted criticism has been challenged by Bub and Dieks: they claim that the proof shows that viable hidden variables theories cannot be theories in Hilbert space. Bub’s and Dieks’ reassessment has been in turn challenged by Mermin (...) and Schack. Hereby I critically assess their reply, with the aim of bringing further clarification concerning the meaning, scope and relevance of von Neumann’s theorem. I show that despite Mermin and Schack’s response, Bub’s and Dieks’ reassessment is quite correct, and that this reading gets strongly reinforced when we carefully consider the connection between von Neumann’s proof and Gleason’s theorem. (shrink)

I demonstrate that Bell's theorem is based on circular reasoning and thus a fundamentally flawed argument. It unjustifiably assumes the additivity of expectation values for dispersion-free states of contextual hidden variable theories for non-commuting observables involved in Bell-test experiments, which is tautologous to assuming the bounds of ±2 on the Bell-CHSH sum of expectation values. Its premises thus assume in a different guise the bounds of ±2 it sets out to prove. Once this oversight is ameliorated from Bell's argument (...) by identifying the impediment that leads to it and local realism is implemented correctly, the bounds on the Bell-CHSH sum of expectation values work out to be ±2√2 instead of ±2, thereby mitigating the conclusion of Bell's theorem. Consequently, what is ruled out by any of the Bell-test experiments is not local realism but the linear additivity of expectation values, which does not hold for non-commuting observables in any hidden variable theories to begin with. I also identify similar oversight in the GHZ variant of Bell's theorem, invalidating its claim of having found an inconsistency in the premisses of the argument by EPR for completing quantum mechanics. Conceptually, the oversight in both Bell's theorem and its GHZ variant traces back to the oversight in von Neumann's theorem against hidden variable theories identified by Grete Hermann in the 1930s. (shrink)

A layman's guide to the mechanics of Gödel's proof together with a lucid discussion of the issues which it raises. Includes an essay discussing the significance of Gödel's work in the light of Wittgenstein's criticisms.

In “Minds, Machines, and Gödel”, J. R. Lucas claims that Goedel's incompleteness theorem constitutes a proof “that Mechanism is false, that is, that minds cannot be explained as machines”. He claims further that “if the proof of the falsity of mechanism is valid, it is of the greatest consequence for the whole of philosophy”. It seems to me that both of these claims are exaggerated. It is true that no minds can be explained as machines. But it is not (...) true that Goedel's theorem proves this. At most, Goedel's theorem proves that not all minds can be explained as machines. Since this is so, Goedel's theorem cannot be expected to throw much light on why minds are different from machines. Lucas overestimates the importance of Goedel's theorem for the topic of mechanism, I believe, because he presumes falsely that being unable to follow any but mechanical procedures in mathematics makes something a machine. (shrink)

Arrow's Theorem, in its social choice function formulation, assumes that all nonempty finite subsets of the universal set of alternatives is potentially a feasible set. We demonstrate that the axioms in Arrow's Theorem, with weak Pareto strengthened to strong Pareto, are consistent if it is assumed that there is a prespecified alternative which is in every feasible set. We further show that if the collection of feasible sets consists of all subsets of alternatives containing a prespecified list of (...) alternatives and if there are at least three additional alternatives not on this list, replacing nondictatorship by anonymity results in an impossibility theorem. (shrink)

In the present piece we defend predicate approaches to modality, that is approaches that conceive of modal notions as predicates applicable to names of sentences or propositions, against the challenges raised by Montague’s theorem. Montague’s theorem is often taken to show that the most intuitive modal principles lead to paradox if we conceive of the modal notion as a predicate. Following Schweizer (J Philos Logic 21:1–31, 1992) and others we show this interpretation of Montague’s theorem to be (...) unwarranted unless a further non trivial assumption is made—an assumption which should not be taken as a given. We then move on to showing, elaborating on work of Gupta (J Philos Logic 11:1–60, 1982), Asher and Kamp (Properties, types, and meaning. Vol. I: foundational issues, Kluwer, Dordrecht, pp 85−158, 1989), and Schweizer (J Philos Logic 21:1–31, 1992), that the unrestricted modal principles can be upheld within the predicate approach and that the predicate approach is an adequate approach to modality from the perspective of modal operator logic. To this end we develop a possible world semantics for multiple modal predicates and show that for a wide class of multimodal operator logics we may find a suitable class of models of the predicate approach which satisfies, modulo translation, precisely the theorems of the modal operator logic at stake. (shrink)

We consider the relation between versions of Ramsey’s Theorem and König’s Infinity Lemma, in the absence of the axiom of choice.

Bell’s theorem has fascinated physicists and philosophers since his 1964 paper, which was written in response to the 1935 paper of Einstein, Podolsky, and Rosen. Bell’s theorem and its many extensions have led to the claim that quantum mechanics and by inference nature herself are nonlocal in the sense that a measurement on a system by an observer at one location has an immediate effect on a distant entangled system. Einstein was repulsed by such “spooky action at a (...) distance” and was led to question whether quantum mechanics could provide a complete description of physical reality. In this paper I argue that quantum mechanics does not require spooky action at a distance of any kind and yet it is entirely reasonable to question the assumption that quantum mechanics can provide a complete description of physical reality. The magic of entangled quantum states has little to do with entanglement and everything to do with superposition, a property of all quantum systems and a foundational tenet of quantum mechanics. (shrink)