The major reason given in the philosophical literature for dissatisfaction with theories of vagueness based on fuzzy logic is that such theories give rise to a problem of higherorder vagueness or artificial precision. In this paper I first outline the problem and survey suggested solutions: fuzzy epistemicism; measuring truth on an ordinal scale; logic as modelling; fuzzy metalanguages; blurry sets; and fuzzy plurivaluationism. I then argue that in order to decide upon a solution, we need to understand the true nature (...) and source of the problem. Two possible sources are discussed: the problem stems from the very nature of vagueness—from the defining features of vague predicates; or the problem stems from the way in which the meanings of predicates are determined—by the usage of speakers together with facts about their environment and so on. I argue that the latter is the true source of the problem, and on this basis that fuzzy plurivaluationism is the correct solution. (shrink)

This paper explores the interaction of well-motivated (if controversial) principles governing the probability conditionals, with accounts of what it is for a sentence to be indefinite. The conclusion can be played in a variety of ways. It could be regarded as a new reason to be suspicious of the intuitive data about the probability of conditionals; or, holding fixed the data, it could be used to give traction on the philosophical analysis of a contentious notion—indefiniteness. The paper outlines the various (...) options, and shows that ‘rejectionist’ theories of indefiniteness are incompatible with the results. Rejectionist theories include popular accounts such as supervaluationism, non-classical truth-value gap theories, and accounts of indeterminacy that centre on rejecting the law of excluded middle. An appendix compares the results obtained here with the ‘impossibility’ results descending from Lewis ( 1976 ). (shrink)

Revisionary theories of logic or truth require revisionary theories of mind. This essay outlines nonclassically based theories of rational belief, desire, and decision making, singling out the supervaluational family for special attention. To see these nonclassical theories of mind in action, this essay examines a debate between David Lewis and Derek Parfit over what matters in survival. Lewis argued that indeterminacy in personal identity allows caring about psychological connectedness and caring about personal identity to amount to the same thing. The (...) essay argues that Lewis's treatment of two of Parfit's puzzle cases—degreed survival and fission—presuppose different nonclassical treatments of belief and desire. (shrink)

Wright holds that the following two theses are jointly incoherent: Rules determine correct language use. These rules are discoverable via internal reflection on language use. I argue that incoherence is derivable from alone and examine two types of probabilistic accounts that model a modification of, one in terms of inexact knowledge, the other in terms of viewing semantic rules as reasons for linguistic actions. Both accommodate tolerance by breaking the link between justified assertion and truth, but incoherence threatens their conception (...) of justified assertion. I argue that the rules-as-reasons approach can relocate sharp boundaries to a place where they are not only more tolerable, but to be expected. (shrink)

Although arguments for and against competing theories of vagueness often appeal to claims about the use of vague predicates by ordinary speakers, such claims are rarely tested. An exception is Bonini et al. (1999), who report empirical results on the use of vague predicates by Italian speakers, and take the results to count in favor of epistemicism. Yet several methodological difficulties mar their experiments; we outline these problems and devise revised experiments that do not show the same results. We then (...) describe three additional empirical studies that investigate further claims in the literature on vagueness: the hypothesis that speakers confuse ‘P’ with ‘definitely P’, the relative persuasiveness of different formulations of the inductive premise of the Sorites, and the interaction of vague predicates with three different forms of negation. (shrink)

What is the proper attitude toward what is expressed by a vague sentence in the face of borderline evidence? Some call this attitude “ambivalence” and distinguish it from uncertainty. It has been argued that Classical Epistemicism conjoined with classical probability theory fails to characterize this attitude, and that we must therefore abandon classical logic or classical probabilities in the presence of vagueness. In this paper, I give a characterization of ambivalence assuming a supervaluationist semantics for vague terms that does not (...) revise either. The theory, which I call the theory of Superprobabilities, identifies the proper attitude toward a vague sentence, in the presence of exact borderline evidence, as the set of classical probabilities of the evidence on each member of the set of all precisifications of a vague sentence. I defend the use of sets of probabilities against objections by generalizing the theory of Superprobabilities to a decision theory called Superrationality. I then compare the merits of the theory of Superprobabilities to Classical Epistemicism and nonclassical probabilities theories with respect to the problem of ambivalence. (shrink)

A theory of vagueness gives a model of vague language and of reasoning within the language. Among the models that have been offered are Degree Theorists’ numerical models that assign values between 0 and 1 to sentences, rather than simply modelling sentences as true or false. In this paper, I ask whether we can benefit from employing a rich, well-understood numerical framework, while ignoring those aspects of it that impute a level of mathematical precision that is not present in the (...) modelled phenomenon of vagueness. Can we ignore apparent implications for the phenomena by pointing out that it is just a model and that the unwanted features are mere artefacts? I explore the distinction between representors and artefacts and criticise the strategy of appealing to features as mere artefacts in defence of a theory. I focus largely on theories using numerical resources, but also consider other, related theories and strategies, including theories appealing to non-linear structures. (shrink)

Stewart Shapiro has objected to the epistemicist theory of vagueness on grounds that it gives counterintuitive predictions about cases involving conditional obligation. This paper details a response on the epistemicist’s behalf. I first argue that Shapiro’s own presentation of the objection is unsuccessful as an argument against epistemicism. I then reconstruct and offer two alternative arguments inspired by Shapiro’s considerations, and argue that these fail too, given the information-sensitive nature of conditional obligations.

This paper explores the idea that vague predicates like “tall”, “loud” or “expensive” are applied based on a process of analog magnitude representation, whereby magnitudes are represented with noise. I present a probabilistic account of vague judgment, inspired by early remarks from E. Borel on vagueness, and use it to model judgments about borderline cases. The model involves two main components: probabilistic magnitude representation on the one hand, and a notion of subjective criterion. The framework is used to represent judgments (...) of the form “x is clearly tall” versus “x is tall”, as involving a shift of one’s criterion, and then to derive observed patterns of acceptance for borderline contradictions, namely sentences of the form “x is tall and not tall”, relative to the acceptance of their conjuncts. (shrink)

In this paper we compare different models of vagueness viewed as a specific form of subjective uncertainty in situations of imperfect discrimination. Our focus is on the logic of the operator “clearly” and on the problem of higher-order vagueness. We first examine the consequences of the notion of intransitivity of indiscriminability for higher-order vagueness, and compare several accounts of vagueness as inexact or imprecise knowledge, namely Williamson’s margin for error semantics, Halpern’s two-dimensional semantics, and the system we call Centered semantics. (...) We then propose a semantics of degrees of clarity, inspired from the signal detection theory model, and outline a view of higher-order vagueness in which the notions of subjective clarity and unclarity are handled asymmetrically at higher orders, namely such that the clarity of clarity is compatible with the unclarity of unclarity. (shrink)

In 1907 Borel published a remarkable essay on the paradox of the Heap (“Un paradoxe économique: le sophisme du tas de blé et les vérités statistiques”), in which Borel proposes what is likely the first statistical account of vagueness ever written, and where he discusses the practical implications of the sorites paradox, including in economics. Borel’s paper was integrated in his book Le Hasard, published 1914, but has gone mostly unnoticed since its publication. One of the originalities of Borel’s essay (...) is that it puts forward a model of vagueness as imprecision, making particular use of the Gaussian law of measurement errors to model categorization. The aim of our paper is to give a presentation of the historical context of Borel’s essay, to spell out the mathematical details of his model, and to provide a critical assessment of his theory. Three aspects of Borel’s account are particularly discussed: the first concerns the comparison between Borel’s statistical account and posterior degree-theoretic accounts of vagueness. The second concerns the anti-epistemicist flavor of Borel’s approach, whereby the idea of statistical fluctuation is used to undermine the notion of sharp boundary for vague predicates. The third concerns the problematic link between Borel’s model of vagueness as imprecision and the notion of semantic indeterminacy. An English translation of Borel’s original essay is appended to this paper (Erkenntnis, this issue). (shrink)

Edgington has proposed a solution to the sorites paradox in terms of ‘verities’, which she defines as degrees of closeness to clear truth. Central to her solution is the assumption that verities are formally probabilities. She is silent on what verities might derive from and on why they should be probabilities. This paper places Edgington’s solution in the framework of a spatial approach to conceptualization, arguing that verities may be conceived of as deriving from how our concepts relate to each (...) other. Building on work by Kamp and Partee, this paper further shows how verities, thus conceived of, may plausibly be assumed to have probabilistic structure. The new interpretation of verities is argued to also help answer the question of what the verities of indicative conditionals are, a question which Edgington leaves open. Finally, the question of how to accommodate higher-order vagueness, given this interpretation, is addressed. (shrink)

Richard Dietz and Sebastiano Moruzzi (eds.), Cuts and Clouds: Vagueness, its Nature, and its Logic, Oxford University Press, 2010, 586 pp., ISBN 9780199570386.

This article argues that resolutions to the sorites paradox offered by epistemic and supervaluation theories fail to adequately account for vagueness. After explaining the paradox, I examine the epistemic theory defended by Timothy Williamson and discuss objections to his semantic argument for vague terms having precise boundaries. I then consider Rosanna Keefe's supervaluationist approach and explain why it fails to accommodate the problem of higher-order vagueness. I conclude by discussing how fuzzy logic may hold the key to resolving the sorites (...) paradox without positing indefensible borders to the correct application of vague terms. (shrink)

Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved in polynomial time as well. A (...) solution for the so-called NP-complete problems will also be a solution for any other such problems. Its artificial-intelligence analogue is the class of AI-complete problems, for which a complete mathematical formalization still does not exist. In this chapter we will focus on analysing computational classes to better understand possible formalizations of AI-complete problems, and to see whether a universal algorithm, such as a Turing test, could exist for all AI-complete problems. In order to better observe how modern computer science tries to deal with computational complexity issues, we present several different deep-learning strategies involving optimization methods to see that the inability to exactly solve a problem from a higher order computational class does not mean there is not a satisfactory solution using state-of-the-art machine-learning techniques. Such methods are compared to philosophical issues and psychological research regarding human abilities of solving analogous NP-complete problems, to fortify the claim that we do not need to have an exact and correct way of solving AI-complete problems to nevertheless possibly achieve the notion of strong AI. (shrink)