Paul Egré

In Part I of this paper, we identified and compared various schemes for trivalent truth conditions for indicative conditionals, most notably the proposals by de Finetti and Reichenbach on the one hand, and by Cooper and Cantwell on the other. Here we provide the proof theory for the resulting logics DF/TT and CC/TT, using tableau calculi and sequent calculi, and proving soundness and completeness results. Then we turn to the algebraic semantics, where both logics have substantive limitations: DF/TT allows for algebraic completeness, but not for the construction of a canonical model, while CC/TT fails the construction of a Lindenbaum-Tarski algebra. With these results in mind, we draw up the balance and sketch future research projects.

This paper explores trivalent truth conditions for indicative conditionals, examining the “defective” truth table proposed by de Finetti and Reichenbach. On their approach, a conditional takes the value of its consequent whenever its antecedent is true, and the value Indeterminate otherwise. Here we deal with the problem of selecting an adequate notion of validity for this conditional. We show that all standard validity schemes based on de Finetti’s table come with some problems, and highlight two ways out of the predicament: one pairs de Finetti’s conditional with validity as the preservation of non-false values, but at the expense of Modus Ponens; the other modifies de Finetti’s table to restore Modus Ponens. In Part I of this paper, we present both alternatives, with specific attention to a variant of de Finetti’s table proposed by Cooper and Cantwell. In Part II, we give an in-depth treatment of the proof theory of the resulting logics, DF/TT and CC/TT: both are connexive logics, but with significantly different algebraic properties.

This paper develops a trivalent semantics for indicative conditionals and extends it to a probabilistic theory of valid inference and inductive learning with conditionals. On this account, (i) all complex conditionals can be rephrased as simple conditionals, connecting our account to Adams's theory of p-valid inference; (ii) we obtain Stalnaker's Thesis as a theorem while avoiding the well-known triviality results; (iii) we generalize Bayesian conditionalization to an updating principle for conditional sentences. The final result is a unified semantic and probabilistic theory of conditionals with attractive results and predictions.

Our paper addresses the following question: Is there a general characterization, for all predicates P that take both declarative and interrogative complements , of the meaning of the P-interrogative clause construction in terms of the meaning of the P-declarative clause construction? On our account, if P is a responsive predicate and Q a question embedded under P, then the meaning of ‘P + Q’ is, informally, “to be in the relation expressed by P to some potential complete answer to Q”. We show that this rule allows us to derive veridical and non-veridical readings of embedded questions, depending on whether the embedding verb is veridical or not, and provide novel empirical evidence supporting the generalization. We then enrich our basic proposal to account for the presuppositions induced by the embedding verbs, as well as for the generation of intermediate exhaustive readings of embedded questions

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

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.

This paper propounds a systematic examination of the link between the Knower Paradox and provability interpretations of modal logic. The aim of the paper is threefold: to give a streamlined presentation of the Knower Paradox and related results; to clarify the notion of a syntactical treatment of modalities; finally, to discuss the kind of solution that modal provability logic provides to the Paradox. I discuss the respective strength of different versions of the Knower Paradox, both in the framework of first-order arithmetic and in that of modal logic with fixed point operators. It is shown that the notion of a syntactical treatment of modalities is ambiguous between a self-referential treatment and a metalinguistic treatment of modalities, and that these two notions are independent. I survey and compare the provability interpretations of modality respectively given by Skyrms, B. (1978, The Journal of Philosophy 75: 368–387) Anderson, C.A. (1983, The Journal of Philosophy 80: 338–355) and Solovay, R. (1976, Israel Journal of Mathematics 25: 287–304). I examine how these interpretations enable us to bypass the limitations imposed by the Knower Paradox while preserving the laws of classical logic, each time by appeal to a distinct form of hierarchy.

In “Facts: Particulars of Information Units?”, Kratzer proposed a causal analysis of knowledge in which knowledge is defined as a form of de re belief of facts. In support of Kratzer’s view, I show that a certain articulation of the de re/de dicto distinction can be used to integrally account for the original pair of Gettier cases. In contrast to Kratzer, however, I think such an account does not fundamentally require a distinction between facts and true propositions. I then discuss whether this account might be generalized and whether it can give us a reductive analysis of knowledge as de re true belief. Like Kratzer, I think it will not, in particular the distinction appears inadequate to account for Ginet-Goldman cases of causally connected but unreliable belief. Nevertheless, I argue that the de re belief analysis allows us to account for a distinction Starmans and Friedman recently introduced between apparent evidence and authentic evidence in their empirical study of Gettier cases, in a way that questions their claim that a causal disconnect is not operative in the contrasts they found.

The aim of the present paper is to understand what the notions of explanation and prediction in contemporary linguistics mean, and to compare various aspects that the notion of explanation encompasses in that domain. The paper is structured around an opposition between three main styles of explanation in linguistics, which I propose to call ‘grammatical’, ‘functional’, and ‘historical’. Most of this paper is a comparison between these different styles of explanations and their relations. A second, more methodological aspect this paper seeks to clarify concerns the extent to which linguistic explanations can be viewed as predictive, rather than merely descriptive, and the problem of whether linguistic explanations ought to be causal, rather than noncausal. I argue that the notion of prediction is equally applicable in linguistics as in other empirical sciences. The extent to which the computational model of generative syntax can be viewed as providing a causal or psychologically realist model of language is more controversial.

Résumé — Toute vérité est-elle connaissable en principe ? Une réponse négative à cette question suit d’un argument logique dû à F. Fitch, voisin du paradoxe de Moore, et connu sous le nom de paradoxe de la connaissabilité. Le paradoxe de Fitch constitue un obstacle à la conception antiréaliste de la vérité et, plus généralement, semble-t-il, à l’idéal positiviste d’après lequel toute vérité devrait nous être accessible en principe. Dans cet article, j’examine différentes tentatives pour préserver le principe selon lequel toute vérité est connaissable, chacune inspirée d’une forme propre d’antiréalisme . Ces différentes approches sont comparées à une conception réaliste du positivisme, évoquée récemment par Burgess, qui postulerait seulement que toute vérité nécessaire est connaissable. Selon cette conception, certaines vérités contingentes sont effectivement inconnaissables, mais l’accessibilité de principe des vérités nécessaires demeure suffisante pour garantir la confiance positiviste dans la science.— Are all truths knowable ? A negative answer to this question follows from a logical argument related to the Moore Paradox and due to F. Fitch, also known as Fitch’s Knowability Paradox. Fitch’s paradox is widely considered to be an obstacle to the antirealist conception of truth, but even for a realist, it appears to threaten the positivist faith in the accessibility of all truths to our minds. In this paper, I first review different strategies to circumvent the paradox, each of them inspired by a different form of antirealism . I then compare these approaches to a realist version of positivism, discussed recently by Burgess, which would only postulate that all necessary truths are knowable. On that view, some contingent truths are indeed unknowable, but the idea that all necessary truths are within our reach remains sufficient to maintain the positivist faith in scientific knowledge

Adams’ thesis is generally agreed to be linguistically compelling for simple conditionals with factual antecedent and consequent. We propose a derivation of Adams’ thesis from the Lewis- Kratzer analysis of if-clauses as domain restrictors, applied to probability operators. We argue that Lewis’s triviality result may be seen as a result of inexpressibility of the kind familiar in generalized quantifier theory. Some implications of the Lewis- Kratzer analysis are presented concerning the assignment of probabilities to compounds of conditionals.

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)

In chapter 5 of Knowledge and its Limits, T. Williamson formulates an argument against the principle (KK) of epistemic transparency, or luminosity of knowledge, namely “that if one knows something, then one knows that one knows it”. Williamson’s argument proceeds by reductio: from the description of a situation of approximate knowledge, he shows that a contradiction can be derived on the basis of principle (KK) and additional epistemic principles that he claims are better grounded. One of them is a reflective form of the margin for error principle defended by Williamson in his account of knowledge. We argue that Williamson’s reductio rests on the inappropriate identification of distinct forms of knowledge. More specifically, an important distinction between perceptual knowledge and non-perceptual knowledge is wanting in his statement and analysis of the puzzle. We present an alternative account of this puzzle, based on a modular conception of knowledge: the (KK) principle and the margin for error principle can coexist, provided their domain of application is referred to the right sort of knowledge.

In a previous paper (see ‘Tolerant, Classical, Strict’, henceforth TCS) we investigated a semantic framework to deal with the idea that vague predicates are tolerant, namely that small changes do not affect the applicability of a vague predicate even if large changes do. Our approach there rests on two main ideas. First, given a classical extension of a predicate, we can define a strict and a tolerant extension depending on an indifference relation associated to that predicate. Second, we can use these notions of satisfaction to define mixed consequence relations that capture non-transitive tolerant reasoning. Although we gave some empirical motivation for the use of strict and tolerant extensions, making use of them commits us to the view that sentences of the form ‘ p∨¬p ’ and ‘ p∧¬p ’ are not automatically valid or unsatisfiable, respectively. Some philosophers might take this commitment as a negative outcome of our previous proposal. We think, however, that the general ideas underlying our previous approach to vagueness can be implemented in a variety of ways. This paper explores the possibility of defining mixed notions of consequence in the more classical super/sub-valuationist setting and examines to what extent any of these notions captures non-transitive tolerant reasoning.

In a recent paper, Barrio, Tajer and Rosenblatt establish a correspondence between metainferences holding in the strict-tolerant logic of transparent truth ST+ and inferences holding in the logic of paradox LP+. They argue that LP+ is ST+’s external logic and they question whether ST+’s solution to the semantic paradoxes is fundamentally different from LP+’s. Here we establish that by parity of reasoning, ST+ can be related to LP+’s dual logic K3+. We clarify the distinction between internal and external logic and argue that while ST+’s nonclassicality can be granted, its self-dual character does not tie it to LP+ more closely than to K3+.

The principle of tolerance characteristic of vague predicates is sometimes presented as a soft rule, namely as a default which we can use in ordinary reasoning, but which requires care in order to avoid paradoxes. We focus on two ways in which the tolerance principle can be modeled in that spirit, using special consequence relations. The first approach relates tolerant reasoning to nontransitive reasoning; the second relates tolerant reasoning to nonmonotonic reasoning. We compare the two approaches and examine three specific consequence relations in relation to those, which we call: strict-to-tolerant entailment, pragmatic-to-tolerant entailment, and pragmatic-to-pragmatic entailment. The first two are nontransitive, whereas the latter two are nonmonotonic.

In this paper we investigate a semantics for first-order logic originally proposed by R. van Rooij to account for the idea that vague predicates are tolerant, that is, for the principle that if x is P, then y should be P whenever y is similar enough to x. The semantics, which makes use of indifference relations to model similarity, rests on the interaction of three notions of truth: the classical notion, and two dual notions simultaneously defined in terms of it, which we call tolerant truth and strict truth. We characterize the space of consequence relations definable in terms of those and discuss the kind of solution this gives to the sorites paradox. We discuss some applications of the framework to the pragmatics and psycholinguistics of vague predicates, in particular regarding judgments about borderline cases.