This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a fresh and elegant manner that is better suited for mechanization. We discuss details of our implementation in the Lean theorem prover with emphasis on the prime extension lemma and construction of the canonical model. Our implementation is restricted to a system of intuitionistic (...) propositional logic with implication, conjunction, disjunction, and falsity given in terms of a Hilbert-style axiomatization. As far as we know, our implementation is the first verified Henkin-style proof of completeness for intuitionistic logic following Troelstra and van Dalen's method in the literature. (shrink)

This paper presents a recent formalization of a Henkin-style completeness proof for the propositional modal logic S5 using the Lean theorem prover. The proof formalized is close to that of Hughes and Cresswell, but the system, based on a different choice of axioms, is better described as a Mendelson system augmented with axiom schemes for K, T, S4, and B, and the necessitation rule as a rule of inference. The language has the false and implication as the (...) only primitive logical connectives and necessity as the only primitive modal operator. The full source code is available online and has been typechecked with Lean 3.4.2. (shrink)

REVIEW OF: Automated Development of Fundamental Mathematical Theories by Art Quaife. (1992: Kluwer Academic Publishers) 271pp. Using the theorem prover OTTER Art Quaife has proved four hundred theorems of von Neumann-Bernays-Gödel set theory; twelve hundred theorems and definitions of elementary number theory; dozens of Euclidean geometry theorems; and Gödel's incompleteness theorems. It is an impressive achievement. To gauge its significance and to see what prospects it offers this review looks closely at the book and the proofs it presents.

Computer assisted theorem proving is an increasingly important part of mathematical methodology, as well as a long-standing topic in artificial intelligence (AI) research. However, the current generation of theorem proving software have limited functioning in terms of providing new proofs. Importantly, they are not able to discriminate interesting theorems and proofs from trivial ones. In order for computers to develop further in theorem proving, there would need to be a radical change in how the software functions. Recently, (...) machine learning results in solving mathematical tasks have shown early promise that deep artificial neural networks could learn symbolic mathematical processing. In this paper, I analyze the theoretical prospects of such neural networks in proving mathematical theorems. In particular, I focus on the question how such AI systems could be incorporated in practice to theorem proving and what consequences that could have. In the most optimistic scenario, this includes the possibility of autonomous automated theorem provers (AATP). Here I discuss whether such AI systems could, or should, become accepted as active agents in mathematical communities. (shrink)

Interactive theorem provers might seem particularly impractical in the history of philosophy. Journal articles in this discipline are generally not formalized. Interactive theorem provers involve a learning curve for which the payoffs might seem minimal. In this article I argue that interactive theorem provers have already demonstrated their potential as a useful tool for historians of philosophy; I do this by highlighting examples of work where this has already been done. Further, I argue that interactive theorem (...) provers can continue to be useful tools for historians of philosophy in the future; this claim is defended through a more conceptual analysis of what historians of philosophy do that identifies argument reconstruction as a core activity of such practitioners. It is then shown that interactive theorem provers can assist in this core practice by a description of what interactive theorem provers are and can do. If this is right, then computer verification for historians of philosophy is in the offing. (shrink)

This paper critically engages Philip Mirowki's essay, "The scientific dimensions of social knowledge and their distant echoes in 20th-century American philosophy of science." It argues that although the cold war context of anti-democratic elitism best suited for making decisions about engaging in nuclear war may seem to be politically and ideologically motivated, in fact we need to carefully consider the arguments underlying the new rational choice based political philosophies of the post-WWII era typified by Arrow's impossibility theorem. A distrust (...) of democratic decision-making principles may be developed by social scientists whose leanings may be toward the left or right side of the spectrum of political practices. (shrink)

The interactive theorem prover Isabelle/HOL is used to verify elementary theorems of classical extensional mereology.

A three dimensional hypercube representing all of the 4,096 dyadic computations in a standard bivalent system has been created. It has been constructed from the 16 functions arrayed in a table of functional completeness that can compute a dyadic relationship. Each component of the dyad is an operator as well as a function, such as “implication” being a result, as well as an operation. Every function in the hypercube has been color keyed to enhance the display of emerging patterns. At (...) the minimum, the hypercube is a “multiplication table” of dyadic computations and produces values in a way that shortens the time to do operations that normally would take longer using conventional truth table methods. It also can serve as a theorem prover and creator. With the hypercube comes a deductive system without the need for axioms. The main significance of the 3-D hypercube at this point is that it is the most fundamental way of displaying all dyadic computations in binary space, thus serving as a way of normalizing the rendition of uninterpreted, or raw, binary space. The hypercube is a dimensionless entity, a standard by which in binary spaces can be measured and classified, analogous to a meter stick. (shrink)

Our computational metaphysics group describes its use of automated reasoning tools to study Leibniz’s theory of concepts. We start with a reconstruction of Leibniz’s theory within the theory of abstract objects (henceforth ‘object theory’). Leibniz’s theory of concepts, under this reconstruction, has a non-modal algebra of concepts, a concept-containment theory of truth, and a modal metaphysics of complete individual concepts. We show how the object-theoretic reconstruction of these components of Leibniz’s theory can be represented for investigation by means of automated (...) theorem provers and finite model builders. The fundamental theorem of Leibniz’s theory is derived using these tools. (shrink)

Our computational metaphysics group describes its use of automated reasoning tools to study Leibniz’s theory of concepts. We start with a reconstruction of Leibniz’s theory within the theory of abstract objects (henceforth ‘object theory’). Leibniz’s theory of concepts, under this reconstruction, has a non-modal algebra of concepts, a concept-containment theory of truth, and a modal metaphysics of complete individual concepts. We show how the object-theoretic reconstruction of these components of Leibniz’s theory can be represented for investigation by means of automated (...) theorem provers and finite model builders. The fundamental theorem of Leibniz’s theory is derived using these tools. (shrink)

Gödel's incompleteness theorems establish the stunning result that mathematics cannot be fully formalized and, further, that any formal system containing a modicum of number or set theory cannot establish its own consistency. Wilfried Sieg and Clinton Field, in their paper Automated Search for Gödel's Proofs, presented automated proofs of Gödel's theorems at an abstract axiomatic level; they used an appropriate expansion of the strategic considerations that guide the search of the automated theorem prover AProS. The representability conditions that (...) allow the syntactic notions of the metalanguage to be represented inside the object language were taken as axioms in the automated proofs. The concrete task I am taking on in this project is to extend the search by formally verifying these conditions. Using a formal metatheory defined in the language of binary trees, the syntactic objects of the metatheory lend themselves naturally to a direct encoding in Zermelo's theory of sets. The metatheoretic notions can then be inductively defined and shown to be representable in the object-theory using appropriate inductive arguments. Formal verification of the representability conditions is the first step towards an automated proof thereof which, in turn, brings the automated verification of Gödel's theorems one step closer to completion. (shrink)

Benchmarking automated theorem proving (ATP) systems using standardized problem sets is a well-established method for measuring their performance. However, the availability of such libraries for non-classical logics is very limited. In this work we propose a library for benchmarking Girard's (propositional) intuitionistic linear logic. For a quick bootstrapping of the collection of problems, and for discussing the selection of relevant problems and understanding their meaning as linear logic theorems, we use translations of the collection of Kleene's intuitionistic theorems in (...) the traditional monograph "Introduction to Metamathematics". We analyze four different translations of intuitionistic logic into linear logic and compare their proofs using a linear logic based prover with focusing. In order to enhance the set of problems in our library, we apply the three provability-preserving translations to the propositional benchmarks in the ILTP Library. Finally, we generate a comprehensive set of reachability problems for Petri nets and encode such problems as linear logic sequents, thus enlarging our collection of problems. (shrink)

Binding specificity is a centrally important concept in molecular biology, yet it has received little philosophical attention. Here I aim to remedy this by analyzing binding specificity as a causal property. I focus on the concept’s role in drug design, where it is highly prized and hence directly studied. From a causal perspective, understanding why binding specificity is a valuable property of drugs contributes to an understanding of causal selection—of how and why scientists distinguish between causes, not just causes from (...) noncauses. In particular, the specificity of drugs is precisely what underwrites their value as experimental interventions on biological processes. (shrink)

Ecological communities are seldom, if ever, biological individuals. They lack causal boundaries as the populations that constitute communities are not congruent and rarely have persistent functional roles regulating the communities’ higher-level properties. Instead we should represent ecological communities indexically, by identifying ecological communities via the network of weak causal interactions between populations that unfurl from a starting set of populations. This precisification of ecological communities helps identify how community properties remain invariant, and why they have robust characteristics. This respects the (...) diversity and aggregational nature of these complex systems while still vindicating them as units worthy of investigation. (shrink)

The question of whether there are laws of nature in ecology has developed substantially in the last 20 years. Many have attempted to rehabilitate ecology’s lawlike status through establishing that ecology possesses laws that robustly appear across many different ecological systems. I argue that there is still something missing, which explains why so many have been skeptical of ecology’s lawlike status. Community ecology has struggled to establish what I call a General Unificatory Theory. The lack of a GUT causes problems (...) for explanation as there are no guidelines for how to integrate the lower-level mathematical and causal models into a larger theory of how ecological assemblages are formed. I turn to a promising modern attempt to provide a unified higher-level explanation in ecology, presented by ecologist Mark Vellend, and advocate for philosophical engagement with its prospects for aiding ecological explanation. (shrink)

Empirical philosophers of science aim to base their philosophical theories on observations of scientific practice. But since there is far too much science to observe it all, how can we form and test hypotheses about science that are sufficiently rigorous and broad in scope, while avoiding the pitfalls of bias and subjectivity in our methods? Part of the answer, we claim, lies in the computational tools of the digital humanities, which allow us to analyze large volumes of scientific literature. Here (...) we advocate for the use of these methods by addressing a number of large-scale, justificatory concerns—specifically, about the epistemic value of journal articles as evidence for what happens elsewhere in science, and about the ability of DH tools to extract this evidence. Far from ignoring the gap between scientific literature and the rest of scientific practice, effective use of DH tools requires critical reflection about these relationships. (shrink)

Synthetic biology has immense potential to ameliorate widespread environmental damage. The promise of such technology could, however, be argued to potentially risk the public, industry, or governments not curtailing their environmentally damaging behaviour or even worse exploit the possibility of this technology to do further damage. In such cases, there is the risk of a worse outcome than if the technology was not deployed. This risk is often couched as an objection to new technologies, that the technology produces a moral (...) hazard. This paper describes how to navigate a moral hazard argument and mitigate the possibility of a moral hazard. Navigating moral hazard arguments and mitigating the possibility of a moral hazard will improve the public and environmental impact of synthetic biology. (shrink)

Jacques Monod (1971) argued that certain molecular processes rely critically on the property of chemical arbitrariness, which he claimed allows those processes to “transcend the laws of chemistry”. It seems natural, as some philosophers have done, to interpret this in modal terms: a biological relationship is chemically arbitrary if it is possible, within the constraints of chemical “law”, for that relationship to have been otherwise than it is. But while modality is certainly important for understanding chemical arbitrariness, understanding its biological (...) role also requires an account of the concrete causal-functional features that distinguish arbitrary from non-arbitrary phenomena. In this paper I elaborate on this under-emphasised aspect by offering a general account of these features: arbitrary relations are instantiated by mechanisms that involve molecular adapters, which causally couple two properties or processes which would otherwise be uncorrelated. Additionally, adapters work by acting as intermediate rather than cooperating causes. (shrink)

This chapter explores the idea that phylogenetic diversity plays a unique role in underpinning conservation endeavour. The conservation of biodiversity is suffering from a rapid, unguided proliferation of metrics. Confusion is caused by the wide variety of contexts in which we make use of the idea of biodiversity. Characterisations of biodiversity range from all-variety-at-all-levels down to variety with respect to single variables relevant to very specific conservation contexts. Accepting biodiversity as the sum of a large number of individual measures results (...) in an empirically intractable framework. However, large-scale decisions cannot be based on biodiversity variables inferred from local conservation imperatives because the variables relevant to the many systems being compared would be incommensurate with one another. We therefore need some general conception of biodiversity that would make tractable such large-scale environmental decision-marking. We categorise the large array of strategies for the measurement of biodiversity into four broad groups for consideration as general measures of biodiversity. We compare common moral justifications for the conservation of biodiversity and conclude that some form of instrumental value is the most plausible justification for biodiversity conservation. Although this is often interpreted as a reliance on option value, we opt for a broadly consequentialist characterisation of biodiversity conservation. We conclude that the best justified general measure of biodiversity will be some form of phylogenetic diversity. (shrink)

Some critics of invasion biology have argued the invasion of ecosystems by nonindigenous species can create more valuable ecosystems. They consider invaded communities as more valuable because they potentially produce more ecosystem services. To establish that the introduction of nonindigenous species creates more valuable ecosystems, they defend that value is provisioned by ecosystem services. These services are derived from ecosystem productivity, the production and cycling of resources. Ecosystem productivity is a result of biodiversity, which is understood as local species richness. (...) Invasive species increase local species richness and, therefore, increase the conservation value of local ecosystems. These views are disseminating to the public via a series of popular science books. Conservationists must respond to these views, and I outline a method of rejecting such arguments against controlling invasive species. Ecological systems are valuable for more than local productivity and biodiversity is not accurately described by a local species count. (shrink)

Understanding community-level selection using Lewontin’s criteria requires both community-level inheritance and community-level heritability, and in the discipline of community and ecosystem genetics, these are often conflated. While there are existing studies that show the possibility of both, these studies impose community-level inheritance as a product of the experimental design. For this reason, these experiments provide only weak support for the existence of community-level selection in nature. By contrast, treating communities as interactors (in line with Hull’s replicator-interactor framework or Dawkins’s idea (...) of the “extended phenotype”) provides a more plausible and empirically supportable model for the role of ecological communities in the evolutionary process. (shrink)

Conservation has often been conducted with the implicit internalization of Aldo Leopold’s claim: “A thing is right when it tends to preserve the integrity, stability and beauty of the biotic community.” This position has been found to be problematic as ecological science has not vindicated the ecological community as an entity which can be stable or coherent. Ecological communities do not form natural kinds, and this has forced ecological scientists to explain ecology in a different manner. Individualist approaches to ecological (...) systems have gained prominence. Individualists claim that ecological systems are better explained at the population level rather than as whole communities. My thesis looks at the implications of the current state of ecological science on conservation biology and emphasizes the importance of biodiversity as assessed at the population level. I defend the position that biodiversity should represent taxonomy and be quantified in reference to phylogenetic structure. This is a defence of biodiversity realism, which conceives of biodiversity as a natural quantity in the world which is measurable, valuable to prudent agents, and causally salient to ecological systems. To address how biodiversity at the population level relates to larger ecological systems I create a methodology designed to identify the relevant ecological system which biodiversity maintains and is maintained by biodiversity. This is done through the context dependent modelling of causal networks indexed to populations. My causal modelling methodology is then utilized to explicate ecological functions. These chapters together provide a framework for conservation science, which can then be applied to novel problems. The final section of the thesis utilises this framework to address whether de-extinction is a worthwhile conservation technique. (shrink)

Representation theorems are often taken to provide the foundations for decision theory. First, they are taken to characterize degrees of belief and utilities. Second, they are taken to justify two fundamental rules of rationality: that we should have probabilistic degrees of belief and that we should act as expected utility maximizers. We argue that representation theorems cannot serve either of these foundational purposes, and that recent attempts to defend the foundational importance of representation theorems are unsuccessful. As a result, we (...) should reject these claims, and lay the foundations of decision theory on firmer ground. (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)

Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ (...) - and $\tau $ -formulas and using the translation of quantifiers into $\varepsilon $ - and $\tau $ -terms to intermediate logics. It is shown that conservativity over the propositional base logic also holds for such intermediate ${\varepsilon \tau }$ -calculi. The “extended” first $\varepsilon $ -theorem holds if the base logic is finite-valued Gödel–Dummett logic, and fails otherwise, but holds for certain provable formulas in infinite-valued Gödel logic. The second $\varepsilon $ -theorem also holds for finite-valued first-order Gödel logics. The methods used to prove the extended first $\varepsilon $ -theorem for infinite-valued Gödel logic suggest applications to theories of arithmetic. (shrink)

Peer review is often taken to be the main form of quality control on academic research. Usually journals carry this out. However, parts of maths and physics appear to have a parallel, crowd-sourced model of peer review, where papers are posted on the arXiv to be publicly discussed. In this paper we argue that crowd-sourced peer review is likely to do better than journal-solicited peer review at sorting papers by quality. Our argument rests on two key claims. First, crowd-sourced peer (...) review will lead on average to more reviewers per paper than journal-solicited peer review. Second, due to the wisdom of the crowds, more reviewers will tend to make better judgments than fewer. We make the second claim precise by looking at the Condorcet Jury Theorem as well as two related jury theorems developed specifically to apply to peer review. (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)

The standard representation theorem for expected utility theory tells us that if a subject’s preferences conform to certain axioms, then she can be represented as maximising her expected utility given a particular set of credences and utilities—and, moreover, that having those credences and utilities is the only way that she could be maximising her expected utility. However, the kinds of agents these theorems seem apt to tell us anything about are highly idealised, being always probabilistically coherent with infinitely precise (...) degrees of belief and full knowledge of all a priori truths. Ordinary subjects do not look very rational when compared to the kinds of agents usually talked about in decision theory. In this paper, I will develop an expected utility representation theorem aimed at the representation of those who are neither probabilistically coherent, logically omniscient, nor expected utility maximisers across the board—that is, agents who are frequently irrational. The agents in question may be deductively fallible, have incoherent credences, limited representational capacities, and fail to maximise expected utility for all but a limited class of gambles. (shrink)

The study aimed to identify creative behavior and its impact on achieving Lean strategy in Palestinian civil organizations. The study used the descriptive analytical approach and the questionnaire as a main tool for collecting data from employees of associations operating in the governorates of Gaza Strip. The cluster sample method was used and the sample size was (343) individuals. Retrieving (298) questionnaires, and the following results were reached: The relative weight of the measure of Lean strategy was 79.04 (...) (%), and the relative weight of the measure of creative behavior was 78.99 (%), and there was a statistically significant relationship between creative behavior and Lean strategy, and the presence of an effect of creative behavior on Achieving Lean strategy, the absence of statistically significant differences in creative behavior according to the gender variable, age group, educational qualification, specialization, and the presence of statistically significant differences in Lean strategy attributable to the gender variable in dimensions (strategic sensitivity, clarity of vision, choice of strategic goals, Response speed, action) and differences were in favor of females. While there were no statistically significant differences in my dimension (shared responsibility, core capabilities) due to the gender variable, there were no statistically significant differences between the mean dimensions of Lean strategy due to the age group variable, the educational qualification, and the study presented a set of recommendations, the most important of which are: the necessity of seeking civil organizations In Gaza Strip, by obtaining funding from external countries to provide self-income for associations to face crises and give them independence in order to preserve them to carry out their role in society, the need to work to follow up on the strategic plan for NGOs using electronic messages as they pave the way to reach excellence and creativity in the field of work, The necessity of holding meetings and workshops with the local community, and this helps them to define the community's needs. (shrink)

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)

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.

This paper begins with a puzzle regarding Lewis' theory of radical interpretation. On the one hand, Lewis convincingly argued that the facts about an agent's sensory evidence and choices will always underdetermine the facts about her beliefs and desires. On the other hand, we have several representation theorems—such as those of (Ramsey 1931) and (Savage 1954)—that are widely taken to show that if an agent's choices satisfy certain constraints, then those choices can suffice to determine her beliefs and desires. In (...) this paper, I will argue that Lewis' conclusion is correct: choices radically underdetermine beliefs and desires, and representation theorems provide us with no good reasons to think otherwise. Any tension with those theorems is merely apparent, and relates ultimately to the difference between how 'choices' are understood within Lewis' theory and the problematic way that they're represented in the context of the representation theorems. For the purposes of radical interpretation, representation theorems like Ramsey's and Savage's just aren't very relevant after all. (shrink)

Pettit (2012) presents a model of popular control over government, according to which it consists in the government being subject to those policy-making norms that everyone accepts. In this paper, I provide a formal statement of this interpretation of popular control, which illuminates its relationship to other interpretations of the idea with which it is easily conflated, and which gives rise to a theorem, similar to the famous Gibbard-Satterthwaite theorem. The theorem states that if government policy is (...) subject to popular control, as Pettit interprets it, and policy responds positively to changes in citizens' normative attitudes, then there is a single individual whose normative attitudes unilaterally determine policy. I use the model and theorem as an illustrative example to discuss the role of mathematics in normative political theory. (shrink)

It is commonly assumed that personalization technologies used by Google for the purpose of tailoring search results for individual users create filter bubbles, which reinforce users’ political views. Surprisingly, empirical evidence for a personalization-induced filter bubble has not been forthcoming. Here, we investigate whether filter bubbles may result instead from a searcher’s choice of search queries. In the first experiment, participants rated the left-right leaning of 48 queries (search strings), 6 for each of 8 topics (abortion, benefits, climate change, sex (...) equality, immigration, nuclear family, Islam, and taxation). An independent sample of participants were then asked to select one of these queries for each of the 8 topics. With the exception of the topic of Islam, participants were significantly more likely to select a query corresponding to their own political leaning, compared to other queries, explaining between 12% and 39% of the variance. A second experiment investigated the effect of the political leaning of the same queries on the overall political leaning of Search Engine Result Pages (SERPs) in Google Search. The top six results of each SERP were rated collectively by a third group of participants, explaining 36.3% of the variance across all 48 search terms (p < .00001). That is, (1) participants in our experiments tended to select own-side search queries, and (2) using those queries tended to yield own-side search results when using the Google search engine. Our results are consistent with the notion of a self-imposed filter bubble in which query selection plays a salient role. (shrink)

A fundamental problem in science is how to make logical inferences from scientific data. Mere data does not suffice since additional information is necessary to select a domain of models or hypotheses and thus determine the likelihood of each model or hypothesis. Thomas Bayes’ Theorem relates the data and prior information to posterior probabilities associated with differing models or hypotheses and thus is useful in identifying the roles played by the known data and the assumed prior information when making (...) inferences. Scientists, philosophers, and theologians accumulate knowledge when analyzing different aspects of reality and search for particular hypotheses or models to fit their respective subject matters. Of course, a main goal is then to integrate all kinds of knowledge into an all-encompassing worldview that would describe the whole of reality. A generous description of the whole of reality would span, in the order of complexity, from the purely physical to the supernatural. These two extreme aspects of reality are bridged by a nonphysical realm, which would include elements of life, man, consciousness, rationality, mental and mathematical abstractions, etc. An urgent problem in the theory of knowledge is what science is and what it is not. Albert Einstein’s notion of science in terms of sense perception is refined by defining operationally the data that makes up the subject matter of science. It is shown, for instance, that theological considerations included in the prior information assumed by Isaac Newton is irrelevant in relating the data logically to the model or hypothesis. In addition, the concepts of naturalism, intelligent design, and evolutionary theory are critically analyzed. Finally, Eugene P. Wigner’s suggestions concerning the nature of human consciousness, life, and the success of mathematics in the natural sciences is considered in the context of the creative power endowed in humans by God. (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)

Amalgamating evidence of different kinds for the same hypothesis into an overall confirmation is analogous, I argue, to amalgamating individuals’ preferences into a group preference. The latter faces well-known impossibility theorems, most famously “Arrow’s Theorem”. Once the analogy between amalgamating evidence and amalgamating preferences is tight, it is obvious that amalgamating evidence might face a theorem similar to Arrow’s. I prove that this is so, and end by discussing the plausibility of the axioms required for the theorem.

In this work we consider the problem of the approximate hedging of a contingent claim in the minimum mean square deviation criterion. A theorem on martingale representation in case of discrete time and an application of the result for semi-continuous market model are also given.

To counter a general belief that all the paradoxes stem from a kind of circularity (or involve some self--reference, or use a diagonal argument) Stephen Yablo designed a paradox in 1993 that seemingly avoided self--reference. We turn Yablo's paradox, the most challenging paradox in the recent years, into a genuine mathematical theorem in Linear Temporal Logic (LTL). Indeed, Yablo's paradox comes in several varieties; and he showed in 2004 that there are other versions that are equally paradoxical. Formalizing these (...) versions of Yablo's paradox, we prove some theorems in LTL. This is the first time that Yablo's paradox(es) become new(ly discovered) theorems in mathematics and logic. (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 text is a continuation of the article of the same name published in the previous issue of Philosophical Alternatives. The philosophical interpretations of the Kochen- Specker theorem (1967) are considered. Einstein's principle regarding the,consubstantiality of inertia and gravity" (1918) allows of a parallel between descriptions of a physical micro-entity in relation to the macro-apparatus on the one hand, and of physical macro-entities in relation to the astronomical mega-entities on the other. The Bohmian interpretation ( 1952) of quantum mechanics (...) proposes that all quantum systems be interpreted as dissipative ones and that the theorem be thus derstood. The conclusion is that the continual representation, by force or (gravitational) field between parts interacting by means of it, of a system is equivalent to their mutual entanglement if representation is discrete. Gravity (force field) and entanglement are two different, correspondingly continual and discrete, images of a single common essence. General relativity can be interpreted as a superluminal generalization of special relativity. The postulate exists of an alleged obligatory difference between a model and reality in science and philosophy. It can also be deduced by interpreting a corollary of the heorem. On the other hand, quantum mechanics, on the basis of this theorem and of V on Neumann's (1932), introduces the option that a model be entirely identified as the modeled reality and, therefore, that absolutely reality be recognized: this is a non-standard hypothesis in the epistemology of science. Thus, the true reality begins to be understood mathematically, i.e. in a Pythagorean manner, for its identification with its mathematical model. A few linked problems are highlighted: the role of the axiom of choice forcorrectly interpreting the theorem; whether the theorem can be considered an axiom; whether the theorem can be considered equivalent to the negation of the axiom. (shrink)

This paper deals with, prepositional calculi with strong negation (N-logics) in which the Craig interpolation theorem holds. N-logics are defined to be axiomatic strengthenings of the intuitionistic calculus enriched with a unary connective called strong negation. There exists continuum of N-logics, but the Craig interpolation theorem holds only in 14 of them.

A proof of Fermat’s last theorem is demonstrated. It is very brief, simple, elementary, and absolutely arithmetical. The necessary premises for the proof are only: the three definitive properties of the relation of equality (identity, symmetry, and transitivity), modus tollens, axiom of induction, the proof of Fermat’s last theorem in the case of n = 3 as well as the premises necessary for the formulation of the theorem itself. It involves a modification of Fermat’s approach of infinite (...) descent. The infinite descent is linked to induction starting from n = 3 by modus tollens. An inductive series of modus tollens is constructed. The proof of the series by induction is equivalent to Fermat’s last theorem. As far as Fermat had been proved the theorem for n = 4, one can suggest that the proof for n ≥ 4 was accessible to him. An idea for an elementary arithmetical proof of Fermat’s last theorem (FLT) by induction is suggested. It would be accessible to Fermat unlike Wiles’s proof (1995). (shrink)

In this article, a possible generalization of the Löb’s theorem is considered. Main result is: let κ be an inaccessible cardinal, then ¬Con( ZFC +∃κ) .

We show that the respective oversights in the von Neumann's general theorem against all hidden variable theories and Bell's theorem against their local-realistic counterparts are homologous. When latter oversight is rectified, the bounds on the CHSH correlator work out to be ±2√2 instead of ±2.

This paper generalises the classical Condorcet jury theorem from majority voting over two options to plurality voting over multiple options. The paper further discusses the debate between epistemic and procedural democracy and situates its formal results in that debate. The paper finally compares a number of different social choice procedures for many-option choices in terms of their epistemic merits. An appendix explores the implications of some of the present mathematical results for the question of how probable majority cycles (as (...) in Condorcet's paradox) are in large electorates. (shrink)

The aggregation of individual judgments over interrelated propositions is a newly arising field of social choice theory. I introduce several independence conditions on judgment aggregation rules, each of which protects against a specific type of manipulation by agenda setters or voters. I derive impossibility theorems whereby these independence conditions are incompatible with certain minimal requirements. Unlike earlier impossibility results, the main result here holds for any (non-trivial) agenda. However, independence conditions arguably undermine the logical structure of judgment aggregation. I therefore (...) suggest restricting independence to premises, which leads to a generalised premise-based procedure. This procedure is proven to be possible if the premises are logically independent. (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)