In this paper I criticize the commonly accepted idea that the generalizations of the special sciences should be construed as ceteris paribus laws. This idea rests on mistaken assumptions about the role of laws in explanation and their relation to causal claims. Moreover, the major proposals in the literature for the analysis of ceteris paribus laws are, on their own terms, complete failures. I sketch a more adequate alternative account of the content of causal generalizations in the special sciences which (...) I argue should replace the ceteris paribus conception. (shrink)

Philosophers of science increasingly recognize the importance of idealization: the intentional introduction of distortion into scientific theories. Yet this recognition has not yielded consensus about the nature of idealization. e literature of the past thirty years contains disparate characterizations and justifications, but little evidence of convergence towards a common position.

This paper is an interpretation and defense of Richard Levins’ “The Strategy of Model Building in Population Biology,” which has been extremely influential among biologists since its publication 40 years ago. In this article, Levins confronted some of the deepest philosophical issues surrounding modeling and theory construction. By way of interpretation, I discuss each of Levins’ major philosophical themes: the problem of complexity, the brute-force approach, the existence and consequence of tradeoffs, and robustness analysis. I argue that Levins’ article is (...) concerned, at its core, with justifying the use of multiple, idealized models in population biology. (shrink)

Since the birth of computing as an academic discipline, the disciplinary identity of computing has been debated fiercely. The most heated question has concerned the scientific status of computing. Some consider computing to be a natural science and some consider it to be an experimental science. Others argue that computing is bad science, whereas some say that computing is not a science at all. This survey article presents viewpoints for and against computing as a science. Those viewpoints are analyzed against (...) basic positions in the philosophy of science. The article aims at giving the reader an overview, background, and a historical and theoretical frame of reference for understanding and interpreting some central questions in the debates about the disciplinary identity of computer science. The article argues that much of the discussion about the scientific nature of computing is misguided due to a deep conceptual uncertainty about science in general as well as computing in particular. (shrink)

Our understanding of subjunctive conditionals has been greatly enhanced through the use of possible world semantics and, more precisely, by the idea that they involve variably strict quantification over possible worlds. I propose to extend this treatment to ceteris paribus conditionals – that is, conditionals that incorporate a ceteris paribus or ‘other things being equal’ clause. Although such conditionals are commonly invoked in scientific theorising, they traditionally arouse suspicion and apprehensiveness amongst philosophers. By treating ceteris paribus conditionals as a species (...) of variably strict conditional I hope to shed new light upon their content and their logic. (shrink)

It has not been sufficiently considered in philosophical discussions of ceteris paribus (CP) laws that distinct kinds of CP-laws exist in science with rather different meanings. I distinguish between (1.) comparative CP-laws and (2.) exclusive CP-laws. There exist also mixed CP-laws, which contain a comparative and an exclusive CP-clause. Exclusive CP-laws may be either (2.1) definite, (2.2) indefinite or (2.3) normic. While CP-laws of kind (2.1) and (2.2) exhibit deductivistic behaviour, CP-laws of kind (2.3) require a probabilistic or non-monotonic reconstruction. (...) CP-laws of kind (1) may be both deductivistic or probabilistic. All these kinds of CP-laws have empirical content by which they are testable, except CP-laws of kind (2.2) which are almost vacuous. Typically, CP-laws of kind (1) express invariant correlations, CP-laws of kind (2.1) express closed system laws of physical sciences, and CP-laws of kind (2.3) express normic laws of non-physical sciences based on evolution-theoretic stability properties. (shrink)

A common view is that ceteris paribus clauses render lawlike statements vacuous, unless such clauses can be explicitly reformulated as antecedents of ?real? laws that face no counterinstances. But such reformulations are rare; and they are not, we argue, to be expected in general. So we defend an alternative sufficient condition for the non-vacuity of ceteris paribus laws: roughly, any counterinstance of the law must be independently explicable, in a sense we make explicit. Ceteris paribus laws will carry a plethora (...) of explanatory commitments; and claims that such commitments are satisfied will be as (dis) confirmable as other empirical claims. (shrink)

Hempel and Giere contend that the existence of provisos poses grave difficulties for any regularity account of physical law. However, Hempel and Giere rely upon a mistaken conception of the way in which statements acquire their content. By correcting this mistake, I remove the problem Hempel and Giere identify but reveal a different problem that provisos pose for a regularity account — indeed, for any account of physical law according to which the state of affairs described by a law-statement presupposes (...) a Humean regularity. These considerations suggest a normative analysis of law-statements. On this view, law-statements are not distinguished from accidental generalizations by the kind of Humean regularities they describe because a law-statement need not describe any Humean regularity. Rather, a law-statement says that in certain contexts, one ought to regard the assertion of a given type of claim, if made with justification, as a proper way to justify a claim of a certain other kind. (shrink)

We examine the philosophical disputes among computer scientists concerning methodological, ontological, and epistemological questions: Is computer science a branch of mathematics, an engineering discipline, or a natural science? Should knowledge about the behaviour of programs proceed deductively or empirically? Are computer programs on a par with mathematical objects, with mere data, or with mental processes? We conclude that distinct positions taken in regard to these questions emanate from distinct sets of received beliefs or paradigms within the discipline: – The rationalist (...) paradigm, which was common among theoretical computer scientists, defines computer science as a branch of mathematics, treats programs on a par with mathematical objects, and seeks certain, a priori knowledge about their ‘correctness’ by means of deductive reasoning. – The technocratic paradigm, promulgated mainly by software engineers and has come to dominate much of the discipline, defines computer science as an engineering discipline, treats programs as mere data, and seeks probable, a posteriori knowledge about their reliability empirically using testing suites. – The scientific paradigm, prevalent in the branches of artificial intelligence, defines computer science as a natural (empirical) science, takes programs to be entities on a par with mental processes, and seeks a priori and a posteriori knowledge about them by combining formal deduction and scientific experimentation. We demonstrate evidence corroborating the tenets of the scientific paradigm, in particular the claim that program-processes are on a par with mental processes. We conclude with a discussion in the influence that the technocratic paradigm has been having over computer science. (shrink)

Much of the literature on "ceteris paribus" laws is based on a misguided egalitarianism about the sciences. For example, it is commonly held that the special sciences are riddled with ceteris paribus laws; from this many commentators conclude that if the special sciences are not to be accorded a second class status, it must be ceteris paribus all the way down to fundamental physics. We argue that the (purported) laws of fundamental physics are not hedged by ceteris paribus clauses and (...) provisos. Furthermore, we show that not only is there no persuasive analysis of the truth conditions for ceteris paribus laws, there is not even an acceptable account of how they are to be saved from triviality or how they are to be melded with standard scientific methodology. Our way out of this unsatisfactory situation to reject the widespread notion that the achievements and the scientific status of the special sciences must be understood in terms of ceteris paribus laws. (shrink)

The prelims comprise: Introduction Computer Science and Mathematics The Formal Verification Debate Abstraction in Computer Science Conclusion.

Ever since David Hume, empiricists have barred powers and capacities from nature. In this book Cartwright argues that capacities are essential in our scientific world, and, contrary to empiricist orthodoxy, that they can meet sufficiently strict demands for testability. Econometrics is one discipline where probabilities are used to measure causal capacities, and the technology of modern physics provides several examples of testing capacities (such as lasers). Cartwright concludes by applying the lessons of the book about capacities and probabilities to the (...) explanation of the role of causality in quantum mechanics. (shrink)

In this sequence of philosophical essays about natural science, the author argues that fundamental explanatory laws, the deepest and most admired successes of modern physics, do not in fact describe regularities that exist in nature. Cartwright draws from many real-life examples to propound a novel distinction: that theoretical entities, and the complex and localized laws that describe them, can be interpreted realistically, but the simple unifying laws of basic theory cannot.

A traditional view of mathematical modeling holds, roughly, that the more details of the phenomenon being modeled that are represented in the model, the better the model is. This paper argues that often times this ‘details is better’ approach is misguided. One ought, in certain circumstances, to search for an exactly solvable minimal model—one which is, essentially, a caricature of the physics of the phenomenon in question.

Model checking, a prominent formal method used to predict and explain the behaviour of software and hardware systems, is examined on the basis of reflective work in the philosophy of science concerning the ontology of scientific theories and model-based reasoning. The empirical theories of computational systems that model checking techniques enable one to build are identified, in the light of the semantic conception of scientific theories, with families of models that are interconnected by simulation relations. And the mappings between these (...) scientific theories and computational systems in their scope are analyzed in terms of suitable specializations of the notions of model of experiment and model of data. Furthermore, the extensively mechanized character of model-based reasoning in model checking is highlighted by a comparison with proof procedures adopted by other formal methods in computer science. Finally, potential epistemic benefits flowing from the application of model checking in other areas of scientific inquiry are emphasized in the context of computer simulation studies of biological information processing. (shrink)

The principal task of the book series Poznan Studies in the Philosophy of the Sciences and the Humanities is to promote those developments in philosophy that respect the tradition of great philosophical ideas, on the one hand, and the manner of philosophical thinking introduced by analytical philosophy, on the other. The aim is to contribute to practicing philosophy as deep as Marxism and as caring about justification as positivism.

The book Model-Based Reasoning in Scientific Discovery, aims to explain how specific modeling practices employed by scientists are productive methods of ...

In this paper I distinguish the kind of ceteris paribus qualifications that often attach to derivative generalizations from those which typically attach to fundamental laws and argue that the latter are typically more tractable. I provide a sketch of a semantics for qualified generalizations and an account of how they may be justified. In addition I argue that legitimate uses of ceteris paribus qualifications must satisfy specific causal conditions.