Microsoft Word - The Form of the Benardete dichotomy final BJPS my style.doc 1 The Form of the Benardete Dichotomy Nicholas Shackel Abstract: Benardete presents a version of Zeno’s dichotomy in which an infinite sequence of gods each intends to raise a barrier iff a traveller reaches where they intend to raise their barrier. In this paper I exhibit the abstract form of the Benardete Dichotomy. I show that the diagnosis based on that form can do philosophical work not done by earlier papers rejecting Priest’s version of the Benardete Dichotomy, and that the diagnosis extends to a paradox not normally classified as a dichotomy. I show how the form is exploited to generate paradox. 1 Introduction 2 The form of the Benardete dichotomy 3 Applying the unsatisfiable pair diagnosis 4 Exploiting the form 1 Introduction Benardete ([1964], pp. 259-60) presents a version of Zeno’s dichotomy in which an infinite sequence of gods each intends to raise a barrier iff a traveller reaches where they intend to raise their barrier. Priest presents a formalisation which replaces intentions of gods to raise barriers with a demon who mines the line in such a way that ‘passing certain spots brings barriers spontaneously into existence ([1999], p. 2). In refuting Priest, Yablo presents an infinite set of demons each of whom will say ‘YES if and only if all the earlier-calling demons have called NO’ ([2000], p. 150). Perez Laraudogoitia] ([2003]) offers a variant of Benardete’s dichotomy which he claims is not refuted by his own earlier ([2000]) refutation of Priest. Hawthorne ([2000]) and Angel ([2001]) exploit variants which appear not to be refuted by the earlier papers. There is a common contradictory form underlying all of these dichotomies. That form is also embedded in some other paradoxes, including Yablo’s ([1993]) paradox without self reference. In the second section I show what the form of the Benardete Dichotomy is. In the third section I show that the diagnosis based on the form can do philosophical work not done by Yablo ([2000]) and Perez Laraudogoitia ([2000]). In the final section I show how the form is exploited to generate paradox in the Benardete Dichotomy. 2 The form of the Benardete dichotomy For the purposes of this discussion, let x range over an infinite set S linearly ordered by a relation called ‘before’ (…<<…). Members of S may represent or be times or places on a line. Let such sets which have no first member be called unbegun sets, and the condition of having no first member be called the unbegun condition (∀x ∃y y << x).1 Let such sets which have a first member be called begun sets and let b be their 1 Examples of unbegun sets are the positive reals, ℝ+, the sets {1/2n } and {1/n} (i.e. the sets {x∈ℝ: x>0}, {x∈ℝ: x=1/2n for n∈ℕ} and {x∈ℝ: x=1/n for n∈ℕ}), under their usual ordering. 2 first member. Let ‘E’ be a predicate symbol, whose interpretation is intended to be a property of being instantiated at times and places, such as had by events, particles, barriers etc. being at times and places. We have a pair of related predicates: ‘E at …’ and ‘E before …’. In general, to be before is ambiguous between being somewhere before and being at all before, so we define ‘E somewhere before x’ to mean ∃y (y< 0 → (Bx ↔ Rx/2) (Priest [1999], p.2) Sentence (5) says that there is a barrier at x iff you reach x/2. The effect of sentences (2) and (3) is just that you will reach y iff there is no barrier before y.3 Put them 2 I’ve swapped variables from the original to make it easier to follow. 3 The antecedent of (2) is implicitly existentially quantified, ∃x (Bx & x < y) → ~Ry, so by contraposition, Ry → ∼∃x (x < y & Bx), which with (3) gives Ry ↔ ∼∃x (x < y & Bx). 3 together, and you get a barrier at x iff there is no barrier before x/2. Perez Laraudogoitia derives the same result formally from the same three sentences in his derivation of his sentence (10): (10) ∀x (x>0 → (Bx ↔ ∼∃y (y < x/2 & By))) (Perez Laraudogoitia [2000], p. 154) Nothing turns on the minor modification incumbent on the distinction between ‘before x’ and ‘before x/2’ just because the x is ranging over an unbegun set in which x/2 is always before x. Priest could just as well have used ‘x’ instead of ‘x/2’ in (5). The set S is the unbegun set, ℝ+, and condition ANB, for all x in S, there is a barrier at x iff there is a barrier nowhere before x. So Priest’s sentences (2) (3) and (5) effectively disguise an example of condition ANB. Likewise, we can see that Yablo’s demons, in attempting to say ‘YES if and only if all the earlier-calling demons has called NO’ (Yablo [2000], p.150), are attempting to conform to condition ANB. The set S is the unbegun set of times {1/2n }. All earlier calling demons calling No is logically equivalent to Yes called nowhere before. So we have condition ANB, for all t in S, a demon calls YES at time t iff a demon calls YES at no time before t. Condition ANB has a surprising consequence for unbegun sets. Let S be an unbegun set, and y be any member of S before x (y< n, Sk is not true. Here the unbegun set S is ℕ, on which once again we take the ‘before’ relation to be the normal ‘greater than’ relation. Condition ANB is only implicit in the paradox, as a condition on the truth of the sentences. Let a sentence being true at n be that Sn is true. If a sentence is true at n, then since Sn states that all sentence before it are not true, a sentence is true nowhere before n. Likewise, if a sentence is true nowhere before n, then for all k before n, Sk is not true, and so Sn, the sentence at n, is true. Thus condition ANB is that for all n in ℕ, a sentence is true at n iff a sentence is true nowhere before n. In Sorensen’s version of Yablo’s paradox we have an infinite queue of students each of whom says ‘Some of the students behind me are now thinking an untruth.’ (Sorensen [1998], p. 137). The set S is the queue, which is unbegun when we take ‘behind’ to be our ‘before’ relation. For convenience we can index the students in the queue with the natural numbers (with our now customary reverse ordering). Condition ANB is found in the condition on the students’ thoughts being untrue. We take E at x to be the student at x in the queue thinking an untruth. Plainly if the nth student thinking ‘someone behind me is thinking an untruth’ is thinking an untruth, then no one behind them is thinking an untruth (∀n (En →¬∃k (k<