I present a puzzle concerning counterfactual reasoning and argue that it should be solved by giving up the principle of substitution for logical equivalents.

I advance a new theory of causal relevance, according to which causal claims convey information about conditional probability functions. This theory is motivated by the problem of disjunctive factors, which haunts existing probabilistic theories of causation. After some introductory remarks, I present in Section 3 a sketch of Eells's (1991) probabilistic theory of causation, which provides the framework for much of the discussion. Section 4 explains how the problem of disjunctive factors arises within this framework. After rejecting three proposed solutions, (...) I offer in Section 6 a new approach to causation that avoids the problem. Decision-theoretic considerations also support the new approach. Section 8 develops the consequences of the new theory for causal explanation. The resulting theory of causal explanation incorporates the new insights while respecting important work on scientific explanation by Salmon (1971), Railton (1981), and Humphreys (1989). My conclusions are enumerated in Section 9. (shrink)

A logic is called 'paraconsistent' if it rejects the rule called 'ex contradictione quodlibet', according to which any conclusion follows from inconsistent premises. While logicians have proposed many technically developed paraconsistent logical systems and contemporary philosophers like Graham Priest have advanced the view that some contradictions can be true, and advocated a paraconsistent logic to deal with them, until recent times these systems have been little understood by philosophers. This book presents a comprehensive overview on paraconsistent logical systems to change (...) this situation. The book includes almost every major author currently working in the field. The papers are on the cutting edge of the literature some of which discuss current debates and others present important new ideas. The editors have avoided papers about technical details of paraconsistent logic, but instead concentrated upon works that discuss more 'big picture' ideas. Different treatments of paradoxes takes centre stage in many of the papers, but also there are several papers on how to interpret paraconistent logic and some on how it can be applied to philosophy of mathematics, the philosophy of language, and metaphysics. (shrink)

I will describe the logics of a range of conditionals that behave like conditional probabilities at various levels of probabilistic support. Families of these conditionals will be characterized in terms of the rules that their members obey. I will show that for each conditional, →, in a given family, there is a probabilistic support level r and a conditional probability function P such that, for all sentences C and B, 'C → B' holds just in case P[B | C] ≥ (...) r. Thus, each conditional in a given family behaves like conditional probability above some specific support level. (shrink)

The natural interpretation of counterfactuals with disjunctive antecedents involves selecting from each of the disjuncts the worlds that come closest to the world of evaluation. It has been long noticed that capturing this interpretation poses a problem for a minimal change semantics for counterfactuals, because selecting the closest worlds from each disjunct requires accessing the denotation of the disjuncts from the denotation of the disjunctive antecedent, which the standard boolean analysis of or does not allow (Creary and Hill, Philosophy of (...) Science 43:341–344, 1975; Nute, Journal of Philosophy 72:773–778, 1975; Fine, Mind 84(335):451–458, 1975; Ellis et al. Journal of Philosophical Logic 6:335–357, 1977). This paper argues that the failure to capture the natural interpretation of disjunctive counterfactuals provides no reason to abandon a minimal change semantics. It shows that the natural interpretation of disjunctive counterfactuals is expected once we refine our assumptions about the semantics of or and the logical form of conditionals, and (i) we assume that disjunctions introduce propositional alternatives in the semantic derivation, in line with independently motivated proposals about the semantics of or (Aloni, 2003a; Simons, Natural Language Semantics 13:271–316, 2005; Alonso-Ovalle, Disjunction in Alternative Semantics. PhD thesis, 2006); and (ii) we treat conditionals as correlative constructions, as advocated in von Fintel (1994), Izvorski (Proceedings of NELS 26, 1996), Bhatt and Pancheva (2006), and Schlenker (2004). (shrink)

This paper calls for a re-appraisal of McGee's analysis of the semantics, logic and probabilities of indicative conditionals presented in his 1989 paper Conditional probabilities and compounds of conditionals. The probabilistic measures introduced by McGee are given a new axiomatisation built on the principle that the antecedent of a conditional is probabilistically independent of the conditional and a more transparent method of constructing such measures is provided. McGee's Dutch book argument is restructured to more clearly reveal that it introduces a (...) novel contribution to the epistemology of semantic indeterminacy, and shows that its more controversial implications are unavoidable if we want to maintain the Ramsey Test along with the standard laws of probability. Importantly, it is shown that the counterexamples that have been levelled at McGee's analysis|generating a rather wide consensus that it yields `unintuitive' or `wrong' probabilities for compounds |fail to strike at their intended target; for to honour the intuitions of the counterexamples one must either give up the Ramsey Test or the standard laws of probability. It will be argued that we need to give up neither if we take the counterexamples as further evidence that the indicative conditional sometimes allows for a non-epistemic `causal' interpretation alongside its usual epistemic interpretation. (shrink)

The connection between the probabilities of conditionals and the corresponding conditional probabilities has long been explored in the philosophical literature, but its implementation faces both technical obstacles and objections on empirical grounds. In this paper I ?rst outline the motivation for the probabilistic turn and Lewis’ triviality results, which stand in the way of what would seem to be its most straightforward implementation. I then focus on Richard Jeffrey’s ’random-variable’ approach, which circumvents these problems by giving up the notion that (...) conditionals denote propositions in the usual sense. Even so, however, the random-variable approach makes counterintuitive predictions in simple cases of embedded conditionals. I propose to address this problem by enriching the model with an explicit representation of causal dependencies. The addition of such causal information not only remedies the shortcomings of Jeffrey’s conditional, but also opens up the possibility of a uni?ed probabilistic account of indicative and counterfactual conditionals. (shrink)

This book provides a critical examination of how the choice of what to believe is represented in the standard model of belief change. In particular the use of possible worlds and infinite remainders as objects of choice is critically examined. Descriptors are introduced as a versatile tool for expressing the success conditions of belief change, addressing both local and global descriptor revision. The book presents dynamic descriptors such as Ramsey descriptors that convey how an agent’s beliefs tend to be changed (...) in response to different inputs. It also explores sentential revision and demonstrates how local and global operations of revision by a sentence can be derived as a special case of descriptor revision. Lastly, the book examines revocation, a generalization of contraction in which a specified sentence is removed in a process that may possibly also involve the addition of some new information to the belief set. (shrink)

This open access book is a superb collection of some fifteen chapters inspired by Schroeder-Heister's groundbreaking work, written by leading experts in the field, plus an extensive autobiography and comments on the various contributions by Schroeder-Heister himself. For several decades, Peter Schroeder-Heister has been a central figure in proof-theoretic semantics, a field of study situated at the interface of logic, theoretical computer science, natural-language semantics, and the philosophy of language. -/- The chapters of which this book is composed discuss the (...) subject from a rich variety of angles, including the history of logic, the proper interpretation of logical validity, natural deduction rules, the notions of harmony and of synonymy, the structure of proofs, the logical status of equality, intentional phenomena, and the proof theory of second-order arithmetic. All chapters relate directly to questions that have driven Schroeder-Heister's own research agenda and to which he has made seminal contributions. The extensive autobiographical chapter not only provides a fascinating overview of Schroeder-Heister's career and the evolution of his academic interests but also constitutes a contribution to the recent history of logic in its own right, painting an intriguing picture of the philosophical, logical, and mathematical institutional landscape in Germany and elsewhere since the early 1970s. The papers collected in this book are illuminatingly put into a unified perspective by Schroeder-Heister's comments at the end of the book. Both graduate students and established researchers in the field will find this book an excellent resource for future work in proof-theoretic semantics and related areas. (shrink)

Judgment aggregation theory, or rather, as we conceive of it here, logical aggregation theory generalizes social choice theory by having the aggregation rule bear on judgments of all kinds instead of merely preference judgments. It derives from Kornhauser and Sager’s doctrinal paradox and List and Pettit’s discursive dilemma, two problems that we distinguish emphatically here. The current theory has developed from the discursive dilemma, rather than the doctrinal paradox, and the final objective of the paper is to give the latter (...) its own theoretical development along the line of recent work by Dietrich and Mongin. However, the paper also aims at reviewing logical aggregation theory as such, and it covers impossibility theorems by Dietrich, Dietrich and List, Dokow and Holzman, List and Pettit, Mongin, Nehring and Puppe, Pauly and van Hees, providing a uniform logical framework in which they can be compared with each other. The review goes through three historical stages: the initial paradox and dilemma, the scattered early results on the independence axiom, and the so-called canonical theorem, a collective achievement that provided the theory with its specific method of analysis. The paper goes some way towards philosophical logic, first by briefly connecting the aggregative framework of judgment with the modern philosophy of judgment, and second by thoroughly discussing and axiomatizing the ‘general logic’ built in this framework. (shrink)

This book is a sustained defense of the compatibility of the presence of idealizations in the sciences and scientific realism. So, the book is essentially a detailed response to the infamous arguments raised by Nancy Cartwright to the effect that idealization and scientific realism are incompatible.

Conditional learning, where agents learn a conditional sentence ‘If A, then B,’ is difficult to incorporate into existing Bayesian models of learning. This is because conditional learning is not uniform: in some cases, learning a conditional requires decreasing the probability of the antecedent, while in other cases, the antecedent probability stays constant or increases. I argue that how one learns a conditional depends on the causal structure relating the antecedent and the consequent, leading to a causal model of conditional learning. (...) This model extends traditional Bayesian learning by incorporating causal models into agents’ epistemic states. On this theory, conditional learning proceeds in two steps. First, an agent learns a new causal model with the appropriate relationship between the antecedent and the consequent. Then, the agent narrows down the set of possible worlds to include only those which make the conditional proposition true. This model of learning can incorporate both standard cases of Bayesian learning and the non-uniform learning required to learn conditional information. (shrink)

We offer a probabilistic model of rational consequence relations (Lehmann and Magidor, 1990) by appealing to the extension of the classical Ramsey-Adams test proposed by Vann McGee in (McGee, 1994). Previous and influential models of nonmonotonic consequence relations have been produced in terms of the dynamics of expectations (Gärdenfors and Makinson, 1994; Gärdenfors, 1993).'Expectation' is a term of art in these models, which should not be confused with the notion of expected utility. The expectations of an agent are some form (...) of belief weaker than absolute certainty. Our model offers a modified and extended version of an account of qualitative belief in terms of conditional probability, first presented in (van Fraassen, 1995). We use this model to relate probabilistic and qualitative models of non-monotonic relations in terms of expectations. In doing so we propose a probabilistic model of the notion of expectation. We provide characterization results both for logically finite languages and for logically infinite, but countable, languages. The latter case shows the relevance of the axiom of countable additivity for our probability functions. We show that a rational logic defined over a logically infinite language can only be fully characterized in terms of finitely additive conditional probability. (shrink)

In this paper, first some propositional conditional logics based on Belnap and Dunn’s useful four-valued logic of first-degree entailment are introduced semantically, which are then turned into systems of weakly and unrestrictedly connexive conditional logic. The general frame semantics for these logics makes use of a set of allowable (or admissible) extension/antiextension pairs. Next, sound and complete tableau calculi for these logics are presented. Moreover, an expansion of the basic conditional connexive logics by a constructive implication is considered, which gives (...) an opportunity to discuss recent related work, motivated by the combination of indicative and counterfactual conditionals. Tableau calculi for the basic constructive connexive conditional logics are defined and shown to be sound and complete with respect to their semantics. This semantics has to ensure a persistence property with respect to the preorder that is used to interpret the constructive implication. (shrink)

According to the Ramsey Test, conditionals reflect changes of beliefs: α > β is accepted in a belief state iff β is accepted in the minimal revision of it that is necessary to accommodate α. Since Gärdenfors’s seminal paper of 1986, a series of impossibility theorems (“triviality theorems”) has seemed to show that the Ramsey test is not a viable analysis of conditionals if it is combined with AGM-type belief revision models. I argue that it is possible to endorse that (...) Ramsey test for conditionals while staying true to the spirit of AGM. A main focus lies on AGM’s condition of Preservation according to which the original belief set should be fully retained after a revision by information that is consistent with it. I use concrete representations of belief states and (iterated) revisions of belief states as semantic models for (nested) conditionals. Among the four most natural qualitative models for iterated belief change, two are identified that indeed allow us to combine the Ramsey test with Preservation in the language containing only flat conditionals of the form α > β. It is shown, however, that Preservation for this simple language enforces a violation of Preservation for nested conditionals of the form α > (β > γ). In such languages, no two belief sets are ordered by strict subset inclusion. I argue that it has been wrong right from the start to expect that Preservation holds in languages containing nested conditionals. (shrink)

We investigate a lattice of conditional logics described by a Kripke type semantics, which was suggested by Chellas and Segerberg – Chellas–Segerberg (CS) semantics – plus 30 further principles. We (i) present a non-trivial frame-based completeness result, (ii) a translation procedure which gives one corresponding trivial frame conditions for arbitrary formula schemata, and (iii) non-trivial frame conditions in CS semantics which correspond to the 30 principles.

Building on recent work by Yale Weiss, we study conditional logics in the intuitionistic setting. We consider a number of semantic conditions which give rise, among others, to intuitionistic counterparts of Lewis’s logic VC and Stalnaker’s C2. We show how to obtain a sound and complete axiomatization of each logic arising from a combination of these conditions. On the way, we remark how, in the intuitionistic setting, certain classically equivalent principles of conditional logic come apart, and how certain logical connections (...) between different principles no longer hold. (shrink)

The distinction between rules and similarity is central to our understanding of much of cognitive psychology. Two aspects of existing research have motivated the present work. First, in different cognitive psychology areas we typically see different conceptions of rules and similarity; for example, rules in language appear to be of a different kind compared to rules in categorization. Second, rules processes are typically modeled as separate from similarity ones; for example, in a learning experiment, rules and similarity influences would be (...) described on the basis of separate models. In the present article, I assume that the rules versus similarity distinction can be understood in the same way in learning, reasoning, categorization, and language, and that a unified model for rules and similarity is appropriate. A rules process is considered to be a similarity one where only a single or a small subset of an object's properties are involved. Hence, rules and overall similarity operations are extremes in a single continuum of similarity operations. It is argued that this viewpoint allows adequate coverage of theory and empirical findings in learning, reasoning, categorization, and language, and also a reassessment of the objectives in research on rules versus similarity. Key Words: categorization; cognitive explanation; language; learning; reasoning; rules; similarity. (shrink)

Formal nonmonotonic systems try to model the phenomenon that common sense reasoners are able to “jump” in their reasoning from assumptions Δ to conclusions C without their being any deductive chain from Δ to C. Such jumps are done by various mechanisms which are strongly dependent on context and knowledge of how the actual world functions. Our aim is to motivate these jump rules as inference rules designed to optimise survival in an environment with scant resources of effort and time. (...) We begin with a general discussion and quickly move to Section 3 where we introduce five resource principles. We show that these principles lead to some well known nonmonotonic systems such as Nute’s defeasible logic. We also give several examples of practical reasoning situations to illustrate our principles. (shrink)

We point out a simple but hitherto ignored link between the theoryof updates, the theory of counterfactuals, and classical modal logic: update is a classicalexistential modality, counterfactual is a classical universalmodality, and the accessibility relations corresponding to these modalities are inverses. The Ramsey Rule (often thought esoteric) is simply an axiomatisation of this inverse relationship. We use this fact to translate between rules for updates andrules for counterfactuals. Thus, Katsuno and Mendelzons postulatesU1--U8 are translated into counterfactual rules C1--C8(Table VII), and (...) many of the familiar counterfactual rulesare translated into rules for updates (Table VIII). Ourconclusions are summarised in Table V. (shrink)

What''s computation? The received answer is that computation is a computer at work, and a computer at work is that which can be modelled as a Turing machine at work. Unfortunately, as John Searle has recently argued, and as others have agreed, the received answer appears to imply that AI and Cog Sci are a royal waste of time. The argument here is alarmingly simple: AI and Cog Sci (of the Strong sort, anyway) are committed to the view that cognition (...) is computation (or brains are computers); butall processes are computations (orall physical things are computers); so AI and Cog Sci are positively silly.I refute this argument herein, in part by defining the locutions x is a computer and c is a computation in a way that blocks Searle''s argument but exploits the hard-to-deny link between What''s Computation? and the theory of computation. However, I also provide, at the end of this essay, an argument which, it seems to me, implies not that AI and Cog Sci are silly, but that they''re based on a form of computation that is well beneath human persons. (shrink)

I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the Meyer-Mortensen (...) collapsing filter on the standard model) match with many intuitions underlying Wittgensteins philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any meaningful mathematical question. (shrink)

Richard Bradley has initiated a new debate, with Brian Hill and Jake Chandler as further participants, about the implications of a number of so-called triviality results surrounding the Ramsey test for conditionals. I comment on this debate and argue that ‘Inclusion’ and ‘Preservation’, which were originally introduced as postulates for the rational revision of factual beliefs, have little to recommend them in the first place when extended to languages containing conditionals. I question the philosophical method of postulation that was applied (...) in the new debate, and instead base my arguments on explicit representations of belief states and canonical constructions of belief state revisions. (shrink)

In this paper, I analyse a finding by Riggs and colleagues that there is a close connection between people’s ability to reason with counterfactual conditionals and their capacity to attribute false beliefs to others. The result indicates that both processes may be governed by one cognitive mechanism, though false belief attribution seems to be slightly more cognitively demanding. Given that the common denominator for both processes is suggested to be a form of the Ramsey test, I investigate whether Stalnaker’s semantic (...) theory of conditionals, which was inspired by the Ramsey test, may provide the basis for a psychologically plausible model of belief ascription. The analysis I propose will shed some new light on the developmental discrepancy between counterfactual reasoning and false belief ascription. (shrink)

Causal reasoning is one of our most central cognitive competencies, enabling us to adapt to our world. Causal knowledge allows us to predict future events, or diagnose the causes of observed facts. We plan actions and solve problems using knowledge about cause-effect relations. Without our ability to discover and empirically test causal theories, we would not have made progress in various empirical sciences. In the past decades, the important role of causal knowledge has been discovered in many areas of cognitive (...) psychology. Despite the ubiquity of causal reasoning, textbooks of cognitive psychology have neglected this growing field. The goal of The Oxford Handbook of Causal Reasoning is to fill this gap. The handbook brings together the leading researchers in the field of causal reasoning and offers state-of-the-art presentations of theories and research. It provides introductions of competing theories of causal reasoning, and discusses its role in various cognitive functions and domains. The final section presents research from neighboring fields. 1. Causal Reasoning: An Introduction Michael R. Waldmann Part I: Theories of Causal Cognition 2. Associative Accounts of Causal Cognition Mike E. Le Pelley, Oren Griffiths, and Tom Beesley 3. Rules of Causal Judgment: Mapping Statistical Information Onto Causal Beliefs José C. Perales, Andrés Catena, Antonio Cándido, and Antonio Maldonado 4. The Inferential Reasoning Theory of Causal Learning: Toward a Multi- Process Propositional Account Yannick Boddez, Jan De Houwer, and Tom Beckers 5. Causal Invariance as an Essential Constraint for Creating a Causal Representation of the World: Generalizing the Invariance of Causal Power Patricia W. Cheng and Hongjing Lu 6. The Acquisition and Use of Causal Structure Knowledge Benjamin Margolin Rottman 7. Formalizing Prior Knowledge in Causal Induction Thomas L. Griffiths 8. Causal Mechanisms Samuel G. B. Johnson and Woo-kyoung Ahn 9. Force Dynamics and Causation Phillip Wolff and Robert Thorstad 10. Mental Models and Causation P. N. Johnson- Laird and Sangeet S. Khemlani 11. Pseudocontingencies Klaus Fiedler and Florian Kutzner 12. Singular Causation David Danks 13. Cognitive Neuroscience of Causal Reasoning Joachim T. Operskalski and Aron K. Barbey Part II: Basic Cognitive Functions 14. Visual Impressions of Causality Peter White 15. Goal-Directed Actions Bernhard Hommel 16. Planning and Control Magda Osman 17. Reinforcement Learning and Causal Models Samuel J. Gershman 18. Causation and the Probability of Causal Conditionals David E. Over 19. Causal Models and Conditional Reasoning Mike Oaksford and Nick Chater 20. Concepts as Causal Models: Categorization Bob Rehder 21. Concepts as Causal Models: Induction Bob Rehder 22. Causal Explanation Tania Lombrozo and Nadya Vasilyeva 23. Diagnostic Reasoning Björn Meder and Ralf Mayrhofer 24. Inferring Causal Relations by Analogy Keith J. Holyoak and Hee-Seung Lee 25. Causal Argument Ulrike Hahn, Roland Bluhm, and Frank Zenker 26. Causality in Decision- Making York Hagmayer and Philip M. Fernbach Part III: Domains of Causal Reasoning 27. Intuitive Theories Tobias Gerstenberg and Joshua B. Tenenbaum 28. Space, Time, and Causality Marc J. Buehner 29. Causation in Legal and Moral Reasoning David A. Lagnado and Tobias Gerstenberg 30. The Role of Causal Knowledge in Reasoning About Mental Disorders Woo-kyoung Ahn, Nancy S. Kim, and Matthew S. Lebowitz 31. Causality and Causal Reasoning in Natural Language Torgrim Solstad and Oliver Bott 32. Social Attribution and Explanation Denis Hilton Part IV: Development, Phylogeny, and Culture 33. The Development of Causal Reasoning Paul Muentener and Elizabeth Bonawitz 34. Causal Reasoning in Non-Human Animals Christian Schloegl and Julia Fischer 35. Causal Cognition and Culture Andrea Bender, Sieghard Beller, and Douglas L. Medin. (shrink)

Abstract: In the course of seeking an answer to the question "How do you know you are not a zombie?" Floridi (2005) issues an ingenious, philosophically rich challenge to artificial intelligence (AI) in the form of an extremely demanding version of the so-called knowledge game (or "wise-man puzzle," or "muddy-children puzzle")—one that purportedly ensures that those who pass it are self-conscious. In this article, on behalf of (at least the logic-based variety of) AI, I take up the challenge—which is to (...) say, I try to show that this challenge can in fact be met by AI in the foreseeable future. (shrink)

We present a generalization of Segerberg's onion semantics for belief revision, in which the linearity of the spheres need not occur. The resulting logic is called broccoli logic. We provide a minimal relational logic, with a bi-modal neighborhood semantics. We then show that broccoli logic is a well-known conditional logic, the Burgess-Veltman minimal conditional logic.

This chapter presents a new semantics for inductive empirical knowledge. The epistemic agent is represented concretely as a learner who processes new inputs through time and who forms new beliefs from those inputs by means of a concrete, computable learning program. The agent’s belief state is represented hyper-intensionally as a set of time-indexed sentences. Knowledge is interpreted as avoidance of error in the limit and as having converged to true belief from the present time onward. Familiar topics are re-examined within (...) the semantics, such as inductive skepticism, the logic of discovery, Duhem’s problem, the articulation of theories by auxiliary hypotheses, the role of serendipity in scientific knowledge, Fitch’s paradox, deductive closure of knowability, whether one can know inductively that one knows inductively, whether one can know inductively that one does not know inductively, and whether expert instruction can spread common inductive knowledge—as opposed to mere, true belief—through a community of gullible pupils. (shrink)

The problem of finding sufficient doxastic conditions for backward induction in games of perfect information is analyzed in a syntactic framework with subjunctive conditionals. This allows to describe the structure of the game by a logical formula and consequently to treat beliefs about this structure in the same way as beliefs about rationality. A backward induction and a non-Nash equilibrium result based on higher level belief in rationality and the structure of the game are derived.

The purpose of this paper is to argue that the hybrid formalism fits naturally in the context of David Lewis’s counterfactual logic and that its introduction into this framework is desirable. This hybridization enables us to regard the inference “The pig is Mary; Mary is pregnant; therefore the pig is pregnant” as a process of updating local information (which depends on the given situation) by using global information (independent of the situation). Our hybridization also has the following technical advantages: (i) (...) it preserves the completeness and decidability of Lewis’s logic; (ii) it allows us to characterize the Limit Assumption as a proof-rule with some side-conditions; and (iii) it enables us to establish a general Kripke completeness result by using the proof-rule corresponding to the Limit Assumption. Keywords Counterfactual logic - David Lewis - Contextually definite description - Hybrid logic - Arthur Prior - The limit assumption - Strong completeness - Decidability - Bisimulation - Pure completeness. (shrink)

Reductionists say things like: all mental properties are physical properties; all normative properties are natural properties. I argue that the only way to resist reductionism is to deny that causation is difference making (thus making the epistemology of causation a mystery) or to deny that properties are individuated by their causal powers (thus making properties a mystery). That is to say, unless one is happy to deny supervenience, or to trivialize the debate over reductionism. To show this, I argue that (...) if properties are individuated by their causal powers then, surprisingly, properties are individuated by necessary co-exemplification. (shrink)

Drawing inspiration from Lakatos’s philosophy of science, the paper presents a notion of intertheory explanation that is suitable to explain, from the point of view of a successor theory, its predecessor theory’s success (where it is successful) as well as the latter’s failure (where it fails) at the same time. A variation of the Ramsey-test is used, together with a standard AGM belief revision model, to give a semantics for open and counterfactual conditionals and ’because’-sentences featuring in such intertheory explanations. (...) Pre-theoretically described idealizing assumptions play a crucial role in this model, especially when the predecessor theory and the successor theory contradict each other. (shrink)

The most widespread models of rational reasoners (the model based on modal epistemic logic and the model based on probability theory) exhibit the problem of logical omniscience. The most common strategy for avoiding this problem is to interpret the models as describing the explicit beliefs of an ideal reasoner, but only the implicit beliefs of a real reasoner. I argue that this strategy faces serious normative issues. In this paper, I present the more fundamental problem of logical omnipotence, which highlights (...) the normative content of the problem of logical omniscience. I introduce two developments of the notion of implicit belief (accessible and stable belief ) and use them in two versions of the most common strategy applied to the problem of logical omnipotence. (shrink)

This paper presents an axiomatization of a class of set-theoretic conditional operators using minimization of the geodesic distance defined as the shortest path generated by the accessibility relation on a frame. The objective of this modeling is to define conditioning based on a notion of similarity generated by degrees of indistinguishability.

We define intuitionistic subatomic natural deduction systems for reasoning with elementary would-counterfactuals and causal since-subordinator sentences. The former kind of sentence is analysed in terms of counterfactual implication, the latter in terms of factual implication. Derivations in these modal proof systems make use of modes of assumptions which are sensitive to the factuality status of the formula that is to be assumed. This status is determined by means of the reference proof system on top of which a modal proof system (...) is defined. The introduction and elimination rules for counterfactual (resp. factual) implication draw on this status. It is shown that derivations in the systems normalize and that normal derivations have the subexpression/subformula property. An intuitionistically acceptable proof-theoretic semantics is formulated in terms of canonical derivations. The systems are applied to so-called counterpossibles and to related constructions. (shrink)

In "Backward causation and the Stalnaker-Lewis approach to counterfactuals," Analysis 62 (2002): 191–97, Michael Tooley argues that if a certain kind of backward causation is possible, then a Stalnaker-Lewis style comparative world similarity account of the truth conditions of counterfactuals cannot be sound. Tooley’s target is one particular type of semantics, but, as I show, the significance of Tooley’s example goes well beyond its consequences for any one semantics for the conditional.

The gist of modal epistemology is expressed in the idea that you fail to know if you do believe truly but it is seriously possible for you to believe falsely. According to subjunctivism, this idea is captured by certain subjunctive conditionals. One formulation invokes a safety condition—“If S had believed P, then P would have been the case,” while the other invokes a sensitivity condition—“If P had been false, S would not have believed that P.” According to simple subjunctivism, such (...) conditionals do not contrapose and Sosa derives important epistemological consequences which favor safety from this difference. However, simple subjunctivism is inadequate. I return to Goodman and his analysis of factuals and propose modal stability, which is restricted sensitivity or enhanced safety as a proper epistemic condition for the non-accidental connection between the basis for the belief and the relevant facts of the matter. The idea of modal stability combines robustness (benefi ts of safety) with responsiveness to facts (benefi ts of sensitivity) and recovers the original motivation for the relevant alternatives theory—when testing for claims of knowledge that p we ask what might be the case if not-p, but we ignore irrelevant possibilities. Epistemic modal conditions should be expressed in terms of conditionals of connection which contrapose within the limits of relevance. (shrink)

This paper is about the situation in which an author (writer or speaker) presents a deductively invalid argument, but the addressee aims at a charitable interpretation and has reason to assume that the author intends to present a valid argument. How can he go about interpreting the author’s reasoning as enthymematically valid? We suggest replacing the usual find-the-missing-premise approaches by an approach based on systematic efforts to ascribe a belief state to the author against the background of which the argument (...) has to be evaluated. The suggested procedure includes rules for recording whether the author in fact accepts or denies the premises and the conclusion, as well as tests for enthymematic validity and strategies for revising belief state ascriptions. Different degrees of interpretive charity can be exercised. This is one reason why the interpretation or reconstruction of an enthymematic argument typically does not result in a unique outcome. (shrink)

\(\nabla \) -algebra is a natural generalization of Heyting algebra, unifying many algebraic structures including bounded lattices, Heyting algebras, temporal Heyting algebras and the algebraic presentation of the dynamic topological systems. In a series of two papers, we will systematically study the algebro-topological properties of different varieties of \(\nabla \) -algebras. In the present paper, we start with investigating the structure of these varieties by characterizing their subdirectly irreducible and simple elements. Then, we prove the closure of these varieties under (...) the Dedekind-MacNeille completion and provide the canonical construction and the Kripke representation for \(\nabla \) -algebras by which we establish the amalgamation property for some varieties of \(\nabla \) -algebras. In the sequel of the present paper, we will complete the study by covering the logics of these varieties and their corresponding Priestley-Esakia and spectral duality theories. (shrink)

E. J. Lowe argues that the mental event token cannot be identical to the complex neural event token for they have different counterfactual properties. If the mental event had not occurred, the behavior would not have ensued, while if the neural event had not occurred, the behavior would have ensued albeit slightly differently. Lowe's argument for the neural counterfactual relies on standard possible world semantics, whose evaluation of such counterfactuals is problematic. His argument for the mental counterfactual relies on a (...) premise that is plausibly false. My arguments support other counterfactuals, which are consistent with identity theories. (shrink)

The paper proposes a solution to the problem of counterfactuals, building on both Rescher’s epistemic and Tichý’s semantic approaches. The core of the proposed solution is the thesis that when expressing a true counterfactual, the speaker assumes a set of background indicative premises as an implicit parameter. When added tacitly to an unreal antecedent, these premises entail the consequent logically or analytically. We draw a distinction between a potentially unreal and an absolutely unreal condition expressed in the antecedent. We view (...) counterfactuals with a positive time vector and an absolute unreal condition as abbreviated deductive retrodictions. Similarly, we consider counterfactuals with a potentially unreal condition to be abbreviated deductive predictions. In a similar manner, we also explain the truth (falsity) of vacuously true counterpossibles or counterpossible conditionals. In the second part, we discuss the enigmatic backtracking counterfactuals. We propose that their negative time direction is due to their being abductive retrodictions, i.e., explanations of unreal effects based on possible causes in which the conditions remain tacit or unexpressed. The backtracking temporal direction of counterfactual abductive retrodictions is in accordance with the thesis on the positive temporal direction from cause to effect. Thus, we demonstrate that in order to explain backtracking counterfactuals, there is no need to assume violations of laws of nature or a special logic. What we need to do is to take into account the third parameter, i.e., a set of tacit or unexpressed additional propositions, as well as the principle of ceteris paribus as the background. (shrink)

This paper expounds a simple and non-trivial Ramsey Test. Drawing on the work of Peter Gärdenfors, it aims to help establish an epistemic alternative to the semantics of variably strict conditionals by Robert Stalnaker (in: Rescher (ed), Studies in logical theory, Blackwell, Oxford, 1968) and David Lewis (Counterfactuals, Blackwell, Oxford, 1973). The novelty of the present contribution lies in considering the framework of Preferred Subtheories as model of belief change upon which conditionals are defined. The resulting semantics avoids triviality in (...) the sense that a major premise of the proof of Gärdenfors’ triviality theorem is violated. (shrink)

This article is about Avicenna’s account of syllogisms comprising opposite premises. We examine the applications and the truth conditions of these syllogisms. Finally, we discuss the relation between these syllogisms and the principle of non-contradiction.

This paper is divided in five sections. Section 11.1 sketches the history of the distinction between speech act with negative content and negated speech act, and gives a general dynamic interpretation for negated speech act. “Downdate semantics” for AGM contraction is introduced in Section 11.2. Relying on semantically interpreted contraction, Section 11.3 develops the dynamic semantics for constative and directive speech acts, and their external negations. The expressive completeness for the formal variants of natural language utterances, none of which is (...) a retraction, has been proved in Section 11.4. The last section gives a laconic answer to the question posed in the title of the paper. (shrink)

In this paper we study AGM contraction and revision of rules using input/output logical theories. We replace propositional formulas in the AGM framework of theory change by pairs of propositional formulas, representing the rule based character of theories, and we replace the classical consequence operator Cn by an input/output logic. The results in this paper suggest that, in general, results from belief base dynamics can be transferred to rule base dynamics, but that a similar transfer of AGM theory change to (...) rule change is much more problematic. First, we generalise belief base contraction to rule base contraction, and show that two representation results of Hansson still hold for rule base contraction. Second, we show that the six so-called basic postulates of AGM contraction are consistent only for some input/output logics, but not for others. In particular, we show that the notorious recovery postulate can be satisfied only by basic output, but not by simple-minded output. Third, we show how AGM rule revision can be defined in terms of AGM rule contraction using the Levi identity. We highlight various topics for further research. (shrink)

In this paper, I develop a syntactic framework for the analysis ofstrategic form games that is based on a straightforward combination ofstandard systems of doxastic, probabilistic and conditionalpropositional logic. In particular, for the probabilistic part I makeuse of the axiomatization provided in Fagin and Halpern (1994). The use ofconditionals allows to represent a strategic form game by a logicalformula in a very natural way. Also expected utility maximization can benaturally captured. I use this framework to prove a version of a (...) resulton Nash equilibrium conjectures first presented in Aumann and Brandenburger (1995). (shrink)