I develop a probabilistic account of coherence, and argue that at least in certain respects it is preferable to (at least some of) the main extant probabilistic accounts of coherence: (i) Igor Douven and Wouter Meijs’s account, (ii) Branden Fitelson’s account, (iii) Erik Olsson’s account, and (iv) Tomoji Shogenji’s account. Further, I relate the account to an important, but little discussed, problem for standard varieties of coherentism, viz., the “Problem of Justified Inconsistent Beliefs.”.

Dynamic update of information states is a new paradigm in logicalsemantics. But such updates are also a traditional hallmark ofprobabilistic reasoning. This note brings the two perspectives togetherin an update mechanism for probabilities which modifies state spaces.

A system whose expected state changes with time cannot have both a forward-directed translationally invariant probabilistic law and a backward-directed translationally invariant law. When faced with this choice, science seems to favor the former. An asymmetry between cause and effect may help to explain why temporally oriented laws are usually forward-directed.

A classification of models of reduction into three categories — theory reductionism, explanatory reductionism, and constitutive reductionism — is presented. It is shown that this classification helps clarify the relations between various explications of reduction that have been offered in the past, especially if a distinction is maintained between the various epistemological and ontological issues that arise. A relatively new model of explanatory reduction, one that emphasizes that reduction is the explanation of a whole in terms of its parts is (...) also presented in detail. Finally, the classification is used to clarify the debate over reductionism in molecular biology. It is argued there that while no model from the category of theory reduction might be applicable in that case, models of explanatory reduction might yet capture the structure of the relevant explanations. (shrink)

There are many branches of philosophy called “the philosophy of X,” where X = disciplines ranging from history to physics. The philosophy of artificial intelligence has a long history, and there are many courses and texts with that title. Surprisingly, the philosophy of computer science is not nearly as well-developed. This article proposes topics that might constitute the philosophy of computer science and describes a course covering those topics, along with suggested readings and assignments.

The alleged proof of the non-mechanical, or non-computational, character of the human mind based on Gödel’s incompleteness theorem is revisited. Its history is reviewed. The proof, also known as the Lucas argument and the Penrose argument, is refuted. It is claimed, following Gödel himself and other leading logicians, that antimechanism is not implied by Gödel’s theorems alone. The present paper sets out this refutation in its strongest form, demonstrating general theorems implying the inconsistency of Lucas’s arithmetic and the semantic inadequacy (...) of Penrose’s arithmetic. On the other hand, the limitations to our capacity for mechanizing or programming the mind are also indicated, together with two other corollaries of Gödel’s theorems: that we cannot prove that we are consistent, and that we cannot fully describe our notion of a natural number. (shrink)

Electoral control refers to attempts by an election's organizer to influence the outcome by adding/deleting/partitioning voters or candidates. The important paper of Bartholdi, Tovey, and Trick [1] that introduces control proposes computational complexity as a means of resisting control attempts: Look for election systems where the chair's task in seeking control is itself computationally infeasible.We introduce and study a method of combining two or more candidate-anonymous election schemes in such a way that the combined scheme possesses all the resistances to (...) control possessed by any of its constituents: It combines their strengths. From this and new resistance constructions, we prove for the first time that there exists a neutral, anonymous election scheme that is resistant to all twenty standard types of electoral control. (shrink)

Catastrophe Theory was developed in an attempt to provide a form of Mathematics particularly apt for applications in the biological sciences. It was claimed that while it could be applied in the more conventional physical way, it could also be applied in a new metaphysical way, derived from the Structuralism of Saussure in Linguistics and Lévi-Strauss in Anthropology.Since those early beginnings there have been many attempts to apply Catastrophe Theory to Biology, but these hopes cannot be said to have been (...) fully realised. (shrink)

Epistemologists and philosophers of science have often attempted to express formally the impact of a piece of evidence on the credibility of a hypothesis. In this paper we will focus on the Bayesian approach to evidential support. We will propose a new formal treatment of the notion of degree of confirmation and we will argue that it overcomes some limitations of the currently available approaches on two grounds: (i) a theoretical analysis of the confirmation relation seen as an extension of (...) logical deduction and (ii) an empirical comparison of competing measures in an experimental inquiry concerning inductive reasoning in a probabilistic setting. (shrink)

We discuss the probabilistic analysis of explanatory power and prove a representation theorem for posterior ratio measures recently advocated by Schupbach and Sprenger. We then prove a representation theorem for an alternative class of measures that rely on the notion of relative probability distance. We end up endorsing the latter, as relative distance measures share the properties of posterior ratio measures that are genuinely appealing, while overcoming a feature that we consider undesirable. They also yield a telling result concerning formal (...) accounts of explanatory power versus inductive confirmation, thereby bridging our discussion to a so-called no-miracle argument. (shrink)

Can some evidence confirm a conjunction of two hypotheses more than it confirms either of the hypotheses separately? We show that it can, moreover under conditions that are the same for ten different measures of confirmation. Further we demonstrate that it is even possible for the conjunction of two disconfirmed hypotheses to be confirmed by the same evidence.

The paper surveys 17 deterministic electoral procedures for selecting one out of two or more candidates, as well as the susceptibility of each of these procedures to various paradoxes. A detailed appendix exemplifies the paradoxes to which each electoral procedure is susceptible. It is concluded that from the perspective of vulnerability to serious paradoxes, as well as in light of additional technical criteria, Copeland’s or Kemeny’s proposed procedures are the most desirable.

The Michael Heller’s article entitled “How is philosophy in science possible?” was originally published in Polish in 1986 and then translated into English by Bartosz Brożek and Aeddan Shaw and published in 2011 in the collection of essays entitled Philosophy in Science. Methods and Applications. This seminal paper has founded further growth of the ‘philosophy in science’ and become the reference point in the methodological discussions, especially in Poland. On the 40th anniversary of Philosophical Problems in Science we wanted to (...) make this paper freely available to the international public by reprinting its English version. In this issue it is followed by two additional articles-commentaries. (shrink)

The distinction between the discrete and the continuous lies at the heart of mathematics. Discrete mathematics (arithmetic, algebra, combinatorics, graph theory, cryptography, logic) has a set of concepts, techniques, and application areas largely distinct from continuous mathematics (traditional geometry, calculus, most of functional analysis, differential equations, topology). The interaction between the two – for example in computer models of continuous systems such as fluid flow – is a central issue in the applicable mathematics of the last hundred years. This article (...) explains the distinction and why it has proved to be one of the great organizing themes of mathematics. (shrink)