Causal Warrant for Realism about Particle Physics

While scientific realism generally assumes that successful scientific explanations yield information about reality, realists also have to admit that not all information acquired in this way is equally well warranted. Some versions of scientific realism do this by saying that explanatory posits with which we have established some kind of causal contact are better warranted than those that merely appear in theoretical hypotheses. I first explicate this distinction by considering some general criteria that permit us to distinguish causal warrant from theoretical warrant. I then apply these criteria to a specific case from particle physics, claiming that scientific realism has to incorporate the distinction between causal and theoretical warrant if it is to be an adequate stance in the philosophy of particle physics.     

Causal Relations and Explanatory Strategies in Physics

Many philosophers now regard causal approaches to explanation as highly promising, even in physics. This is due in large part to James Woodward's influential argument that a wide variety of scientific explanations are causal, based on his interventionist approach to causation. This article argues that some derivations describing causal relations and satisfying Woodward's criteria for causal explanation fail to be explanatory. Further, causal relations are unnecessary for a range of explanations, widespread in physics, involving highly idealized models. These constitute significant limitations on the scope of causal explanation. We have good reason to doubt that causal explanation is as widespread or important in physics as Woodward and other proponents maintain.     

The Causal Closure of Physics: An Explanation and Critique

Bistable, autonomously growing and self‐maintaining dynamical systems possess a new mathematical and applicational aspect: they can switch toward (physical) existence. Larger dynamical systems containing such flip‐flops as subsystems are frequent. The mathematical prototype is a special type of Z₂‐networks, termed a competence automaton. A chemical implementation is the ‘magic soup.’ It constitutes a general model for life‐type evolution processes including economic evolution.     

On the Reality and Causal Efficacy of Familiar Objects

What caused the event we report by saying “the window shattered”? Was it the baseball, which crashed into the window? Causal exclusionists say: many, many microparticles collectively caused that event—microparticles located where common sense supposes the baseball was. Unitary large objects such as baseballs cause nothing; indeed, by Alexander’s dictum, there are no such objects. This paper argues that the false claim about causal efficacy is instead the one that attributes it to the many microparticles. Causation obtains just where there is an “invariance”, a true generalization to the effect that had things been different with the putative cause, things would have been correspondingly different with the putative effect. But “correspondingly” here requires a rough metric. There must be a fact as to which alternative group events, involving many microparticles, would have departed less from the putative cause of the shattering, and which would have departed more. Surprisingly, there is no such fact.     

No End in Sight: Causal Loops in Philosophy, Physics and Fiction

There have been many objections to the possibility oftime travel. But all the truly interesting ones concern the possibility of reversecausation. What is objectionable about reverse causation? I diagnose that the trulyinteresting objections are to a further possibility: that of causal loops. I raisedoubts about whether there must be causal loops if reverse causation obtains; but devote themajority of the paper to describing, and dispelling concerns about, various kinds ofcausal loop. In short, I argue that they are neither logically nor physically impossible.The only possibly objectionable feature that all causal loops share is that coincidenceis required to explain them. Just how coincidental a loop will be varies: some arereally quite ordinary, and some are incredibly unlikely. I end by speculating thatthe tendency amongst physicists to avoid discussion of causal loops involving intentionalaction may have been unfortunate, since intentional action is an excellent way tonon-mysteriously bring about what otherwise would have been an unlikely coincidence. Hencecausal loops may be more likely in a world with beings like us, than in one without.     

On the Standard and Rational Completeness of some Axiomatic Extensions of the Monoidal T-norm Logic

The monoidal t-norm based logic MTL is obtained from Hájek's Basic Fuzzy logic BL by dropping the divisibility condition for the strong (or monoidal) conjunction. Recently, Jenei and Montgana have shown MTL to be standard complete, i.e. complete with respect to the class of residuated lattices in the real unit interval [0,1] defined by left-continuous t-norms and their residua. Its corresponding algebraic semantics is given by pre-linear residuated lattices. In this paper we address the issue of standard and rational completeness (rational completeness meaning completeness with respect to a class of algebras in the rational unit interval [0,1]) of some important axiomatic extensions of MTL corresponding to well-known parallel extensions of BL. Moreover, we investigate varieties of MTL algebras whose linearly ordered countable algebras embed into algebras whose lattice reduct is the real and/or the rational interval [0,1]. These embedding properties are used to investigate finite strong standard and/or rational completeness of the corresponding logics.     

On Canonicity and Strong Completeness Conditions in Intermediate Propositional Logics

By using algebraic-categorical tools, we establish four criteria in order to disprove canonicity, strong completeness, w-canonicity and strong w-completeness, respectively, of an intermediate propositional logic. We then apply the second criterion in order to get the following result: all the logics defined by extra-intuitionistic one-variable schemata, except four of them, are not strongly complete. We also apply the fourth criterion in order to prove that the Gabbay-de Jongh logic D₁ is not strongly w-complete. This revised version was published online in June 2006 with corrections to the Cover Date.     

Completeness and super-valuations

This paper uses the notion of Galois-connection to examine the relation between valuation-spaces and logics. Every valuation-space gives rise to a logic, and every logic gives rise to a valuation space, where the resulting pair of functions form a Galois-connection, and the composite functions are closure-operators. A valuation-space (resp., logic) is said to be complete precisely if it is Galois-closed. Two theorems are proven. A logic is complete if and only if it is reflexive and transitive. A valuation-space is complete if and only if it is closed under formation of super-valuations.     

Completeness of quantum logic

This paper is based on a semantic foundation of quantum logic which makes use of dialog-games. In the first part of the paper the dialogic method is introduced and under the conditions of quantum mechanical measurements the rules of a dialog-game about quantum mechanical propositions are established. In the second part of the paper the quantum mechanical dialog-game is replaced by a calculus of quantum logic. As the main part of the paper we show that the calculus of quantum logic is complete and consistent with respect to the dialogic semantics. Since the dialog-game does not involve the excluded middle the calculus represents a calculus of effective (intuitionistic) quantum logic.In a forthcoming paper it is shown that this calculus is equivalent to a calculus of sequents and more interestingly to a calculus of propositions. With the addition of the excluded middle the latter calculus is a model for the lattice of subspaces of a Hilbert space.On leave of absence from the Institut für Theoretische Physik der Universität zu Köln, W.-Germany.     

Causal Exclusion and Causal Autonomism

The causal exclusion problem is often considered as one of the major difficulties for which non-reductive physicalists have no easy solution to offer. Some non-reductive physicalists address this problem by arguing that mental properties are to some extent causally autonomous. If this is the case, then mental properties will not be causally excluded by their physical realizers because causation, in general, is a relation between properties of the same level. In this paper, I argue that the response from causal autonomy cannot be successful for two reasons. First, it does not offer a satisfactory explanation for how mental particulars can have causal efficacy in a non-reductive physicalist framework. Second, the causal considerations underpinning this response do not really support the conclusion that mental properties are causally autonomous.     

Causal Analyses in Interpersonal Relations: On Importance of the Control Condition

Most studies of interpersonal relations employ the high and low levels of an independent variable and attribute the high–low difference to the high level only. However, such a difference can be due to the positivity effect of the high level, the negativity effect of the low level, or both. To specify the loci of the high–low difference, a control condition is necessary. In my research into interpersonal attraction and impression formation, I ascertained the magnitude of the positivity and negativity effects relative to the response to a control condition of no-individuating information. The negativity effects of dissimilar attitudes and negative traits were greater than the positivity effects of similar attitudes and positive traits. One source of this positive–negative asymmetry was the person positivity bias in the participants. A greater weighting of negative than positive level could be another factor. Research is needed to separate the contributions of these two variables to the positive–negative asymmetry demonstrated.     

Psychologism and Completeness in the Arts

When is an artwork complete? Most hold that the correct answer to this question is psychological in nature. A work is said to be complete just in case the artist regards it as complete or is appropriately disposed to act as if he or she did. Even though this view seems strongly supported by metaphysical, epistemological, and normative considerations, this article argues that such psychologism about completeness is mistaken, fundamentally, because it cannot make sense of the artist's own perspective on his or her work. For the artist, the question is not about his or her own psychology, but about the character of the work and the context in which he or she works. A nonpsychological account of completeness, on which completeness is a question of whether the work satisfies the conditions implicit in the artist's plan, avoids this problem and is equally or better able to explain the metaphysical, epistemic, and normative phenomena which appeared to support psychologism.     

Dynamic Topological Completeness for

Dynamic topological logic (DTL) combines topological and temporalmodalities to express asymptotic properties of dynamic systemson topological spaces. A dynamic topological model is a tripleX ,f , V , where X is a topological space, f : X X a continuousfunction and V a truth valuation assigning subsets of X to propositionalvariables. Valid formulas are those that are true in every model,independently of X or f. A natural problem that arises is toidentify the logics obtained on familiar spaces, such as . It [9] it was shown that any satisfiable formulacould be satisfied in some for n large enough, but the question of how the logic varieswith n remained open. In this paper we prove that any fragment of DTL that is completefor locally finite Kripke frames is complete for . This includes DTL; it also includes some largerfragments, such as DTL₁, where "henceforth" may not appear inthe scope of a topological operator. We show that satisfiabilityof any formula of our language in a locally finite Kripke frameimplies satisfiability in by constructing continuous, open maps from the plane intoarbitrary locally finite Kripke frames, which give us a typeof bisimulation. We also show that the results cannot be extendedto arbitrary formulas of DTL by exhibiting a formula which isvalid in but not in arbitrarytopological spaces.     

Stable Causal Relationships Are Better Causal Relationships

We report three experiments investigating whether people's judgments about causal relationships are sensitive to the robustness or stability of such relationships across a range of background circumstances. In Experiment 1, we demonstrate that people are more willing to endorse causal and explanatory claims based on stable (as opposed to unstable) relationships, even when the overall causal strength of the relationship is held constant. In Experiment 2, we show that this effect is not driven by a causal generalization's actual scope of application. In Experiment 3, we offer evidence that stable causal relationships may be seen as better guides to action. Collectively, these experiments document a previously underappreciated factor that shapes people's causal reasoning: the stability of the causal relationship.     

Causal Exclusion and Causal Bayes Nets

In this paper I reconstruct and evaluate the validity of two versions of causal exclusion arguments within the theory of causal Bayes nets. I argue that supervenience relations formally behave like causal relations. If this is correct, then it turns out that both versions of the exclusion argument are valid when assuming the causal Markov condition and the causal minimality condition. I also investigate some consequences for the recent discussion of causal exclusion arguments in the light of an interventionist theory of causation such as Woodward's ( 2003 ) and discuss a possible objection to my causal Bayes net reconstruction.