Choi (Philosophia, 38(3), 2010) argues that my counterexamples in Lee (Philosophia, 38(3), 2010) to the simple conditional analysis of disposition ascription are bogus counterexamples. In this paper, I argue that Choi’s arguments are not satisfactory and that my examples are genuine counterexamples.

People respond to metaphors as much with regard to the emotions that they generate as to their referential, comparative contents. Interviews with non-geneticists about preferred metaphors for gene-environment interaction that illustrate this tendency are reported. These interviews also reveal the dynamic tendency of such emotional responses. A second set of interviews shows that lay people may preferentially use a metaphor of "virus" or "disease" for talking about genes, as opposed to the coding metaphors transmitted through the mass media and reportedly (...) preferred by geneticists. An explanation based on the differently situated emotions of these groups is proposed. It is proposed that the prominence of emotions in responding to genetics indicates the importance of incorporating analyses of emotions instead of simple principles into policy formulation about genetics. (shrink)

Lewis claims that Martin’s cases indeed refute the simple conditional analysis of dispositions and proposes the reformed conditional analysis that is purported to overcome them. In this paper I will first argue that Lewis’s defense of the reformed analysis can be understood to invoke the concepts of disposition-specific stimulus and manifestation. I will go on to argue that advocates of the simple analysis, just like Lewis, can also defend their analysis from alleged counterexamples including Martin’s cases by invoking (...) the concepts of disposition-specific stimulus and manifestation. This means that Lewis’s own necessary defense of the reformed analysis invalidates his motivation of it. Finally, I will argue that we have a good reason to favor the simple analysis over Lewis’s analysis. (shrink)

Among theories of personal identity over time the simple view has not been popular among philosophers, but it nevertheless remains the default view among non philosophers. It may be construed either as the view that nothing grounds a claim of personal identity over time, or that something quite simple (a soul perhaps) is the ground. If the former construal is accepted, a conspicuous difficulty is that the condition of causal dependence between person-stages is absent. But this leaves such (...) a view open to an objection from the failure to provide a condition of individuation. If, on the other hand something like a soul is said to ground personal identity over time, such an account turns out to be more suited to a kind of continuity view. (shrink)

Engineering and scientific education conditions us to expect everything, including intelligence, to have a simple, compact explanation. Accordingly, when people new to AI ask "What's AI all about," they seem to expect an answer that defines AI in terms of a few basic mathematical laws.

This paper extends the defense of a simple theory of indicative conditionals previously proposed by the author, in which the truth conditions are material, and Grice-style assertability conditions are given to explain the paradoxes of material implication. The paper discusses various apparent counter-examples to the material account in which conditionals are not asserted, and so the original theory cannot be applied; it is argued that, nevertheless, the material theory can be defended.

This paper is concerned with constraints on the interpretation of pronominal anaphora, in particular Condition B effects. It aims to contribute to a particular approach, initiated by Reinhart (Anaphora and semantic interpretation, 1983) and further developed elsewhere. It proposes a modification of Reinhart’s Interface Rule, and argues that the resulting theory compares favorably with others, while being compatible with independently motivated general hypotheses about the interaction between different interpretive mechanisms.

According to Jamie Whyte, the proper assignment of fulfilment conditions to an agent’s set of desires proceeds in three steps. First, one identifies various desire extinction and behavioural reinforcement conditions to obtain the fulfilment conditions of a certain subset of the agent’s desires. With these fulfilment conditions in hand, one then appeals to a principle connecting desire fulfilment conditions with belief truth conditions to obtain the truth conditions of a number of the agent’s beliefs. Finally, one uses these belief truth (...) conditions to generate, via a third principle, the fulfilment conditions for the remaining desires. There is, however, a very straightforward reason why this strategy cannot yield the required results. (shrink)

In an earlier paper in these pages (2008), we explored the puzzling link between dispositions and conditionals. First, we rehearsed the standard counterexamples to the simple conditional analysis and the refined conditional analysis defended by David Lewis. Second, we attacked a tempting response to these counterexamples: what we called the ‘getting specific strategy’. Third, we presented a series of structural considerations that pose problems for many attempts to understand the link between dispositions and conditionals. Finally, we developed our own (...) account of this link, which avoids all of the standard counterexamples and comports with the relevant structural considerations. In this paper, we reply to some objections. (shrink)

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)

We propose a new account of indicative conditionals, giving acceptability and logical closure conditions for them. We start from Adams’ Thesis: the claim that the acceptability of a simple indicative equals the corresponding conditional probability. The Thesis is widely endorsed, but arguably false and refuted by empirical research. To fix it, we submit, we need a relevance constraint: we accept a simple conditional 'If φ, then ψ' to the extent that (i) the conditional probability p(ψ|φ) is high, provided (...) that (ii) φ is relevant for ψ. How (i) should work is well-understood. It is (ii) that holds the key to improve our understanding of conditionals. Our account has (i) a probabilistic component, using Popper functions; (ii) a relevance component, given via an algebraic structure of topics or subject matters. We present a probabilistic logic for simple indicatives, and argue that its (in)validities are both theoretically desirable and in line with empirical results on how people reason with conditionals. (shrink)

An agent who receives information in the form of an indicative conditional statement and who trusts her source will modify her credences to bring them in line with the conditional. I will argue that the agent, upon the acquisition of such information, should, in general, expand her prior credence function to an indeterminate posterior one; that is, to a set of credence functions. Two different ways the agent might interpret the conditional will be presented, and the properties of the resulting (...) indeterminate posteriors compared. The cause of the expansion from a single prior credence function to a set of credence functions forming the indeterminate posterior one will be explained. The expansion undermines the Bayesian dogma that the result of assimilating new information into a determinate prior credence functions is always a determinate posterior one. (shrink)

For the last several decades, dispositional properties have been one of the main topics in metaphysics. Still, however, there is little agreement among contemporary metaphysicians on the nature of dispositional properties. Apparently, though, the majority of them have reached the consensus that dispositional ascriptions cannot be analysed in terms of simple counterfactual conditionals. In this paper it will be brought to light that this consensus is wrong. Specifically, I will argue that the simple conditional analysis of dispositions, which (...) is generally thought to be dead, is in fact an adequate analysis of dispositions. I will go on to discuss Mumford’s view of dispositions from the perspective of the simple conditional analysis of dispositions. (shrink)

The idea that dispositions are an intrinsic matter has been popular among contemporary philosophers of dispositions. In this paper I will first state this idea as exactly as possible. I will then examine whether it poses any threat to the two current versions of the conditional analysis of dispositions, namely, the simple and reformed conditional analysis of dispositions. The upshot is that the intrinsic nature of dispositions, when properly understood, doesn't spell trouble for either of the two versions of (...) the conditional analysis of dispositions. Along the way, I will propose an extensionally correct and practically useful criterion for identifying nomically intrinsic dispositions and criticize one objection raised by Lewis against the simple conditional analysis of dispositions. (shrink)

Dual process accounts of affective learning state that the learning of likes and dislikes reflects a learning mechanism that is distinct from the one reflected in expectancy learning, the learning of signal relationships, and has different empirical characteristics. Affective learning, for example, is said not to be affected by: (a) extinction training; (b) occasion setting; (c) cue competition; and (d) awareness of the CS-US contingencies. These predictions were tested in a series of experiments that employed simple Pavlovian conditioning (...) procedures. Neutral visual pictures of geometric shapes, or tactile conditional stimuli (CS) were paired with aversive electrotactile unconditional stimuli (US). Dependent measures were physiological (skin conductance, blink startle modulation) or verbal (US expectancy, on-line and off-line ratings of CS pleasantness). Different combinations of these dependent measures were employed across different experiments in an attempt to assess affective and expectancy learning simultaneously. Changes in CS pleasantness as indexed by ratings or blink startle modulation were readily observed. However, contrary to the predictions from dual-process accounts, results indicated that acquired CS unpleasantness is subject to extinction, occasion setting, cue competition, and not found in absence of CS-US contingency awareness. (shrink)

A number of papers have argued in favour of the material account of indicative conditionals, but typically they either concentrate on defending the account from the charge that it has counterintuitive consequences, or else focus on some particular positive argument in favour of the theory. In this paper, I survey the various positive arguments that can be given, presenting simple versions where possible and showing the connections between them. I conclude with some methodological considerations.

The simple substitution property provides a systematic and easy method for proving a theorem by an axiomatic way. The notion of the property was introduced in Hosoi [4] but without a definite name and he showed three examples of the axioms with the property. Later, the property was given it's name as above in Sasaki [7].Our main result here is that the necessary and sufficient condition for a logicL on a finite slice to have the simple substitution property (...) is thatL is finite. Here the necessity part is essentially new, for the sufficiency part has been proved in Hosoi and Sasaki [5]. Also the proof of sufficiency part is improved here. (shrink)

We discuss a simple logic to describe one of our favourite games from childhood, hide and seek, and show how a simple addition of an equality constant to describe the winning condition of the seeker makes our logic undecidable. There are certain decidable fragments of first-order logic which behave in a similar fashion with respect to such a language extension, and we add a new modal variant to that class. We discuss the relative expressive power of the proposed (...) logic in comparison to the standard modal counterparts. We prove that the model checking problem for the resulting logic is \(\textsf{P}\) -complete. In addition, by exploring the connection with related product logics, we gain more insight towards having a better understanding of the subtleties of the proposed framework. (shrink)

This paper discusses counterexamples to the thesis that the probabilities of conditionals are conditional probabilities. It is argued that the discrepancy is systematic and predictable, and that conditional probabilities are crucially involved in the apparently deviant interpretations. Furthermore, the examples suggest that such conditionals have a less prominent reading on which their probability is in fact the conditional probability, and that the two readings are related by a simple step of abductive inference. Central to the proposal is a distinction (...) between causal and purely stochastic dependence between variables. (shrink)

Given that an analysis of disposition ascription cannot be made in terms of a simple subjunctive conditional, we present a multiply qualified conditional analysis that places disposition ascription within an implicit fundamental causal conceptual typography within which a disposition ascription is embedded, framed, and understood. By placing the multiply qualified analysis within an implicit causal matrix involving a focal cause, pathway of influence, mechanism of action, contributing/partial cause, mediator, extrinsic moderator,, intrinsic moderator, and manifestation, we show how this analysis (...) evades counterexamples and arguments raised against the simple conditional analysis. We then indicate how the causal conceptual landscape provides a roadmap for unpacking and explicating parameters of the ceteris paribus qualifier to acquit the analysis of charges of being vacuous or irredeemably vague. (shrink)

Condorcet’s voting paradox shows that pairwise majority voting may lead to cyclical majority preferences. In a famous paper, Sen identified a general condition on a profile of individual preference orderings, called triplewise value-restriction, which is sufficient for the avoidance of such cycles. This note aims to make Sen’s result easily accessible. We provide an elementary proof of Sen's possibility theorem and a simple reformulation of Sen’s condition. We discuss how Sen’s condition is logically related to a number of precursors. (...) Finally, we state a necessary and sufficient condition for the avoidance of cycles, and suggest that, although there is still some logical space between that condition and Sen’s sufficient condition, Sen’s condition cannot be further generalized in an appealing way. (shrink)

I argue that there are is no informative statement of necessary and sufficient conditions for being a mereological simple.

Bypassing Lewis’ Triviality Results. A Kripke-Style Partial Semantics for Compounds of Adams’ Conditionals Alberto Mura University of Sassari Abstract According to Lewis’ Triviality Results (LTR), conditionals cannot satisfy the equa­tion (E) P(C if A) = P(C | A), except in trivial cases. Ernst Adams (1975), however, provided a probabilistic semantics for the so-called simple conditionals that also sat­isfies equation (E) and provides a probabilistic counterpart of logical consequence (called p-entailment). Adams’ probabilistic semantics is coextensive to Stalnaker­Thomason’s (1970) and Lewis’ (...) (1973) semantics as far as simple conditionals are concerned. A theorem, proved in McGee 1981, shows that no truth-functional many-valued logic allows a relation of logical consequence coextensive with Adams’ p-entailment. This paper presents a modified modal (Kripke-style) version of de Finetti’s se­mantics that escapes McGee’s result and provides a general truth-conditional se­mantics for indicative conditionals. It agrees with Adams’ logic and is not affected by LTR. The new framework encompasses and extends Adams’ probabilistic se­mantics (APS) to compounds of conditionals. A generalised set of axioms for prob­ability over the set of tri-events is provided, which coincide with the standard axioms over the set of the two-valued ordinary sentences. -/- Keywords: Conditionals, Probability logic, de Finetti, Tri-events, Adams’ logic, Stal­naker’s thesis, Partial logic, Lewis’ triviality results, Ramsey test. (shrink)

Philosophers of language have long recognized that in opaque contexts, such as those involving propositional attitude reports, substitution of co-referring names may not preserve truth value. For example, the name ‘Clark Kent’ cannot be substituted for ‘Superman’ in a context like:1. Lois believes that Superman can flywithout a change in truth value. In an earlier paper, Jennifer Saul demonstrated that substitution failure could also occur in ‘simple sentences’ where none of the ordinary opacity-producing conditions existed, such as:2. Superman leaps (...) more tall buildings than Clark Kent does.Accounts focusing on opacity were unable to explain our ‘anti-substitution intuitions’ in such cases.In Simple Sentences, Substitution, and Intuitions, Saul extends her earlier work. She provides a comprehensive presentation and criticism of recent accounts of simple sentence substitution failure, and proposes a new approach drawing on psychological evidence about cognitive processing. Saul's purpose is not merely to solve the substitution puzzle cases, but to make …. (shrink)

KR is Anderson and Belnap’s relevance logic R with the addition of the axiom of EFQ: \ \rightarrow q\). Since KR is relevantistic as to implication but classical as to negation, it has been dubbed, among many others, a ‘classical relevance logic.’ For KR, there have been known so far just two pretabular normal extensions. For these pretabular logics, no simple axiomatizations have yet been presented. In this paper, we offer some and show that they do the job. We (...) also introduce some Routley–Meyer semantic conditions for these axioms. All these may facilitate realizing our desire to discover other classical pretabular extensions over KR, if such extensions exist. (shrink)

Dretske has provided very influential arguments that there is a difference between our sensory awareness of objects and our awareness of facts about these objects—that there is a difference, for example, between seeing x and seeing that x is F. This distinction between simple and epistemic seeing is a staple of the philosophy of perception. Memory is often usefully compared to perception, and in this spirit I argue for the conditional claim that if Dretske’s arguments succeed in motivating the (...) posit of simple seeing, then parallel arguments should equally motivate a posit I call simple remembering. Simple remembering would be a conscious form of memory about an object or event which is prior to and independent of any beliefs the subject may or may not form about the object or event simply remembered. (shrink)

The crucial feature of obligation sentences to which the puzzles point is that such sentences, and evaluative sentences more generally, are defeasible. They may be warranted, given some information, only to be defeated by further information. A theory that recognizes this no longer needs to see conditional obligation as anything more than a simple combination of unary obligation and the conditional.

Dividing chains have been used as conditions to isolate adequate subclasses of simple theories. In the first part of this paper we present an introduction to the area. We give an overview on fundamental notions and present proofs of some of the basic and well-known facts related to dividing chains in simple theories. In the second part we discuss various characterizations of the subclass of low theories. Our main theorem generalizes and slightly extends a well-known fact about the (...) connection between dividing chains and Morley sequences (in our case: independent sequences). Moreover, we are able to give a proof that is shorter than the original one. This result motivates us to introduce a special property of formulas concerning independent dividing chains: For any dividing chain there exists an independent dividing chain of the same length. We study this property in the context of low, short and ω -categorical simple theories, outline some examples and define subclasses of low and short theories, which imply this property. The results give rise to further studies of the relationships between some subclasses of simple theories. (shrink)

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 the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an ‘essential’ way. A common feature of such theories is that they do not interpret any infinite discrete structures. We investigate a stronger condition that is easier to establish and use it to give an example of a strictly simple continuous theory that does not interpret any infinite discrete structures: the theory of richly branching [Formula: see text]-forests with generic binary (...) predicates. We also give an example of a superstable theory that fails to satisfy this stronger condition but nevertheless does not interpret any infinite discrete structures. (shrink)

Philosophers of language have long recognized that in opaque contexts, such as those involving propositional attitude reports, substitution of co-referring names may not preserve truth value. For example, the name ‘Clark Kent’ cannot be substituted for ‘Superman’ in a context like:1. Lois believes that Superman can flywithout a change in truth value. In an earlier paper , Jennifer Saul demonstrated that substitution failure could also occur in ‘simple sentences’ where none of the ordinary opacity-producing conditions existed, such as:2. Superman (...) leaps more tall buildings than Clark Kent does.Accounts focusing on opacity were unable to explain our ‘anti-substitution intuitions’ in such cases.In Simple Sentences, Substitution, and Intuitions, Saul extends her earlier work. She provides a comprehensive presentation and criticism of recent accounts of simple sentence substitution failure, and proposes a new approach drawing on psychological evidence about cognitive processing. Saul's purpose is not merely to solve the substitution puzzle cases, but to make …. (shrink)

An argument is offered that externalism can compromise the first‐person transparency of mental contents. The premises are John McDowell's view that experience is passively structured by concepts, and the Simple Theory of Colour advocated by John Campbell, according to which those properties that are the actual semantic values of colour concepts are just as they appear to normal observers under standard conditions. An example is offered to suggest that it must be an epistemic possibility that the semantic values of (...) such concepts, as externally determined, are not the properties the Simple Theory takes them to be. The possibility highlights a mismatch between the properties that the colour concepts present as their semantic values and their actual, externally determined semantic values. Such a mismatch is shown to induce an incoherence into colour concepts leaving them unfit passively to structure our colour experience. Under such circumstances, it would not be transparent to a subject on the basis of colour experience, whether those experiences are conceptually structured by concepts answering to the Simple Theory, or precisely what content they carry. (shrink)

A Collective Identity Function (CIF) is a rule which aggregates personal opinions on whether an individual belongs to a certain identity into a social decision. A simple CIF is one which can be expressed in terms of winning coalitions. We characterize simple CIFs and explore various CIFs of the literature by exploiting their ability of being expressed in terms of winning coalitions. We also use our setting to introduce conditions that ensure the equal treatment of individuals as voters (...) or as outcomes. (shrink)

Journal of Mathematical Logic, Ahead of Print. In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an ‘essential’ way. A common feature of such theories is that they do not interpret any infinite discrete structures. We investigate a stronger condition that is easier to establish and use it to give an example of a strictly simple continuous theory that does not interpret any infinite discrete structures: the theory of richly (...) branching [math]-forests with generic binary predicates. We also give an example of a superstable theory that fails to satisfy this stronger condition but nevertheless does not interpret any infinite discrete structures. (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 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)