- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
Add citations
You must login to add citations.
|
|
|
Philosophy and Phenomenological Research, EarlyView. |
|
|
The standard semantics for counterfactuals ensures that any counterfactual with a true antecedent and true consequent is itself true. There have been many recent attempts to amend the standard semantics to avoid this result. I show that these proposals invalidate a number of further principles of the standard logic of counterfactuals. The case against the automatic truth of counterfactuals with true components does not extend to these further principles, however, so it is not clear that rejecting the latter should be (...) |
|
|
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 (...) |
|
|
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 (...) |
|
|
I present a puzzle concerning counterfactual reasoning and argue that it should be solved by giving up the principle of substitution for logical equivalents. |
|
|
We argue that a semantics for counterfactual conditionals in terms of comparative overall similarity faces a formal limitation due to Arrow’s impossibility theorem from social choice theory. According to Lewis’s account, the truth-conditions for counterfactual conditionals are given in terms of the comparative overall similarity between possible worlds, which is in turn determined by various aspects of similarity between possible worlds. We argue that a function from aspects of similarity to overall similarity should satisfy certain plausible constraints while Arrow’s impossibility (...) |
|
|
Theorists have consistently maintained that the most plausible forms of objective consequentialism must be probabilistic if and only if indeterminism is true. This standard position, however popular, lacks sufficient motivation. Assume determinism to be true and an attempt will be made to show that attractive forms of objective consequentialism must be probabilistic - and not for reasons related to our epistemic limitations either. -/- Here it is argued that all extant objective formulations of consequentialism fail to deliver the normative implications (...) |
|
|
|
|
|
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 (...) |
|
|
Free choice permission, a crucial test case concerning the semantics/ pragmatics boundary, usually receives a pragmatic treatment. But its pragmatic features follow from its semantics. We observe that free choice inferences are defeasible, and defend a semantics of free choice permission as strong permission expressed in terms of a modal conditional in a nonmonotonic logic. |
|
|
We construct a Hilbert style system RPL for the notion of plausibility measure introduced by Halpern J, and we prove the soundness and completeness with respect to a neighborhood style semantics. Using the language of RPL, we demonstrate that it can define well-studied notions of necessity, conditionals and propositional identity. |
|
|
This paper reports completeness results for dyadic deontic logics in the tradition of Hansson’s systems. There are two ways to understand the core notion of best antecedent-worlds, which underpins such systems. One is in terms of maximality, and the other in terms of optimality. Depending on the choice being made, one gets different evaluation rules for the deontic modalities, but also different versions of the so-called limit assumption. Four of them are disentangled, and compared. The main observation of this paper (...) |
|
|
The literature on conditionals is rife with alternate formulations of the abstract semantics of conditional logic. Each formulation has its own advantages in terms of applications and generalizations; nevertheless, they are for the most part equivalent, in the sense that they underwrite the same range of logical systems. The purpose of the present note is to bring under this umbrella the partition semantics introduced by Brian Skyrms in (Skyrms, 1984). |
|
|
In this paper we focus on theorem proving for conditional logics. First, we give a detailed description of CondLean, a theorem prover for some standard conditional logics. CondLean is a SICStus Prolog implementation of some labeled sequent calculi for conditional logics recently introduced. It is inspired to the so called “lean” methodology, even if it does not fit this style in a rigorous manner. CondLean also comprises a graphical interface written in Java. Furthermore, we introduce a goal-directed proof search mechanism, (...) |
|
|
A critical review of Stenius' account of the logic of disjunctive permissions, leading to a proposal for a closely related approach in terms of "checklist conditionals". |
|
|
|
|
|
|
|
|
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 (...) |
|
|
The properties of belief revision operators are known to have an informal semantics which relates them to the axioms of conditional logic. The purpose of this paper is to make this connection precise via the model theory of conditional logic. A semantics for conditional logic is presented, which is expressed in terms of algebraic models constructed ultimately out of revision operators. In addition, it is shown that each algebraic model determines both a revision operator and a logic, that are related (...) |
|
|
This paper presents an adaptive logic enhancement of conditional logics of normality that allows for defeasible applications of Modus Ponens to conditionals. In addition to the possibilities these logics already offer in terms of reasoning about conditionals, this way they are enriched by the ability to perform default inferencing. The idea is to apply Modus Ponens defeasibly to a conditional and a fact on the condition that it is ‘safe' to do so concerning the factual and conditional knowledge at hand. (...) |
|
|
|
|
|
The idea of preserving conditional beliefs emerged recently as a new paradigm apt to guide the revision of epistemic states. Conditionals are substantially different from propositional beliefs and need specific treatment. In this paper, we present a new approach to conditionals, capturing particularly well their dynamic part as revision policies. We thoroughly axiomatize a principle of conditional preservation as an indifference property with respect to conditional structures of worlds. This principle is developed in a semi-quantitative setting, so as to reveal (...) |
|
|
RésuméOn montre d'abord que la technique de révision des probabilités appelée « imagerie », qui a été introduite par Lewis pour la logique des conditionnels de Stalnaker, peut être généralisée à la sémantique des systèmes de sphères de Lewis si l'on permet aux énoncés conditionnels d'avoir des valeurs de vérité fractionnaires. Un système est proposé. |
|
|
We show that truth conditions for counterfactuals need not always be given in terms of a vague notion of similarity. To this end, we single out the important class of historical counterfactuals and give formally rigorous truth conditions for these counterfactuals, employing a partial ordering relation called "comparative closeness" that is defined in the framework of branching space-times. Among other applications, we provide a detailed analysis of counterfactuals uttered in the context of lost bets. In an appendix we compare our (...) |
|
|
|
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6f97f49787-df84k uwo