This paper aims at understanding the concept of convention in mechanics as a notion transferred from the field of jurisprudence. This enables us to clarify it as a new epistemic category having a pertinent role in the transformation of mechanics in the nineteenth century. Such understanding permits a separation from linguistic and arbitrary conventions, thus highlighting its epistemic features and not transforming fundamental principles into mere arbitrary agreements. After addressing the main references in the literature discussing the role of convention (...) in mechanics, we analyze its classical use as a concept originating from law. Then we explain its use by Carl G. Jacobi, Ferdinand F. Reech, and J. Henri Poincaré. Here we also show how their uses conform to the features analyzed regarding conventions in jurisprudence. Finally, we try to explain how the use of this concept, among other factors, contributed to the transformation of mechanics. (shrink)

I examine two claims that arise in Brown’s account of inertial motion. Brown claims there is something objectionable about the way in which the motions of free particles in Newtonian theory and special relativity are coordinated. Brown also claims that since a geodesic principle can be derived in Einsteinian gravitation, the objectionable feature is explained away. I argue that there is nothing objectionable about inertia and that while the theorems that motivate Brown’s second claim can be said to figure in (...) a deductive-nomological explanation, their main contribution lies in their explication rather than their explanation of inertial motion. (shrink)

A feature of Frege's philosophy of arithmetic that has elicited a great deal of attention in the recent secondary literature is his contention that numbers are ‘self‐subsistent’ objects. The considerable interest in this thesis among the contemporary philosophy of mathematics community stands in marked contrast to Kreisel's folk‐lore observation that the central problem in the philosophy of mathematics is not the existence of mathematical objects, but the objectivity of mathematics. Although Frege was undoubtedly concerned with both questions, a goal of (...) the present paper is to argue that his success in securing the objectivity of arithmetic depends on a less contentious commitment to numbers as objects than either he or his critics have supposed. As such, this paper is an articulation and defense of both Frege's analysis of arithmetic and Kreisel's observation. (shrink)

A feature of Frege's philosophy of arithmetic that has elicited a great deal of attention in the recent secondary literature is his contention that numbers are ‘self‐subsistent’ objects. The considerable interest in this thesis among the contemporary philosophy of mathematics community stands in marked contrast to Kreisel's folk‐lore observation that the central problem in the philosophy of mathematics is not the existence of mathematical objects, but the objectivity of mathematics. Although Frege was undoubtedly concerned with both questions, a goal of (...) the present paper is to argue that his success in securing the objectivity of arithmetic depends on a less contentious commitment to numbers as objects than either he or his critics have supposed. As such, this paper is an articulation and defense of both Frege's analysis of arithmetic and Kreisel's observation. (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)