In [3] F. P. Ramsey proved as a theorem of Zermelo-Fraenkel set theory (ZF) with the Axiom of Choice (AC) the following result:(1) Theorem. Let A be an infinite class. For each integer n and partition {X, Y} of the size n subsets of A, there exists an infinite subclass of A all of whose size n subsets are contained in only one of X or Y.

It is shown that the boolean prime ideal theorem BPIT: every boolean algebra has a prime ideal, does not follow from the order-extension principle OE: every partial ordering can be extended to a linear ordering. The proof uses a Fraenkel-Mostowski model, where the family of atoms is indexed by a countable universal-homogeneous boolean algebra whose boolean partial ordering has a `generic' extension to a linear ordering. To illustrate the technique for proving that the order-extension principle holds in the model (...) we also study Mostowski's ordered model, and give a direct verification of OE there. The key technical point needed to verify OE in each case is the existence of a support structure. (shrink)

We give some information about new proofs of the incompleteness theorems, found in 1990s. Some of them do not require the diagonal lemma as a method of construction of an independent statement.

We provide a general theorem implying that for a (strongly) dependent theory T the theory of sufficiently well-behaved pairs of models of T is again (strongly) dependent. We apply the theorem to the case of lovely pairs of thorn-rank one theories as well as to a setting of dense pairs of first-order topological theories.

Democratic decision-making is often defended on grounds of the ‘wisdom of crowds’: decisions are more likely to be correct if they are based on many independent opinions, so a typical argument in social epistemology. But what does it mean to have independent opinions? Opinions can be probabilistically dependent even if individuals form their opinion in causal isolation from each other. We distinguish four probabilistic notions of opinion independence. Which of them holds depends on how individuals are causally affected by (...) environmental factors such as commonly perceived evidence. In a general theorem, we identify causal conditions guaranteeing each kind of opinion independence. These results have implications for whether and how ‘wisdom of crowds’ arguments are possible, and how truth-conducive institutions can be designed. (shrink)

After some introductory remarks on "experimental metaphysics", a brief survey of the current situation concerning the major types of hidden-variable theories and the inexistence proofs is presented. The category of stochastic, contextual, local theories remains open. Then the main features of a logical analysis of "locality" are sketched. In the deterministic case, a natural "light-cone determination" condition helps bridge the gap that has existed between the physical requirements of the special theory of relativity and formal conditions used in proving the (...) Bell -Wigner theorem. Natural generalization to the stochastic type, taking account of the distinction between epistemic and physical probabilities, leads to a series of independence claims constituting some significant limitations on generalized Bell theorems. In particular, the conditional stochastic independence requirement is seen both to go beyond the demand of compliance with the STR and to be a genuine necessity in deriving any Bell theorem for the stochastic case. The conclusion is also supported that, if determinism is given up, the Bell theorems and experiments do not pose an additional obstacle to unifying relativity theory and quantum mechanics beyond what is already posed by the "instantaneous" collapse of the wave function. (shrink)

A first-order theory T has the Independence Property provided deduction of a statement of type (quantifiers) (P -> (P1 or P2 or .. or Pn)) in T implies that (quantifiers) (P -> Pi) can be deduced in T for some i, 1 <= i <= n). Variants of this property have been noticed for some time in logic programming and in linear programming. We show that a first-order theory has the Independence Property for the class of basic formulas (...) provided it can be axiomatized with Horn sentences. The existence of free models is a useful intermediate result. The independence Property is also a tool to decide that a sentence cannot be deduced. We illustrate this with the case of the classical Caratheodory theorem for Pasch-Peano geometries. (shrink)

It is a widespread intuition that the coherence of independent reports provides a powerful reason to believe that the reports are true. Formal results by Huemer, M. 1997. “Probability and Coherence Justification.” Southern Journal of Philosophy 35: 463–72, Olsson, E. 2002. “What is the Problem of Coherence and Truth?” Journal of Philosophy XCIX : 246–72, Olsson, E. 2005. Against Coherence: Truth, Probability, and Justification. Oxford University Press., Bovens, L., and S. Hartmann. 2003. Bayesian Epistemology. Oxford University Press, prove that, under (...) certain conditions, coherence cannot increase the probability of the target claim. These formal results, known as ‘the impossibility theorems’ have been widely discussed in the literature. They are taken to have significant epistemic upshot. In particular, they are taken to show that reports must first individually confirm the target claim before the coherence of multiple reports offers any positive confirmation. In this paper, I dispute this epistemic interpretation. The impossibility theorems are consistent with the idea that the coherence of independent reports provides a powerful reason to believe that the reports are true even if the reports do not individually confirm prior to coherence. Once we see that the formal discoveries do not have this implication, we can recover a model of coherence justification consistent with Bayesianism and these results. This paper, thus, seeks to turn the tide of the negative findings for coherence reasoning by defending coherence as a unique source of confirmation. (shrink)

A proof of the (propositional) Craig interpolation theorem for cut-free sequent calculus yields that a sequent with a cut-free proof (or with a proof with cut-formulas of restricted form; in particular, with only analytic cuts) with k inferences has an interpolant whose circuit-size is at most k. We give a new proof of the interpolation theorem based on a communication complexity approach which allows a similar estimate for a larger class of proofs. We derive from it several corollaries: (...) (1) Feasible interpolation theorems for the following proof systems: (a) resolution (b) a subsystem of LK corresponding to the bounded arithmetic theory S 2 2 (α) (c) linear equational calculus (d) cutting planes. (2) New proofs of the exponential lower bounds (for new formulas) (a) for resolution ([15]) (b) for the cutting planes proof system with coefficients written in unary ([4]). (3) An alternative proof of the independence result of [43] concerning the provability of circuit-size lower bounds in the bounded arithmetic theory S 2 2 (α). In the other direction we show that a depth 2 subsystem of LK does not admit feasible monotone interpolation theorem (the so called Lyndon theorem), and that a feasible monotone interpolation theorem for the depth 1 subsystem of LK would yield new exponential lower bounds for resolution proofs of the weak pigeonhole principle. (shrink)

This lecture, given at Beijing University in 1984, presents a remarkable (previously unpublished) proof of the Gödel Incompleteness Theorem due to Kripke. Today we know purely algebraic techniques that can be used to give direct proofs of the existence of nonstandard models in a style with which ordinary mathematicians feel perfectly comfortable--techniques that do not even require knowledge of the Completeness Theorem or even require that logic itself be axiomatized. Kripke used these techniques to establish incompleteness by means (...) that could, in principle, have been understood by nineteenth-century mathematicians. The proof exhibits a statement of number theory--one which is not at all "self referring"--and constructs two models, in one of which it is true and in the other of which it is false, thereby establishing "undecidability" (independence). (shrink)

Standard proofs of generalized Bell theorems, aiming to restrict stochastic, local hidden-variable theories for quantum correlation phenomena, employ as a locality condition the requirement of conditional stochastic independence. The connection between this and the no-superluminary-action requirement of the special theory of relativity has been a topic of controversy. In this paper, we introduce an alternative locality condition for stochastic theories, framed in terms of the models of such a theory (§2). It is a natural generalization of a light-cone determination (...) condition that is essentially equivalent to mathematical conditions that have been used to derive Bell inequalities in the deterministic case. Further, it is roughly equivalent to a condition proposed by Bell that, in one investigation, needed to be supplemented with a much stronger assumption in order to yield an inequality violated by some quantum mechanical predictions. It is shown here that this reflects a very general situation: from the proposed locality condition, even adding the strict anticorrelation condition and the auxiliary hypotheses needed to derive experimentally useful (and theoretically telling) inequalities, no Bell-type inequality is derivable. (These independence claims are the burden of §4.) A certain limitation on the scope of the proposed stochastic locality condition is exposed (§5), but it is found to be rather minor. The conclusion is thus supported that conditional stochastic independence, however reasonable on other grounds, is essentially stronger than what is required by the special theory.Our results stand in apparent contradiction with a class of derivations purporting to obtain generalized Bell inequalities from locality alone. It is shown in Appendix (B) that such proofs do not achieve their goal. This fits with our conclusion that generalized Bell theorems are not straightforward generalizations of theorems restricting deterministic hidden-variable theories, and that, in fact, such generalizations do not exist. This leaves open the possibility that a satisfactory, non-deterministic account of the quantum correlation phenomena can be given within the framework of the special theory. (shrink)

We prove an institutional version of A. Robinson ’s Consistency Theorem. This result is then appliedto the institution of many-sorted first-order predicate logic and to two of its variations, infinitary and partial, obtaining very general syntactic criteria sufficient for a signature square in order to satisfy the Robinson consistency and Craig interpolation properties.

Condorcet's famous jury theorem reaches an optimistic conclusion on the correctness of majority decisions, based on two controversial premises about voters: they are competent and vote independently, in a technical sense. I carefully analyse these premises and show that: whether a premise is justi…ed depends on the notion of probability considered; none of the notions renders both premises simultaneously justi…ed. Under the perhaps most interesting notions, the independence assumption should be weakened.

In the paper, the proof of the non-locality of quantum mechanics, given by Bedford and Stapp (1995), and appealing to the GHZ example, is analyzed. The proof does not contain any explicit assumption of realism, but instead it uses formal methods and techniques of the Lewis calculus of counterfactuals. To ascertain the validity of the proof, a formal semantic model for counterfactuals is constructed. With the help of this model it can be shown that the proof is faulty, because it (...) appeals to the unwarranted principle of “elimination of eliminated conditions” (EEC). As an additional way of showing unreasonableness of the assumption (EEC), it is argued that yet another alleged and highly controversial proof of non-locality of QM, using the Hardy example, can be made almost trivial with the help of (EEC). Finally, a general argument is produced to the effect that the locality condition in the form accepted by Stapp and Bedford is consistent with the quantum-mechanical predictions for the GHZ case under the assumption of indeterminism. This result undermines any future attempts of proving the incompatibility between the predictions of quantum theory and the idea of no faster-than-light influence in the GHZ case, quite independently of the negative assessment of the particular derivation proposed by Stapp and Bedford. (shrink)

A few results generalizing well-known classical model theory ones have been obtained in institution theory these last two decades (e.g. Craig interpolation, ultraproduct, elementary diagrams). In this paper, we propose a generalized institution-independent version of the Beth definability theorem.

Jury theorems are mathematical theorems about the ability of collectives to make correct decisions. Several jury theorems carry the optimistic message that, in suitable circumstances, ‘crowds are wise’: many individuals together (using, for instance, majority voting) tend to make good decisions, outperforming fewer or just one individual. Jury theorems form the technical core of epistemic arguments for democracy, and provide probabilistic tools for reasoning about the epistemic quality of collective decisions. The popularity of jury theorems spans across various disciplines such (...) as economics, political science, philosophy, and computer science. This entry reviews and critically assesses a variety of jury theorems. It first discusses Condorcet's initial jury theorem, and then progressively introduces jury theorems with more appropriate premises and conclusions. It explains the philosophical foundations, and relates jury theorems to diversity, deliberation, shared evidence, shared perspectives, and other phenomena. It finally connects jury theorems to their historical background and to democratic theory, social epistemology, and social choice theory. (shrink)

We study Kim-independence over arbitrary sets. Assuming that forking satisfies existence, we establish Kim's lemma for Kim-dividing over arbitrary sets in an NSOP1 theory. We deduce symmetry of Kim-independence and the independence theorem for Lascar strong types.

We formulate a general institution-independent (i.e. independent of the details of the actual logic formalised as institution) version of the Craig Interpolation Theorem and prove it in dependence of Birkhoff-style axiomatizability properties of the actual logic.We formalise Birkhoff-style axiomatizability within the general abstract model theoretic framework of institution theory by the novel concept of Birkhoff institution.

We introduce the framework of AECats, generalizing both the category of models of some first-order theory and the category of subsets of models. Any AEC and any compact abstract theory forms an AECat. In particular, we find applications in positive logic and continuous logic: the category of models of a positive or continuous theory is an AECat. The Kim–Pillay theorem for first-order logic characterizes simple theories by the properties dividing independence has. We prove a version of the Kim–Pillay (...) theorem for AECats with the amalgamation property, generalizing the first-order version and existing versions for positive logic. (shrink)

Arrhenius’s impossibility theorems purport to demonstrate that no population axiology can satisfy each of a small number of intuitively compelling adequacy conditions. However, it has recently been pointed out that each theorem depends on a dubious assumption: Finite Fine-Grainedness. This assumption states that there exists a finite sequence of slight welfare differences between any two welfare levels. Denying Finite Fine-Grainedness makes room for a lexical population axiology which satisfies all of the compelling adequacy conditions in each theorem. Therefore, (...) Arrhenius’s theorems fail to prove that there is no satisfactory population axiology. In this paper, I argue that Arrhenius’s theorems can be repurposed. Since all of our population-affecting actions have a non-zero probability of bringing about more than one distinct population, it is population prospect axiologies that are of practical relevance, and amended versions of Arrhenius’s theorems demonstrate that there is no satisfactory population prospect axiology. These impossibility theorems do not depend on Finite Fine-Grainedness, so lexical views do not escape them. (shrink)

Mathematical theorems are cultural artifacts and may be interpreted much as works of art, literature, and tool-and-craft are interpreted. The Fundamental Theorem of the Calculus, the Central Limit Theorem of Statistics, and the Statistical Continuum Limit of field theories, all show how the world may be put together through the arithmetic addition of suitably prescribed parts (velocities, variances, and renormalizations and scaled blocks, respectively). In the limit — of smoothness, statistical independence, and large N — higher-order parts, (...) such as accelerations, are, for the most, part irrelevant, affirming that, in the end, most of the world's particulars may be averaged over (a very un-Scriptural point of view). (We work out all of this in technical detail, including a nice geometric picture of stochastic integration, and a method of calculating the variance of the sum of dependent random variables using renormalization group ideas.) These fundamental theorems affirm a culture that is additive, ahistorical, Cartesian, and continuist, sharing in what might be called a species of modern culture. We understand mathematical results as useful because, like many other such artifacts, they have been adapted to fit the world, and the world has been adapted to fit their capacities. Such cultural interpretation is in effect motivation for the mathematics, and might well be offered to students as a way of helping them understand what is going on at the blackboard. Philosophy of mathematics might want to pay more attention to the history and detailed technical features of sophisticated mathematics, as a balance to the usual concerns that arise in formalist or even Platonist positions. (shrink)

The distinguishing feature of ‘modal’ interpretations of quantum mechanics is their abandonment of the orthodox eigenstate–eigenvalue rule, which says that an observable possesses a definite value if and only if the system is in an eigenstate of that observable. Kochen's and Dieks' new biorthogonal decomposition rule for picking out which observables have definite values is designed specifically to overcome the chief problem generated by orthodoxy's rule, the measurement problem, while avoiding the no-hidden-variable theorems. Otherwise, their new rule seems completely ad (...) hoc. The ad hoc charge can only be laid to rest if there is some way to give Kochen's and Dieks' rule for picking out which observables have definite values some independent motivation. And there is, or so I will argue here. Specifically, I shall show that theirs is the only rule able to save Schrödinger's cat from a fate worse than death, and sidestep the Bell–Kochen–Specker no-hidden-variables theorem, once we impose four independently natural conditions on such rules. (shrink)

I begin, in section 1, with a presentation of the Interpersonal Addition Theorem. The theorem, due to John Broome (1991), is a re-formulation of the classical result by Harsanyi (1955). It implies that, given some seemingly mild assumptions, the overall utility of an uncertain prospect can be seen as the sum of its individual utilities. In sections 1 and 2, I discuss the theorem's connection with utilitarianism and in particular consider its implications for the Priority View, according (...) to which benefits to the worse off count for more, in terms of overall utility, than comparable benefits to the better off (cf. Parfit 1995 [1991]). Broome (1991) and Klint Jensen (1996) have argued that, in view of the Interpersonal Addition Theorem, the Priority View should be rejected for measurement-theoretical reasons. Therefore, it cannot be seen as a plausible competitor to utilitarianism (cf. section 1). I will suggest, however, that a proponent of the Priority View would be well-advised, on independent grounds, to reject one of the basic assumptions on which the Addition Theorem is based. I have in mind the so-called Principle of Personal Good for uncertain prospects (cf. sections 4 and 5). If the theorem is disarmed in this way, then, as a side benefit, the Priority View will avoid the afore-mentioned problems with measurement. (shrink)

This paper takes its departure from the Interpersonal Addition Theorem. The theorem, by John Broome, is a re-formulation of the classical result by Harsanyi. It implies that, given some seemingly mild assumptions, the overall utility of an uncertain prospect can be seen as the sum of its individual utilities. In sections 1 and 2, I discuss the theorem’s connection with utilitarianism and in particular the extent to which this theorem still leaves room for the Priority View. (...) According to the latter, the utilitarian approach needs to be modified: Benefits to the worse off should count for more, overall, than the comparable benefits to the better off.Broome and Jensen have argued that the Priority View cannot be seen as a plausible competitor to utilitarianism: Given the addition theorem, prioritarianism should be rejected for measurement-theoretical reasons. I suggest that this difficulty is spurious: The proponents of the Priority View would be well advised, on independent grounds, to reject one of the basic assumptions on which the addition theorem is based, the so-called Principle of Personal Good for uncertain prospects.According to the Principle of Personal Good, one prospect is better than another if it is better for everyone or at least better for some and worse for none. That the Priority View, as I read it, rejects this welfarist intuition may be surprising. Isn’t welfarism a common ground for prioritarians and utilitarians? Still, as I argue, this welfarist common ground is better captured by a restricted Principle of Personal Good that is valid for *outcomes*, but not necessarily for uncertain prospects. We obtain this surprising result if we take the priority weights imposed by prioritarians to be relevant only to *moral*, but not to *prudential*, evaluations of prospects. This makes it possible for a prospect to be morally better even though it is worse for everyone concerned. The proposed interpretation of the Priority View thus drives a sharp wedge between prudence and morality. (shrink)

This is the first of three essays which use Edmund Husserl's dependence ontology to formulate a non-Diodorean and non-Kantian temporal semantics for two-valued, first-order predicate modal languages suitable for expressing ontologies of experience (like physics and cognitive science). This essay's primary desideratum is to formulate an adequate dependence-ontological account of order. To do so it uses primitive (proper) part and (weak) foundation relations to formulate seven axioms and 28 definitions as a basis for Husserl's dependence ontological theory of relating moments. (...) The essay distinguishes between dependence v. independence, pieces v. moments, mediate v. immediate pieces and moments, maximal v. non-maximal pieces, founded v. unfounded qualities, integrative v. disintegrative dependence, and defines the concepts of the completion of an object, the adumbrational equivalence relation of objects, moments of unity which unify objects, and relating moments which relate objects. The eight theorems [CUT90]-[CUT97] show that relating moments of unity provide an adequate account of order in terms of primitive (proper) part and (weak) foundation relations. (shrink)

There is an extensive literature in social choice theory studying the consequences of weakening the assumptions of Arrow's Impossibility Theorem. Much of this literature suggests that there is no escape from Arrow-style impossibility theorems unless one drastically violates the Independence of Irrelevant Alternatives (IIA). In this paper, we present a more positive outlook. We propose a model of comparing candidates in elections, which we call the Advantage-Standard (AS) model. The requirement that a collective choice rule (CCR) be rationalizable (...) by the AS model is in the spirit of but weaker than IIA; yet it is stronger than what is known in the literature as weak IIA (two profiles alike on x, y cannot have opposite strict social preferences on x and y). In addition to motivating violations of IIA, the AS model makes intelligible violations of another Arrovian assumption: the negative transitivity of the strict social preference relation P. While previous literature shows that only weakening IIA to weak IIA or only weakening negative transitivity of P to acyclicity still leads to impossibility theorems, we show that jointly weakening IIA to AS rationalizability and weakening negative transitivity of P leads to no such impossibility theorems. Indeed, we show that several appealing CCRs are AS rationalizable, including even transitive CCRs. (shrink)

Kanger [4] gives a set of twelve axioms for the classical propositional Calculus which, together with modus ponens and substitution, have the following nice properties: (0.1) Each axiom contains $\supset$ , and no axiom contains more than two different connectives. (0.2) Deletions of certain of the axioms yield the intuitionistic, minimal, and classical refutability1 subsystems of propositional calculus. (0.3) Each of these four systems of axioms has the separation property: that if a theorem is provable in such a system, (...) then it is provable using only the axioms of that system for $\supset$ , and for the other connectives, if any, actually occurring in that theorem. (0.4) All twelve axioms are independent. It is easily seen that two of Kanger's axioms can be shortened, and that two others can be replaced by a single axiom which is the same length as one of the two which it replaces, without disturbing properties (0.1)-(0.3). These alterations have advantages of simplicity and elegance, but bring property (0.4) into question, in that similarities among some of the axioms in the altered system make demonstrations of independence considerably more difficult. It is the purpose of this paper to show that independence is nonetheless provable for the simplified system, and in another system which also satisfies (0.1)-(0.3), in which f (falsehood) is taken to be primitive instead of ∼ (negation). Nonnormal truth-tables2 are used to obtain the independence of one of the axioms. (shrink)

de Finetti's representation theorem of exchangeable probabilities as unique mixtures of Bernoullian probabilities is a special case of a result known as the ergodic decomposition theorem. It says that stationary probability measures are unique mixtures of ergodic measures. Stationarity implies convergence of relative frequencies, and ergodicity the uniqueness of limits. Ergodicity therefore captures exactly the idea of objective probability as a limit of relative frequency (up to a set of measure zero), without the unnecessary restriction to probabilistically independent (...) events as in de Finetti's theorem. The ergodic decomposition has in some applications to dynamical systems a physical content, and de Finetti's reductionist interpretation of his result is not adequate in these cases. (shrink)

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)

Goncharov and Peretyat'kin independently gave necessary and sufficient conditions for when a set of types of a complete theory is the type spectrum of some homogeneous model of. Their result can be stated as a principle of second order arithmetic, which is called the Homogeneous Model Theorem (HMT), and analyzed from the points of view of computability theory and reverse mathematics. Previous computability theoretic results by Lange suggested a close connection between HMT and the Atomic Model Theorem (AMT), (...) which states that every complete atomic theory has an atomic model. The authors show that HMT and AMT are indeed equivalent in the sense of reverse mathematics, as well as in a strong computability theoretic sense and do the same for an analogous result of Peretyat'kin giving necessary and sufficient conditions for when a set of types is the type spectrum of some model. (shrink)

We examine the impact of Suzumura’s (Economica 43:381–390, 1976) consistency property when applied in the context of collective choice rules that are independent of irrelevant alternatives, neutral, and monotonic. An earlier contribution by Blau and Deb (Econometrica 45:871–879, 1977) establishes the existence of a vetoer if the collective relation is required to be complete and acyclical. The purpose of this paper is to explore the possibilities that result if completeness and acyclicity are dropped and Suzumura consistency is imposed instead. A (...) conceptually similar but logically independent version of the combined axiom that requires the collective decision mechanism to be independent, neutral, and monotonic is employed. In the case of a finite population, we obtain an alternative impossibility theorem if a collective choice rule is assumed to be non-degenerate and a modified no veto requirement is imposed instead of Blau and Deb’s (1977) condition. If the population is countably infinite, the impossibility can be avoided but it resurfaces if our new no veto property is extended to a coalitional variant. (shrink)

Let NBG be von Neumann-Bernays-Gödel set theory without the axiom of choice and let NBGA be the modification which allows atoms. In this paper we consider some of the well-known class or global forms of the wellordering theorem, the axiom of choice, and maximal principles which are known to be equivalent in NBG and show they are not equivalent in NBGA.

We provide and interpret a new measure independent characterization of the Gödel speed-up phenomenon. In particular, we prove a theorem that demonstrates the indifference of the concept of a measure independent Gödel speed-up to an apparent weakening of its definition that is obtained by requiring only those measures appearing in some fixed Blum complexity measure to participate in the speed-up, and by deleting the “for all r” condition from the definition so as to relax the required amount of speed-up. (...) We interpret our results as correlating the relative difficulty of mechanically recognizing theories with the relative power and the relative abstractness of the theories. We conclude by providing two open problems concerning possible similarities and relationships between the Blum speedability and Gödel speed-up phenomena. MSC: 03D15, 03F20. (shrink)

There is a substantial class of collective decision problems whose successful solution requires interdependence among decision makers at the agenda-setting stage and independence at the stage of choice. We define this class of problems and describe and apply a search-and-decision mechanism theoretically modeled in the context of honeybees and identified in earlier empirical work in biology. The honeybees’ mechanism has useful implications for mechanism design in human institutions, including courts, legislatures, executive appointments, research and development in firms, and basic (...) research in the sciences. Our paper offers a fresh perspective on the idea of “biomimicry” in institutional design and raises the possibility of comparative institutional analysis across species. (shrink)

The paper is a continuation of another paper published as Part I. Now, the case of “n=3” is inferred as a corollary from the Kochen and Specker theorem (1967): the eventual solutions of Fermat’s equation for “n=3” would correspond to an admissible disjunctive division of qubit into two absolutely independent parts therefore versus the contextuality of any qubit, implied by the Kochen – Specker theorem. Incommensurability (implied by the absence of hidden variables) is considered as dual to quantum (...) contextuality. The relevant mathematical structure is Hilbert arithmetic in a wide sense, in the framework of which Hilbert arithmetic in a narrow sense and the qubit Hilbert space are dual to each other. A few cases involving set theory are possible: (1) only within the case “n=3” and implicitly, within any next level of “n” in Fermat’s equation; (2) the identification of the case “n=3” and the general case utilizing the axiom of choice rather than the axiom of induction. If the former is the case, the application of set theory and arithmetic can remain disjunctively divided: set theory, “locally”, within any level; and arithmetic, “globally”, to all levels. If the latter is the case, the proof is thoroughly within set theory. Thus, the relevance of Yablo’s paradox to the statement of Fermat’s last theorem is avoided in both cases. The idea of “arithmetic mechanics” is sketched: it might deduce the basic physical dimensions of mechanics (mass, time, distance) from the axioms of arithmetic after a relevant generalization, Furthermore, a future Part III of the paper is suggested: FLT by mediation of Hilbert arithmetic in a wide sense can be considered as another expression of Gleason’s theorem in quantum mechanics: the exclusions about (n = 1, 2) in both theorems as well as the validity for all the rest values of “n” can be unified after the theory of quantum information. The availability (respectively, non-availability) of solutions of Fermat’s equation can be proved as equivalent to the non-availability (respectively, availability) of a single probabilistic measure as to Gleason’s theorem. (shrink)

Quantum mechanics predicts non-local correlations in spatially extended entangled quantum systems, and these correlations are empirically very well confirmed. This raises philosophical questions of how nature could be that way, prompting the study of purported completions of quantum mechanics by hidden variables. Bell-type theorems connect assumptions about hidden variables with empirical predictions for the outcome of quantum correlation experiments. From among these assumptions, the Setting Independence assumption has received the least formal attention. Its violation is, however, central in the (...) recent discussion about super-deterministic models for quantum correlation experiments. In this paper, we focus on the non-local modal correlations in the GHZ experiment. We model the introduction of hidden variables in the form of instruction sets via structure extensions in the framework of Branching Space-Times. This framework allows us to show in formal detail how the introduction of non-contextual instruction sets results in a specific violation of Setting Independence; a similar result is derived for contextual instruction sets. Our discussion provides additional reasons for foregoing the introduction of local hidden variables, and for accepting non-local quantum correlations as a resource provided by nature. (shrink)

One might think that if the majority of virtue signallers judge that a proposition is true, then there is significant evidence for the truth of that proposition. Given the Condorcet Jury Theorem, individual virtue signallers need not be very reliable for the majority judgment to be very likely to be correct. Thus, even people who are skeptical of the judgments of individual virtue signallers should think that if a majority of them judge that a proposition is true, then that (...) provides significant evidence that the proposition is true. We argue that this is mistaken. Various empirical studies converge on the following point: humans are very conformist in the contexts in which virtue signalling occurs. And stereotypical virtue signallers are even more conformist in such contexts. So we should be skeptical of the claim that virtue signallers are sufficiently independent for the Condorcet Jury Theorem to apply. We do not seek to decisively rule out the relevant application of the Condorcet Jury Theorem. But we do show that careful consideration of the available evidence should make us very skeptical of that application. Consequently, a defense of virtue signalling would need to engage with these findings and show that despite our strong tendencies for conformism, our judgements are sufficiently independent for the Condorcet Jury Theorem to apply. This suggests new directions for the debate about the epistemology of virtue signalling. (shrink)

Sandu and Pietarinen [Partiality and Games: Propositional Logic. Logic J. IGPL 9 (2001) 101] study independence friendly propositional logics. That is, traditional propositional logic extended by means of syntax that allow connectives to be independent of each other, although the one may be subordinate to the other. Sandu and Pietarinen observe that the IF propositional logics have exotic properties, like functional completeness for three-valued functions. In this paper we focus on one of their IF propositional logics and study its (...) properties, by means of notions from computational complexity. This approach enables us to compare propositional logic before and after the IF make-over. We observe that all but one of the best-known decision problems experience a complexity jump, provided that the complexity classes at hand are not equal. Our results concern every discipline that incorporates some notion of independence such as computer science, natural language semantics, and game theory. A corollary of one of our theorems illustrates this claim with respect to the latter discipline. (shrink)

In a previous paper, an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for (...) “n = 3” has been known for a long time. It needs “Hilbert mathematics”, which is inherently complete unlike the usual “Gödel mathematics”, and based on “Hilbert arithmetic” to generalize Peano arithmetic in a way to unify it with the qubit Hilbert space of quantum information. An “epoché to infinity” (similar to Husserl’s “epoché to reality”) is necessary to map Hilbert arithmetic into Peano arithmetic in order to be relevant to Fermat’s age. Furthermore, the two linked semigroups originating from addition and multiplication and from the Peano axioms in the final analysis can be postulated algebraically as independent of each other in a “Hamilton” modification of arithmetic supposedly equivalent to Peano arithmetic. The inductive proof of FLT can be deduced absolutely precisely in that Hamilton arithmetic and the pransfered as a corollary in the standard Peano arithmetic furthermore in a way accessible in Fermat’s epoch and thus, to himself in principle. A future, second part of the paper is outlined, getting directed to an eventual proof of the case “n=3” based on the qubit Hilbert space and the Kochen-Specker theorem inferable from it. (shrink)

We give a review and critique of jury theorems from a social-epistemology perspective, covering Condorcet’s (1785) classic theorem and several later refinements and departures. We assess the plausibility of the conclusions and premises featuring in jury theorems and evaluate the potential of such theorems to serve as formal arguments for the ‘wisdom of crowds’. In particular, we argue (i) that there is a fundamental tension between voters’ independence and voters’ competence, hence between the two premises of most jury (...) theorems; (ii) that the (asymptotic) conclusion that ‘huge groups are infallible’, reached by many jury theorems, is an artifact of unjustified premises; and (iii) that the (nonasymptotic) conclusion that ‘larger groups are more reliable’, also reached by many jury theorems, is not an artifact and should be regarded as the more adequate formal rendition of the ‘wisdom of crowds’. (shrink)

The tridecompositional uniqueness theorem of Elby and Bub (1994) shows that a wavefunction in a triple tensor product Hilbert space has at most one decomposition into a sum of product wavefunctions with each set of component wavefunctions linearly independent. I demonstrate that, in many circumstances, the unique component wavefunctions and the coefficients in the expansion are both hopelessly unstable, both under small changes in global wavefunction and under small changes in global tensor product structure. In my opinion, this means (...) that the theorem cannot underlie lawlike solutions to the problems of the interpretation of quantum theory. I also provide examples of circumstances in which there are open sets of wavefunctions containing no states with various decompositions. (shrink)

According to conciliatory views about the epistemology of disagreement, when epistemic peers have conflicting doxastic attitudes toward a proposition and fully disclose to one another the reasons for their attitudes toward that proposition (and neither has independent reason to believe the other to be mistaken), each peer should always change his attitude toward that proposition to one that is closer to the attitudes of those peers with which there is disagreement. According to pure higher-order evidence views, higher-order evidence for a (...) proposition always suffices to determine the proper rational response to disagreement about that proposition within a group of epistemic peers. Using an analogue of Arrow's Impossibility Theorem, I shall argue that no conciliatory and pure higher-order evidence view about the epistemology of disagreement can provide a true and general answer to the question of what disagreeing epistemic peers should do after fully disclosing to each other the (first-order) reasons for their conflicting doxastic attitudes. (shrink)

The Fraenkel-Mostowski method has been widely used to prove independence results among weak versions of the axiom of choice. In this paper it is shown that certain statements cannot be proved by this method. More specifically it is shown that in all Fraenkel-Mostowski models the following hold: 1. The axiom of choice for sets of finite sets implies the axiom of choice for sets of well-orderable sets. 2. The Boolean prime ideal theorem implies a weakened form of Sikorski's (...) theorem. (shrink)

We study the computational content of the Brouwer Fixed Point Theorem in the Weihrauch lattice. Connected choice is the operation that finds a point in a non-empty connected closed set given by negative information. One of our main results is that for any fixed dimension the Brouwer Fixed Point Theorem of that dimension is computably equivalent to connected choice of the Euclidean unit cube of the same dimension. Another main result is that connected choice is complete for dimension (...) greater than or equal to two in the sense that it is computably equivalent to Weak Kőnig’s Lemma. While we can present two independent proofs for dimension three and upward that are either based on a simple geometric construction or a combinatorial argument, the proof for dimension two is based on a more involved inverse limit construction. The connected choice operation in dimension one is known to be equivalent to the Intermediate Value Theorem; we prove that this problem is not idempotent in contrast to the case of dimension two and upward. We also prove that Lipschitz continuity with Lipschitz constants strictly larger than one does not simplify finding fixed points. Finally, we prove that finding a connectedness component of a closed subset of the Euclidean unit cube of any dimension greater than or equal to one is equivalent to Weak Kőnig’s Lemma. In order to describe these results, we introduce a representation of closed subsets of the unit cube by trees of rational complexes. (shrink)

The presented enhanced version of Eriksen’s theorem defines an universal transform of the Foldy–Wouthuysen type and in any external static electromagnetic field reveals a discrete symmetry of Dirac’s equation, responsible for existence of a highly influential conserved quantum number—the charge index distinguishing two branches of DE spectrum. It launches the charge-index formalism obeying the charge-index conservation law. Via its unique ability to manipulate each spectrum branch independently, the CIF creates a perfect charge-symmetric architecture of Dirac’s quantum mechanics, which resolves (...) all the riddles of the standard DE theory. Besides the abstract CIF algebra, the paper discusses: the novel accurate charge-symmetric definition of the electric-current density; DE in the true-particle representation, where electrons and positrons coexist on equal footing; flawless “natural” scheme of second quantization; and new physical grounds for the Fermi–Dirac statistics. As a fundamental quantum law, the CICL originates from the kinetic-energy sign conservation and leads to a novel single-particle physics in strong-field situations. Prohibiting Klein’s tunneling in Klein’s zone via the CICL, the precise CIF algebra defines a new class of weakly singular DE solutions, strictly confined in the coordinate space and experiencing the total reflection from the potential barrier. (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)