A finer-grained delineation of a given explanandum reveals a nexus of closely related causal and non- causal explanations, complementing one another in ways that yield further explanatory traction on the phenomenon in question. By taking a narrower construal of what counts as a causal explanation, a new class of distinctively mathematical explanations pops into focus; Lange’s characterization of distinctively mathematical explanations can be extended to cover these. This new class of distinctively mathematical explanations is illustrated with the Lotka-Volterra equations. There (...) are at least two distinct ways those equations might hold of a system, one of which yields straightforwardly causal explanations, but the other of which yields explanations that are distinctively mathematical in terms of nomological strength. In the first, one first picks out a system or class of systems, finds that the equations hold in a causal -explanatory way; in the second, one starts with the equations and explanations that must apply to any system of which the equations hold, and only then turns to the world to see of what, if any, systems it does in fact hold. Using this new way in which a model might hold of a system, I highlight four specific avenues by which causal and non- causal explanations can complement one another. (shrink)

It has become increasingly clear that natural phenomena cannot be formally deduced from laws but that almost every phenomenon has its own particular way of being linked to higher-level generalizations, usually via approximations, normalizations and corrections. This article deals with the following problem: if there are no general principles to link laws to phenomena, and if each phenomenon has its own way of being explained, how can we -- or how can a theory -- explain any new phenomenon? I will (...) argue that while particular explanations only apply to the specific phenomena they describe, parts of such explanations can be productively reused in explaining new phenomena. This leads to a view on theory, which I call maximalism, according to which new phenomena are understood in terms of previous phenomena. On the maximalist view, a theory is not a system of axioms or a class of models, but a dynamically updated corpus of explanations. New phenomena are explained by combining fragments of explanations of previous phenomena. I will give an instantiation of this view, based on a corpus of phenomena from classical and fluid mechanics, and show that the maximalist approach is not only used but also needed in scientific practice. (shrink)

This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise algorithmic (...) computation and to offer foundations for scientific computing. The dissertation consists of three parts. In the first part, we examine what notion of 'algorithmic computation' underlies each approach and how it is respectively formalised. It is argued that the very existence of the two rival frameworks indicates that 'algorithm' is not one unique concept in mathematics, but it is used in more than one way. We test this hypothesis for consistency with mathematical practice as well as with key foundational works that aim to define the term. As a result, new connections between certain subfields of mathematics and computer science are drawn, and a distinction between 'algorithms' and 'effective procedures' is proposed. In the second part, we focus on the second goal of the two rival approaches to real computation; namely, to provide foundations for scientific computing. We examine both frameworks in detail, what idealisations they employ, and how they relate to floating-point arithmetic systems used in real computers. We explore limitations and advantages of both frameworks, and answer questions about which one is preferable for computational modelling and which one for addressing general computability issues. In the third part, analog computing and its relation to analogue (physical) modelling in science are investigated. Based on some paradigmatic cases of the former, a certain view about the nature of computation is defended, and the indispensable role of representation in it is emphasized and accounted for. We also propose a novel account of the distinction between analog and digital computation and, based on it, we compare analog computational modelling to physical modelling. It is concluded that the two practices, despite their apparent similarities, are orthogonal. (shrink)

This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than the classical computability theory. This is so because physical sciences, engineering, and applied mathematics mostly employ functions defined in continuous domains. But, contrary to the case of computation over natural numbers, there is no universally accepted framework for real computation; rather, there are two incompatible approaches --computable analysis and BSS model--, both claiming to formalise algorithmic (...) computation and to offer foundations for scientific computing. -/- The dissertation consists of three parts. In the first part, we examine what notion of 'algorithmic computation' underlies each approach and how it is respectively formalised. It is argued that the very existence of the two rival frameworks indicates that 'algorithm' is not one unique concept in mathematics, but it is used in more than one way. We test this hypothesis for consistency with mathematical practice as well as with key foundational works that aim to define the term. As a result, new connections between certain subfields of mathematics and computer science are drawn, and a distinction between 'algorithms' and 'effective procedures' is proposed. -/- In the second part, we focus on the second goal of the two rival approaches to real computation; namely, to provide foundations for scientific computing. We examine both frameworks in detail, what idealisations they employ, and how they relate to floating-point arithmetic systems used in real computers. We explore limitations and advantages of both frameworks, and answer questions about which one is preferable for computational modelling and which one for addressing general computability issues. -/- In the third part, analog computing and its relation to analogue (physical) modelling in science are investigated. Based on some paradigmatic cases of the former, a certain view about the nature of computation is defended, and the indispensable role of representation in it is emphasized and accounted for. We also propose a novel account of the distinction between analog and digital computation and, based on it, we compare analog computational modelling to physical modelling. It is concluded that the two practices, despite their apparent similarities, are orthogonal. (shrink)

Non-actual model systems discussed in scientific theories are compared to fictions in literature. This comparison may help with the understanding of similarity relations between models and real-world target systems. The ontological problems surrounding fictions in science may be particularly difficult, however. A comparison is also made to ontological problems that arise in the philosophy of mathematics.

Many scientific models are representations. Building on Goodman and Elgin’s notion of representation-as we analyse what this claim involves by providing a general definition of what makes something a scientific model, and formulating a novel account of how they represent. We call the result the DEKI account of representation, which offers a complex kind of representation involving an interplay of, denotation, exemplification, keying up of properties, and imputation. Throughout we focus on material models, and we illustrate our claims with the (...) Phillips-Newlyn machine. In the conclusion we suggest that, mutatis mutandis, the DEKI account can be carried over to other kinds of models, notably fictional and mathematical models. (shrink)

A finer-grained delineation of a given explanandum reveals a nexus of closely related causal and non-causal explanations, complementing one another in ways that yield further explanatory traction on the phenomenon in question. By taking a narrower construal of what counts as a causal explanation, a new class of distinctively mathematical explanations pops into focus; Lange’s characterization of distinctively mathematical explanations can be extended to cover these. This new class of distinctively mathematical explanations is illustrated with the Lotka–Volterra equations. There are (...) at least two distinct ways those equations might hold of a system, one of which yields straightforwardly causal explanations, and another that yields explanations that are distinctively mathematical in terms of nomological strength. In the first case, one first picks out a system or class of systems, and finds that the equations hold in a causal–explanatory way. In the second case, one starts with the equations and explanations that must apply to any system of which the equations hold, and only then turns to the world to see of what, if any, systems it does in fact hold. Using this new way in which a model might hold of a system, I highlight four specific avenues by which causal and non-causal explanations can complement one another. _1_. Introduction _2._ Delineating the Boundaries of Causal Explanation _2.1._ Why construe causal explanation narrowly? The land of explanation versus grain-focusing _2.2._ Reasons to narrow the scope of causal explanation _3._ Broadening the Scope of Mathematical Explanation _4._ Lotka–Volterra: Same Model, Different Explanation Types _4.1._ General biocide in the Lotka–Volterra model _4.2._ Two ways a model can hold, yielding causal versus mathematical explanations _5._ Four Complementary Relationships between Mathematical and Causal Explanation _5.1._ Slight reformulations of explananda _5.2._ Causal distortion of idealized mathematical models _5.3._ Partial explanations requiring supplementation _5.4._ Explanatory dimensionality _6._ Conclusion. (shrink)

I survey a broad variety of models with an eye to asking what kind of model each is in the following sense: in virtue of what is each of them regarded as a model? It will be seen that when we classify models according to the answer to this question, it comes to light that the notion of model predominant in philosophy of science covers only some of the kinds of models used in scientific contexts. The notion of a model (...) predominant in philosophy of science requires that a model be related to something formal, such as equations or statements. Not all the examples provided in the brief survey in this paper fit that notion of a model. I identify another kind of model that ought to be included in philosophical and foundational studies of scientific models, which I call a “piece of the world” kind of model, to contrast with a “realm of thought” kind of model. These models also have formal methodologies associated with them, and, hence, analytic philosophers of science can embrace them without abandoning the rigor that has characterized the discipline. (shrink)