We consider the connections between belief revision, conditional logic and nonmonotonic reasoning, using as a foundation the approach to theory change developed by Alchourrón, Gärdenfors and Makinson (the AGM approach). This is first generalized to allow the iteration of theory change operations to capture the dynamics of epistemic states according to a principle of minimal change of entrenchment. The iterative operations of expansion, contraction and revision are characterized both by a set of postulates and by Grove's construction based on total (...) pre-orders on the set of complete theories of the belief logic. We present a sound and complete conditional logic whose semantics is based on our iterative revision operation, but which avoids Gärdenfors's triviality result because of a severely restricted language of beliefs and hence the weakened scope of our extended postulates. In the second part of the paper, we develop a computational approach to theory dynamics using Rott's E-bases as a representation for epistemic states. Under this approach, a ranked E-base is interpreted as standing for the most conservative entrenchment compatible with the base, reflecting a kind of foundationalism in the acceptance of evidence for a belief. Algorithms for the computation of our iterative versions of expansion, contraction and revision are presented. Finally, we consider the relationship between nonmonotonic reasoning and both conditional logic and belief revision. Adapting the approach of Delgrande, we show that the unique extension of a default theory expressed in our conditional logic of belief revision corresponds to the most conservative belief state which respects the theory: however, this correspondence is limited to propositional default theories. Considering first order default theories, we present a belief revision algorithm which incorporates the assumption of independence of default instances and propose the use of a base logic for default reasoning which incorporates uniqueness of names. We conclude with an examination of the behavior of an implemented system on some of Lifschitz's benchmark problems in nonmonotonic reasoning. (shrink)

According to the PCCP thesis, the probability of a conditional A → C is the conditional probability P. This claim is undermined by Lewis’ triviality results, which purport to show that apart from trivial cases, PCCP is not true. In the present article we show that the only rational, “Dutch Book-resistant” extension of the agent’s beliefs concerning non-conditional sentences A and C to the conditional A → C is by assuming that P = P. In other cases a diachronic Dutch (...) Book against the agent can be constructed. There is a tension between our findings and Lewis’ results, which needs to be explained. Therefore, we present a probability space which corresponds in a natural way to the diachronic Dutch Book—and which allows the conditional A → C to be interpreted as an event in a mathematically sound way. It also allows to formalize the notion of conditionalizing A → C on ¬C which plays a crucial role in Lewis’ proof. Our conclusion is that Lewis’ proof is circular, so it cannot be considered to be a sound argument against PCCP. (shrink)

We define a model for computing probabilities of right-nested conditionals in terms of graphs representing Markov chains. This is an extension of the model for simple conditionals from Wójtowicz and Wójtowicz. The model makes it possible to give a formal yet simple description of different interpretations of right-nested conditionals and to compute their probabilities in a mathematically rigorous way. In this study we focus on the problem of the probabilities of conditionals; we do not discuss questions concerning logical and metalogical (...) issues such as setting up an axiomatic framework, inference rules, defining semantics, proving completeness, soundness etc. Our theory is motivated by the possible-worlds approach ; however, our model is generally more flexible. In the paper we focus on right-nested conditionals, discussing them in detail. The graph model makes it possible to account in a unified way for both shallow and deep interpretations of right-nested conditionals. In particular, we discuss the status of the Import-Export Principle and PCCP. We briefly discuss some methodological constraints on admissible models and analyze our model with respect to them. The study also illustrates the general problem of finding formal explications of philosophically important notions and applying mathematical methods in analyzing philosophical issues. (shrink)

We define a semantics for conditionals in terms of stochastic graphs which gives a straightforward and simple method of evaluating the probabilities of conditionals. It seems to be a good and useful method in the cases already discussed in the literature, and it can easily be extended to cover more complex situations. In particular, it allows us to describe several possible interpretations of the conditional and to formalize some intuitively valid but formally incorrect considerations concerning the probabilities of conditionals under (...) these two interpretations. It also yields a powerful method of handling more complex issues. The stochastic graph semantics provides a satisfactory answer to Lewis’s arguments against the PC = CP principle, and defends important intuitions which connect the notion of probability of a conditional with the notion of conditional probability. It also illustrates the general problem of finding formal explications of philosophically important notions and applying mathematical methods in analyzing philosophical issues. (shrink)

In this paper we introduce a theoretical framework and a logical application for analysing the semantics and pragmatics of contrastive conjunctions in natural language. It is shown how expressions like although, nevertheless, yet, and but are semantically definable as connectives using an operator for implication in natural language and how similar pragmatic principles affect the behaviour of both contrastive conjunctions and indicative conditionals. Following previous proposals, conditions on contrast in a conjunction are analysed as presuppositions of die conjunction. Further linguistic (...) evidence leads to a distinction between restrictive and non-restrictive connectives of contrast, and consequently between direct and indirect contrast, which are given a precise definition. A general interface for a theory of contrast using possible world semantics for implication is then presented. As a test case, we show how this interface is applicable to the semantics for conditionals that was introduced by Veltman in his article 'Data semantics and the pragmatics of indicative conditionals' (1986). This application yields an extension of Veltman's Data Logic, called Contrastive Data Logic Once appropriate modifications are added to Veltman's pragmatic considerations, we show that contrastive data logic provides an adequate tool for the analysis of substantial linguistic data concerning contrast and implication in natural language. (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)

This paper offers a unified semantic explanation of two observations that prove to be problematic for classical analyses of modals, conditionals, and disjunctions: the fact that disjunctions scoping under possibility modals give rise to the free choice effect and the fact that counterfactuals license simplification of disjunctive antecedents. It shows that the data are well explained by a dynamic semantic analysis of modals and conditionals that uses ideas from the inquisitive semantic tradition in its treatment of disjunction. The analysis explains (...) why embedding a disjunctive possibility under negation reverts disjunction to its classical behavior, is general enough to predict less studied simplification patterns, and also makes progress toward a unified perspective on the distinction between informative, inquisitive, and attentive content. (shrink)

When does a developing human being acquire moral status? I outline three different positions based on substance ontology that attempt to solve the question by locating some morally salient event in the process of human development question. In the second section, I consider some specific empirical objections to one of these positions, refute them, and then show how similar objections and responses would generalize to the other substance-based positions on the question. The crucial finding is that all the attempts to (...) answer the question that involve substance ontology need to appeal to dispositions. (shrink)

A prominent contemporary anti-skeptical strategy, most famously articulated by Keith DeRose, aims to cage the skeptic′s doubts by contextualizing subjunctive conditional accounts of knowledge through a conversational rule of sensitivity. This strategy, I argue, courts charges of circularity by selectively invoking heavy counterfactual machinery. The reason: such invocation threatens to utilize a metric for modal comparison that is implicitly informed by judgments of epistemic sameness. This gives us reason to fear that said modal metric is selectively cherry-picked in advance to (...) support the very anti-skeptical conclusion for which the contextualist longs. (shrink)

I argue that Moore's propositions, for example, 'I went to the pictures last Tuesday but I don't believe that I did' cannot be rationally believed. Their assertors either cannot be rationally believed or cannot be believed to be rational. This analysis is extended to Moorean propositions such as God knows that I am an atheist and I believe that this proposition is false. I then defend the following definition of assertion: anyone asserts that p iff that person expresses a belief (...) that p with the intention of causing relevant epistemic change in the cognition of an actual or potential audience. (shrink)

The Local Computation Framework has been used to improve the efficiency of computation in various uncertainty formalisms. This paper shows how the framework can be used for the computation of logical deduction in two different ways; the first way involves embedding model structures in the framework; the second, and more direct, way involves embedding sets of formulae. This work can be applied to many of the logics developed for different kinds of reasoning, including predicate calculus, modal logics, possibilistic logics, probabilistic (...) logics and non-monotonic logics. (shrink)

Lewis (1973) gave a short argument against conditional excluded middle, based on his treatment of ‘might’ counterfactuals. Bennett (2003), with much of the recent literature, gives an alternative take on ‘might’ counterfactuals. But Bennett claims the might-argument against CEM still goes through. This turns on a specific claim I call Bennett’s Hypothesis. I argue that independently of issues to do with the proper analysis of might-counterfactuals, Bennett’s Hypothesis is inconsistent with CEM. But Bennett’s Hypothesis is independently objectionable, so we should (...) resolve this tension by dropping the Hypothesis, not by dropping CEM. (shrink)

The paper clarifies and defends the orthodox view that counterfactual conditionals with impossible antecedents are vacuously true against recent criticisms. It argues that apparent counterexamples to orthodoxy result from uncritical reliance on a fallible heuristic used in the processing of conditionals. A comparison is developed between such counterpossibles and vacuously true universal generalizations.

Writers such as Stalnaker and Dummett have argued that specific features of subjunctive conditional statements undermine the principle of bivalence. This, paper is concerned with rebutting such claims. 1. It is shown how subjective conditionals pose a prima facie threat to bivalence, and how this threat can be dissolved by a distinction between the results of negating a subjective conditional and of negating its consequent. To make this distinction is to side with Lewis against Stalnaker in a dispute about possible (...) worlds semantics for such conditionals, and reasons are given for doing so. 2. These arguments are extended to answer Dummett''s claim that behaviourist and phenomenalist analyses in terms of subjunctive conditions violate bivalence. This answer is shown to be compatible with the principle that hypothetical statements are true only in virtue of categorical facts. (shrink)

The quality of philosophical diagnosis within the philosophy of science will be greatly improved if the original distinctions of applied mathematics are employed instead of the inadequate substitutes provided by the logical empiricists. The problem of evaluating counterfactual claims is examined from this point of view.

Iterated conditionals of the form If p, then if q, r are an important topic in philosophical logic. In recent years, psychologists have gained much knowledge about how people understand simple conditionals, but there are virtually no published psychological studies of iterated conditionals. This paper presents experimental evidence from a study comparing the iterated form, If p, then if q, r with the “imported,” noniterated form, If p and q, then r, using a probability evaluation task and a truth-table task, (...) and taking into account qualitative individual differences. This allows us to critically contrast philosophical and psychological approaches that make diverging predictions regarding the interpretation of these forms. The results strongly support the probabilistic Adams conditional and the “new paradigm” that takes this conditional as a starting point. (shrink)

In this paper, we explore the idea that sets depend on, or are grounded in, their members. It is said that a set depends on each of its members, and not vice versa. Members do not depend on the sets that they belong to. We show that the intuitive modal truth conditions for dependence, given in terms of possible worlds, do not accurately capture asymmetric dependence relations between sets and their members. We extend the modal truth conditions to include impossible (...) worlds and give a more satisfactory account of the dependence of a set on its members. Focusing on the case of singletons, we articulate a logical framework in which to evaluate set-theoretic dependence claims, using a normal first-order modal logic. We show that on this framework the dependence of a singleton on its single members follows from logic alone. However, the converse does not hold. (shrink)

Recent methodological debates regarding the place of feasibility considerations in normative political theory are hindered for want of a rigorous model of the feasibility frontier. To address this shortfall, I present an analysis of feasibility that generalizes the economic concept of a production possibility frontier and then develop a rigorous model of the feasibility frontier using the familiar possible worlds technology. I then show that this model has significant methodological implications for political philosophy. On the Target View, a political ideal (...) presents a long-term goal for morally progressive reform efforts and, thus, serves as an important reference point for our specification of normative political principles. I use the model to show that we can- not reasonably expect that adopting political ideals as long-term reform objectives will guide us toward the realization of morally optimal feasible states of affairs. I conclude by proposing that political philosophers turn their attention to the analysis of actual social failures rather than political ideals. (shrink)

The principle of plenitude says that every material object coincides with abundantly many further objects that differ in their modal profiles. A necessarily unmanifested disposition is a disposition that necessarily does not manifest. This paper argues that if the principle of plenitude holds, then there are some necessarily unmanifested dispositions. These necessarily unmanifested dispositions will be argued to evade some objections against the cases of necessarily unmanifested dispositions put forward by Carrie Jenkins and Daniel Nolan.

Judgment aggregation studies how to aggregate individual judgments on logically correlated propositions into collective judgments. Different logics can be used in judgment aggregation, for which Dietrich and Mongin have proposed a generalized model based on general logics. Despite its generality, however, all nonmonotonic logics are excluded from this model. This paper argues for using nonmonotonic logic in judgment aggregation. Then it generalizes Dietrich and Mongin’s model to incorporate a large class of nonmonotonic logics. This generalization broadens the theoretical boundaries of (...) judgment aggregation by proving that, even if these nonmonotonic logics are employed, certain typical impossibility results still hold. (shrink)

The object of this paper is to examine two approaches to giving non-vacuous truth conditions for counterpossibles, counterfactuals with impossible antecedents. I first develop modifications of a Lewis-style sphere semantics with impossible worlds. I argue that this approach sanctions intuitively invalid inferences and is supported by philosophically problematic foundations. I then develop modifications of certain ceteris paribus conditional logics with impossible worlds. Tableaux are given for each of these in an appendix and soundness and completeness results are proved. While certain (...) of the latter systems are shown to have similar problems to logics from the first approach, at least one relatively weak system appears to offer an adequate uniform semantics for counterpossibles and counterfactuals. (shrink)

The object of this paper is to examine half and full connexive extensions of the basic regular conditional logic CR. Extensions of this system are of interest because it is among the strongest well-known systems of conditional logic that can be augmented with connexive theses without inconsistency resulting. These connexive extensions are characterized axiomatically and their relations to one another are examined proof-theoretically. Subsequently, algebraic semantics are given and soundness, completeness, and decidability are proved for each system. The semantics is (...) also used to establish independence results. Finally, a deontic interpretation of one of the systems is examined and defended. (shrink)

Conditional logics have traditionally been intended to formalize various intuitively correct modes of reasoning involving conditional expressions in natural language. Although conditional logics have by now been thoroughly studied in a classical context, they have yet to be systematically examined in an intuitionistic context, despite compelling philosophical and technical reasons to do so. This paper addresses this gap by thoroughly examining the basic intuitionistic conditional logic ICK, the intuitionistic counterpart of Chellas’ important classical system CK. I give ICK both worlds (...) semantics and algebraic semantics, and prove that these are equivalent. I give a Gödel-type embedding of ICK into CK and a Glivenko-type embedding of CK into ICK. I axiomatize ICK and prove soundness, completeness, and decidability results. Finally, I discuss extending ICK. (shrink)

A world is trivial if it makes every proposition true all at once. Such a world is impossible, an absurdity. Our world, we hope, is not an absurdity. It is important, nevertheless, for semantic and metaphysical theories that we be able to reason cogently about absurdities—if only to see that they are absurd. In this note we describe methods for ‘observing’ absurd objects like the trivial world without falling in to incoherence, using some basic techniques from modal logic. The goal (...) is to begin to locate the trivial world’s relative position in modal space; the outcome is that the less we assume about relative possibility, the more detail we can discern at the edge of reason. (shrink)

We present an approach to combining three areas of research which we claim are all based on information theory: knowledge representation in Artificial Intelligence and Cognitive Science using prototypes, plans, or schemata; formal semantics in natural language, especially the semantics of the `if-then' conditional construct; and the logic of subjunctive conditionals first developed using a possible worlds semantics by Stalnaker and Lewis. The basic premise of the paper is that both schema-based inference and the semantics of conditionals are based on (...) Dretske's notion of information flow and Barwise and Perry's notion of a constraint in situation semantics. That is, the connection between antecedent and consequent of a conditional `if were the case then would be the case' is an informational relation holding with respect to a pragmatically determined utterance situation. The bridge between AI and conditional logic is that a prototype or planning schema represents a situation type, and the background assumptions underlying the application of a schema in a situation correspond to channel conditions on the flow of information. Adapting the work of Stalnaker and Lewis, the semantics of conditionals is modeled by a refinement ordering on situations: a conditional `if then ' holds with respect to a situation if all the minimal refinements of the situation that support also support . We present new logics of situations, information flow, and subjunctive conditionals based on three-valued partial logic that formalizes our approach, and conclude with a discussion of the resulting theory of conditionals, including the "paradoxes" of conditional implication, the difference between truth conditions and assertability conditions for subjunctive conditionals, and the relationship between subjunctive and indicative conditionals. (shrink)

Necessity and sufficiency are the building blocks of all successful explanations. Yet despite their importance, these notions have been conceptually underdeveloped and inconsistently applied in explainable artificial intelligence, a fast-growing research area that is so far lacking in firm theoretical foundations. In this article, an expanded version of a paper originally presented at the 37th Conference on Uncertainty in Artificial Intelligence, we attempt to fill this gap. Building on work in logic, probability, and causality, we establish the central role of (...) necessity and sufficiency in XAI, unifying seemingly disparate methods in a single formal framework. We propose a novel formulation of these concepts, and demonstrate its advantages over leading alternatives. We present a sound and complete algorithm for computing explanatory factors with respect to a given context and set of agentive preferences, allowing users to identify necessary and sufficient conditions for desired outcomes at minimal cost. Experiments on real and simulated data confirm our method’s competitive performance against state of the art XAI tools on a diverse array of tasks. (shrink)

David Lewis has long defended an analysis of counterfactuals in terms of comparative similarity of possible worlds. The purpose of this paper is to reevaluate Lewis’s response to one of the oldest and most familiar objections to this proposal, the future similarity objection.

This paper formulates a general epistemological argument against what I call non-causal realism, generalizing domain specific arguments by Benacerraf, Field, and others. First I lay out the background to the argument, making a number of distinctions that are sometimes missed in discussions of epistemological arguments against realism. Then I define the target of the argument—non-causal realism—and argue that any non-causal realist theory, no matter the subject matter, cannot be given a reasonable epistemology and so should be rejected. Finally I discuss (...) and respond to several possible responses to the argument. In addition to clearing up and avoiding numerous misunderstandings of arguments of this kind that are quite common in the literature, this paper aims to present and endorse a rigorous and fully general epistemological argument against realism. (shrink)

Disagreeing with most authors on vagueness, the author proposes a solution that he calls ‘three-valued semantic pluralism’ to the age-old sorites paradox. In essence, it is a three-valued semantics for a first-order vague language with identity with the additional suggestion that a vague language has more than one correct interpretation. Unlike the traditional three-valued approach to a vague language, three-valued semantic pluralism can accommodate the phenomenon of higher-order vagueness and the phenomenon of penumbral connection when equipped with ‘suitable conditionals’. The (...) author also shows that three-valued semantic pluralism is a natural consequence of a restricted form of the Tolerance principle ) and a few related ideas, and argues that ) is well-motivated by considerations about how we learn, teach, and use vague predicates. (shrink)

Comparative syllogism is a type of scientific reasoning widely used, explicitly or implicitly, for inferences from observations to conclusions about effectiveness, but its philosophical significance has not been fully elaborated or appreciated. In its simplest form, the comparative syllogism derives a conclusion about the effectiveness of a factor (e.g. a treatment or an exposure) on a certain property via an experiment design using a test (experimental) group and a comparison (control) group. Our objective is to show that the comparative syllogism (...) can be understood as encoding a simulation view of counterfactuals, in that counterfactual situations are conceptual constructs that can be correctly simulated by homogeneous comparison groups. In this simulation view, the empirical data from the comparison groups play an evidential role in the evaluation of counterfactuals and in obtaining counterfactual knowledge. We further indicate how successful experimental designs can help us to obtain correct simulations, and thus to bring us to scientifically-empirically based counterfactual knowledge. (shrink)

I reply to Ahmed’s rejection (2011) of my argument (Walters 2009) that all counterfactuals with true antecedents and consequents are themselves true.

Is A & C sufficient for the truth of ‘if A were the case, C would be the case’? Jonathan Bennett thinks not, although the counterexample he gives is inconsistent with his own account of counterfactuals. In any case, I argue that anyone who accepts the case of Morgenbesser's coin, as Bennett does, should reject Bennett’s counterexample. Moreover, I show that the principle underlying his counterexample is unmotivated and indeed false. More generally, I argue that Morgenbesser’s coin commits us to (...) the sufficiency of A & C for the truth of the corresponding counterfactual. (shrink)

The consequence argument purports to show that determinism is true only if no one has free will. Judgments about whether the argument is sound depend on how one understands locutions of the form 'p and no one can render p false'. The main interpretation on offer appeals to counterfactual sufficiency: s can render p false just in case there is something s can do such that, were s to do it, p would be false; otherwise, s cannot render p false. (...) Here I show that, in the context of the consequence argument, this interpretation conflicts with widely endorsed principles governing the logic of counterfactuals. (shrink)

Abduction was first introduced in the epistemological context of scientific discovery. It was more recently analyzed in artificial intelligence, especially with respect to diagnosis analysis or ordinary reasoning. These two fields share a common view of abduction as a general process of hypotheses formation. More precisely, abduction is conceived as a kind of reverse explanation where a hypothesis H can be abduced from events E if H is a good explanation of E. The paper surveys four known schemes for abduction (...) that can be used in both fields. Its first contribution is a taxonomy of these schemes according to a common semantic framework based on belief revision. Its second contribution is to produce, for each non-trivial scheme, a representation theorem linking its semantic framework to a set of postulates. Its third contribution is to present semantic and axiomatic arguments in favor of one of these schemes, ordered abduction, which has never been vindicated in the literature. (shrink)

The debate over Hypothetical Syllogism is locked in stalemate. Although putative natural language counterexamples to Hypothetical Syllogism abound, many philosophers defend Hypothetical Syllogism, arguing that the alleged counterexamples involve an illicit shift in context. The proper lesson to draw from the putative counterexamples, they argue, is that natural language conditionals are context-sensitive conditionals which obey Hypothetical Syllogism. In order to make progress on the issue, I consider and improve upon Morreau’s proof of the invalidity of Hypothetical Syllogism. The improved proof (...) relies upon the semantic claim that conditionals with antecedents irrelevant to the obtaining of an already true consequent are themselves true. Moreover, this semantic insight allows us to provide compelling counterexamples to Hypothetical Syllogism that are resistant to the usual contextualist response. (shrink)

Are counterfactuals with true antecedents and consequents automatically true? That is, is Conjunction Conditionalization: if (X & Y), then (X > Y) valid? Stalnaker and Lewis think so, but many others disagree. We note here that the extant arguments for Conjunction Conditionalization are unpersuasive, before presenting a family of more compelling arguments. These arguments rely on some standard theorems of the logic of counterfactuals as well as a plausible and popular semantic claim about certain semifactuals. Denying Conjunction Conditionalization, then, requires (...) rejecting other aspects of the standard logic of counterfactuals, or else our intuitive picture of semifactuals. (shrink)

The morphological marking that distinguishes conditionals that are called “counterfactual” from those that are not, can also be found in other modal constructions, such as in the expression of wishes and oughts. We propose to call it “X-marking”. In this article, we lay out desiderata for a successful theory of X-marking and make some initial informal observations. Much remains to be done.

McCall (1984) offered a semantics of counterfactual conditionals based on “real possible worlds” that avoids using the vague notion of similarity between possible worlds. I will propose an interpretation of McCall’s counterfactuals in a formal framework based on Baltag-Moss-Solecki events and protocols. Moreover, I will argue that using this interpretation one can avoid an objection raised by Otte (1987).

In this paper I explore a version of standard (expected utility) decision theory in which the probability parameter is interpreted as an objective chance believed by agents to obtain and values of this parameter are fixed by indicative conditionals linking possible actions with possible outcomes. After reviewing some recent developments centering on the common-cause counterexamples to the standard approach, I introduce and briefly discuss the key notions in my own approach. (This approach has essentially the same results as the causal (...) approach in common-cause cases.) I then discuss the Rule of Dominance and find, in the context of the present proposal, that it cannot serve as an independent source of action justification. Turning next to Newcomb''s Problem, I argue that the much discussed issue of back-tracking counterfactuals is something of a red herring for decision theory. Once the twin distractions of back-tracking counterfactuals and Dominance Reasoning are set aside the 1-box solution emerges as a natural consequence of the present proposal. It is of interest that this proposal agrees with the causal approach in the standard common-cause examples and the expected-utility approach in the Newcomb case: one can be smart and rich and keep on smoking. (shrink)

In Spanish (and other Romance languages) certain predicates select the subjunctive mood in the embedded clause, while others select the indicative mood. In this paper, I present a new analysis for the predicates that select the subjunctive mood in Spanish that is based on a semantics of comparison. The main generalization proposed here is the following: in Spanish, a predicate selects the subjunctive mood in its embedded proposition if the proposition is compared to its contextual alternatives on a scale introduced (...) by the predicate. In this proposal, predicates that select the subjunctive mood are thus analyzed as gradable predicates. Furthermore, the subjunctive mood morpheme is claimed to make a semantic contribution, namely to evaluate the contextual alternatives that are compared by the predicate. In comparing this proposal to other approaches, I show that it can more straightforwardly account for a number of properties of these predicates (entailment relations, practical inferences, and contexts with more than two alternatives). New empirical evidence for two crucial properties of the predicates that select the subjunctive mood is provided: these predicates are focus sensitive and they are gradable, two properties that follow directly from the proposal developed here. In the vast literature on mood, the link between the appearance of the subjunctive mood and these important properties has never been made before. (shrink)

In this paper, I stress the utility of employing test-driven development (TDD) for conceiving logical systems. TDD, originally invented in the context of Extreme Programming, is a methodology widely used by software engineers to conceive and develop programs. Its main principle is to design the tests of the expected properties of the system before the development phase. I argue that this methodology is especially convenient in conceiving applied logics. Indeed, this technique is efficient with most decidable logics having a software (...) implementation. Having a clear list of the desired inferences right from the beginning makes it possible to refine the properties of the system step by step until its completion. I distinguish and detail seven advantages of the usage of TDD for the conception of a logical theory. Most importantly, this methodology increases the predictability of the inferential power of the theory. A second important benefit is that the time required for the conception of the logic goes down dramatically. This methodology will change both ideas and practices. Logic is no longer considered to be a formal science, but rather to be an empirical one. Research in the field is geared toward specific and concrete goals. Programs are considered tools used to verify the conformity of formal theories. To sum up, I defend the view that, in some situations, this way of designing a formal system brings significant benefits, and that the construction of new logics can be conducted similarly to the development of open source software. (shrink)

This article focuses on defective conditionals ? namely indicative conditionals whose antecedents are false and whose truth-values therefore cannot be determined. The problem is to decide which formal connective can adequately represent this usage. Classical logic renders defective conditionals true whereas traditional mathematics dismisses them as irrelevant. This difference in treatment entails that, at the propositional level, classical logic validates some sentences that are intuitively false in plane geometry. With two proofs, I show that the same flaw is shared by (...) a family of trivalent logics. I go on to examine the strict conditional and its derivatives. This family is the only one to avoid the faulty inference but it does so without addressing the status of the truth-value assigned to defective conditionals. (shrink)

How can we use models to understand real phenomena if models misrepresent the very phenomena we seek to understand? Some accounts suggest that models may afford understanding by providing causal knowledge about phenomena via how-possibly explanations. However, general equilibrium models, for example, pose a challenge to this solution since their contribution appears to be purely mathematical results. Despite this, practitioners widely acknowledge that it improves our understanding of the world. I argue that the Arrow–Debreu model provides a mathematical how-possibly explanation (...) which establishes claims of mathematical dependence. The account developed reveals how mathematical knowledge can inform claims about the world, allow ‘what-if-things-had-been-different’ inferences, and thus improve our understanding. (shrink)

This paper provides an update semantics for counterfactual conditionals. It does so by giving a dynamic twist to the ‘Premise Semantics’ for counterfactuals developed in Veltman (1976) and Kratzer (1981). It also offers an alternative solution to the problems with naive Premise Semantics discussed by Angelika Kratzer in ‘Lumps of Thought’ (Kratzer, 1989). Such an alternative is called for given the triviality results presented in Kanazawa et al. (2005, this issue).

InSuppose and Tell, Williamson makes a new and original attempt to defend the material conditional account of indicative conditionals. His overarching argument is that this account offers the best explanation of the data concerning how people evaluate and use such conditionals. We argue that Williamson overlooks several important alternative explanations, some of which appear to explain the relevant data at least as well as, or even better than, the material conditional account does. Along the way, we also show that Williamson (...) errs at important junctures about what exactly the relevant data are. (shrink)

The best arguments for possible worlds as states of affairs furnish us with equally good arguments for impossible worlds of the same sort. I argue for a theory of impossible worlds on which the impossible worlds correspond to maximal inconsistent classes of propositions. Three objections are rejected. In the final part of the paper, I present a menu of impossible worlds and explore some of their interesting formal properties.