Supervaluationism and Logical Revisionism
Supervaluationism and Logical Revisionism
复制标题
超评价主义与逻辑修正主义
DOI:
--
复制
发表时间:
2008
期刊:
影响因子:
--
通讯作者:
J. Williams
中科院分区:
文献类型:
--
作者:
J. Williams
In the literature on supervaluationism, a central course of concern has been the acceptability, or otherwise, of its alleged logical revisionism. I attack the presupposition of this debate: arguing that when properly construed, there is no sense in which supervaluational consequence is revisionary. I provide new considerations supporting the claim that the supervaluational consequence should be characterized in a ‘global’ way. But pace Williamson and Keefe, I argue that supervaluationism does not give rise to counterexamples to familiar inference-patterns such as reductio and conditional proof. My case rests on a disputable assumption. I strengthen the argument, therefore, by showing that even if this assumption is denied, the case for supervaluational consequence being damagingly revisionary is undermined. ∗ Thanks to the members of Arché centre in St Andrews, and the CMM in Leeds, for discussion. Thanks in particular to JC Beall, Ross Cameron, Andrew McGonigal, Joseph Melia, Greg Restall, Achille Varzi and Elia Zardini for discussion. Many thanks also to Jamie Stark for typesetting work. 1 Williamson, T., Vagueness (London: Routledge, 1994) 2 Keefe, R., Theories of Vagueness (Cambridge: Cambridge University Press, 2000) JRG Williams. Forthcoming in The Journal of Philosophy 2 In the literature on supervaluationism, a central source of concern has been the acceptability, or otherwise, of its alleged logical revisionism. Timothy Williamson claims that supervaluationism gives rise to: ...breakdowns of the classical rules of contraposition, conditional proof, argument by cases and reduction ad absurdum in the supervaluationist logic of ‘definitely’. Williamson is unhappy with such revisionism: Conditional proof, argument by cases and reduction ad absurdum play a vital role in systems of natural deduction, the formal systems closest to our informal deductions....Supervaluationists have naturally tried to use their semantic apparatus to explain other locutions. If their attempts succeed, our language will be riddled with counterexamples to the four rules. Others, accepting the case for logical revisionism, have argued that the upshot is unobjectionable. Thus Keefe: A number of commentators have emphasized how supervaluationist logic...fails to preserve certain rules of inference or classical principles about logical consequence... 3 Williamson, op cit., pp 151-152 4 Ibid. JRG Williams. Forthcoming in The Journal of Philosophy 3 How important is the failure...of certain classical principles governing logical consequence?...My reply is that the described features of supervaluationism are acceptable... The case for revisionism that these authors present depends on the presence, in the language at hand, of the supervaluationist notion ‘Definitely’ (the ‘D’ operator). Roughly, ‘Definitely p’ says that, no matter how we sharpen the indeterminacy in our language, p always holds. In this, it is an object-language reflection of the supervaluationist’s notion of truth – ‘supertruth’: the idea being that ‘p’ is supertrue if it is true no matter how we sharpen our language. In a supervaluational language without the D-operator and its relatives, there is no special threat to the classical modes of inference. Once it is added, it is alleged that the following results hold, providing counterexamples to the respective classical mode of inference.