The paradox of phase transitions raises the problem of how to reconcile the fact that we see phase transitions happen in concrete, finite systems around us, with the fact that our best theories—i.e. statistical-mechanical theories of phase transitions—tell us that phase transitions occur only in infinite systems. In this paper we aim to clarify to which extent this paradox is relative to the mathematical framework which is used in these theories, i.e. classical mathematics. To this aim, we will explore the (...) philosophical consequences of adopting constructive instead of classical mathematics in a statistical-mechanical theory of phase transitions. It will be shown that constructive mathematics forces certain ‘de-idealizations’ of such theories: talk of actually infinite systems is meaningless, there are no discontinuous functions, and—in a sense which will be clarified—constructive real numbers reflect our imperfect methods of determining the values of physical quantities. As such, so it will be argued, constructive mathematics offers a means to gain insight in the idealizations introduced in classical theories and the philosophical issues surrounding them. (shrink)

This discussion note of (Batterman [2010]) clarifies the modest aims of my 'mapping account' of applications of mathematics in science. Once these aims are clarified it becomes clear that Batterman's 'completely new approach' (Batterman [2010], p. 24) is not needed to make sense of his cases of idealized mathematical explanations. Instead, a positive proposal for the explanatory power of such cases can be reconciled with the mapping account.

This paper defends three claims about concrete or physical models: these models remain important in science and engineering, they are often essentially idealized, in a sense to be made precise, and despite these essential idealizations, some of these models may be reliably used for the purpose of causal explanation. This discussion of concrete models is pursued using a detailed case study of some recent models of landslide generated impulse waves. Practitioners show a clear awareness of the idealized character of these (...) models, and yet address these concerns through a number of methods. This paper focuses on experimental arguments that show how certain failures to accurately represent feature X are consistent with accurately representing some causes of feature Y, even when X is causally relevant to Y. To analyse these arguments, the claims generated by a model must be carefully examined and grouped into types. Only some of these types can be endorsed by practitioners, but I argue that these endorsed claims are sufficient for limited forms of causal explanation. (shrink)

We examine two very different approaches to formalising real computation, commonly referred to as “Computable Analysis” and “the BSS approach”. The main models of computation underlying these approaches—bit computation and BSS, respectively—have also been put forward as appropriate foundations for scientific computing. The two frameworks offer useful computability and complexity results about problems whose underlying domain is an uncountable space. Since typically the problems dealt with in physical sciences, applied mathematics, economics, and engineering are also defined in uncountable domains, it (...) is fitting that we choose between these two approaches a foundational framework for scientific computing. However, the models are incompatible as to their results. What is more, the BSS model is highly idealised and unrealistic; yet, it is the de facto implicit model in various areas of computational mathematics, with virtually no problems for the everyday practice. This paper serves three purposes. First, we attempt to delineate what the goal of developing foundations for scientific computing exactly is. We distinguish between two very different interpretations of that goal, and on the separate basis of each one, we put forward answers about the appropriateness of each framework. Second, we provide an account of the fruitfulness and wide use of BSS, despite its unrealistic assumptions. Third, according to one of our proposed interpretations of the scope of foundations, the target domain of both models is a certain mathematical structure. In a clear sense, then, we are using idealised models to study a purely mathematical structure. The third purpose is to point out and explain this intriguing phenomenon and attempt to make connections with the typical case of idealised models of empirical domains. (shrink)

Science is replete with falsehoods that epistemically facilitate understanding by virtue of being the very falsehoods they are. In view of this puzzling fact, some have relaxed the truth requirement on understanding. I offer a factive view of understanding that fully accommodates the puzzling fact in four steps: (i) I argue that the question how these falsehoods are related to the phenomenon to be understood and the question how they figure into the content of understanding it are independent. (ii) I (...) argue that the falsehoods do not figure into the understanding’s content by being elements of its periphery or core. (iii) Drawing lessons from case studies, I argue that the falsehoods merely enable understanding. When working with such falsehoods, only the truths we extract from them are elements of the content of our understanding. (iv) I argue that the extraction view is compatible with the thesis that falsehoods can have an epistemic value by virtue of being the very falsehoods they are. (shrink)

Scientists appeal to models when explaining phenomena. Such explanations are often dubbed model explanations or model-based explanations. But what are the precise conditions for ME? Are ME special explanations? In our paper, we first rebut two definitions of ME and specify a more promising one. Based on this analysis, we single out a related conception that is concerned with explanations that are induced from working with a model. We call them ‘model-induced explanations’. Second, we study three paradigmatic cases of alleged (...) ME. We argue that all of them are MIE, upon closer examination. Third, we argue that this undermines the building consensus that model explanations are special explanations that, e.g., challenge the factivity of explanation. Instead, it suggests that what is special about models in science is the epistemology behind how models induce explanations. (shrink)

Reflectance physicalists define reflectance as the intrinsic disposition of a surface to reflect finite-duration light pulses at a given efficiency per wavelength. I criticize the received view of dispositional reflectance (David R. Hilbert’s) for failing to account for what I call “harmonic dispersion,” the inverse relationship of a light pulse's duration to its bandwidth. I argue that harmonic dispersion renders reflectance defined in terms of light pulses an extrinsic disposition. Reflectance defined as the per-wavelength efficiency to reflect the superimposed, infinite-duration, (...) Fourier harmonics of pulses can be an intrinsic disposition of surfaces. This conclusion raises questions about mathematical realism, about which I nevertheless remain neutral. (shrink)

In the debate over whether mathematical facts, properties, or entities explain physical events (in what philosophers call “extra-mathematical” explanations), Aidan Lyon’s (2012) affirmative answer stands out for its employment of the program explanation (PE) methodology of Frank Jackson and Philip Pettit (1990). Juha Saatsi (2012; 2016) objects, however, that Lyon’s examples from the indispensabilist literature are (i) unsuitable for PE, (ii) nominalizable into non-mathematical terms, and (iii) mysterious about the explanatory relation alleged to obtain between the PE’s mathematical explanantia and (...) physical explananda. In this paper, I propose a counterexample to Saatsi’s objections. My counterexample is Frank Jackson’s (1998a) program explanation for color experience, which I argue needs recasting as an extra-mathematical PE due to its implicit reliance on reflectance, a property that suffers conceptual regress unless redefined with Fourier harmonics. Pace Saatsi, I argue that this recast example is an authoritative PE, non-nominalizable, and minimally esoteric. Important for the indispensability debate at large, moreover, is that my counterexample reifies Fourier harmonics without the Enhanced Indispensability Argument (an argument to which Lyon applies PE as a premise). Indispensabilists have long overlooked the conditionalization of a limited mathematical realism on property realism, and my counterexample to Saatsi exploits this conditionalization. (shrink)

This paper discusses a conception of physics as a collection of theories that, from a logical point of view, is inconsistent. It is argued that this logical conception of the relations between physical theories is too crude. Mathematical subtleties allow for a much more nuanced and sophisticated understanding of the relations between different physical theories.

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 thesis starts with three challenges to the structuralist accounts of applied mathematics. Structuralism views applied mathematics as a matter of building mapping functions between mathematical and target-ended structures. The first challenge concerns how it is possible for a non-mathematical target to be represented mathematically when the mapping functions per se are mathematical objects. The second challenge arises out of inconsistent early calculus, which suggests that mathematical representation does not require rigorous mathematical structures. The third challenge comes from renormalisation group (...) (RG) explanations of universality. It is argued that the structural mapping between the world and a highly abstract minimal model adds little value to our understanding of how RG obtains its explanatory force. I will address the first and second challenges from the similarity perspective. The similarity account captures representations as similarity relations, providing a more flexible and broader conception of representation than structuralism. It is the specification of the respect and degree of similarity that forges mathematics into a context of representation and directs it to represent a specific system in reality. Structuralism is treatable as a tool for explicating similarity rela-tions set-theoretically. The similarity account, combined with other approaches (e.g., Nguyen and Frigg’s extensional abstraction account and van Fraassen’s pragmatic equivalence), can dissolve the first challenge. Additionally, I will make a structuralist response to the second challenge, and suggestions regarding the role of infinitesimals from the similarity perspective. In light of the similarity account, I will propose the “hotchpotch picture” as a method-ological reflection of our study of representation and explanation. Its central insight is to dissect a representation or an explanation into several aspects and use different theories (that are usually thought of competing) to appropriate each of them. Based on the hotchpotch picture, RG explanations can be dissected to the “indexing” and “inferential” conceptions of explanation, which are captured or characterised by structural mappings. Therefore, structuralism accommodates RG explanations, and the third challenge is resolved. (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)