Nov 12, 2022 01:15 PM - 03:15 PM(America/New_York)
20221112T1315 20221112T1515 America/New_York Mathematics Duquesne PSA 2022 office@philsci.org
When Mathematics Became Useful to ScienceView Abstract
Contributed Papers 01:15 PM - 01:45 PM (America/New_York) 2022/11/12 18:15:00 UTC - 2022/11/12 18:45:00 UTC
Mathematics is the “language of nature,” a privileged mode of expression in science. We think it latches onto something essential about the physical universe, and we seek theories that reduce phenomena to mathematical laws. Yet, this attitude could not arise from the philosophies dominant before the early modern period. In orthodox Aristotelianism, mathematical categories are too impoverished to capture the causal structure of the world. In the revived Platonism of its opponents, the natural world is too corrupt to exemplify mathematical perfection. Modern mathematical science required a novel tertium quid, due to Pietro Catena.
David Marshall Miller
Auburn University
Realism on Thin Ice: An Argument from Mathematical PracticeView Abstract
Contributed Papers 01:45 PM - 02:15 PM (America/New_York) 2022/11/12 18:45:00 UTC - 2022/11/12 19:15:00 UTC
In Defending the Axioms: On the Philosophical Foundations of Set Theory, Penelope Maddy introduces two methodologically equivalent but philosophically distinct positions, termed Thin Realism and Arealism, which presumably respect set-theoretic practice. Further, Maddy concludes that for her idealized naturalistic inquirer, there is no substantive difference between the two positions. However, I argue that Thin Realism loses its tenability due to the presence of foundational pluralism in broader mathematical practice. In turn, this presents a naturalistic way to undermine Maddy’s conclusion that these are two equally admissible ways of describing the underlying constraints of mathematical practice for the philosophical naturalist.
Presenters Jared Ifland
Graduate Student And Teaching Assistant, Florida State University
Mathematical Explanation in Computer ScienceView Abstract
Contributed Papers 02:15 PM - 02:45 PM (America/New_York) 2022/11/12 19:15:00 UTC - 2022/11/12 19:45:00 UTC
This note scouts a broad class of explanations of central importance to contemporary computer science. These explanations, which I call 'limitative' explanations, explain why certain problems cannot be solved computationally. Limitative explanations are philosophically rich, but have not received the attention they deserve. The primary goals of this note are to isolate limitative explanations and provide a preliminary account of what makes them explanatory. On the account I favour, limitative explanations are best understood as non-causal mathematical explanations which depend on highly idealized models of computation.
Andre Curtis-Trudel
Post-doctoral Fellow, Lingnan University
On Automorphism Criteria for Comparing Amounts of Mathematical StructureView Abstract
Contributed Papers 02:45 PM - 03:15 PM (America/New_York) 2022/11/12 19:45:00 UTC - 2022/11/12 20:15:00 UTC
Wilhelm (2021) has recently defended a criterion for comparing struc- ture of mathematical objects, which he calls Subgroup. He argues that Subgroup is better than SYM∗, another widely adopted criterion. We argue that this is mistaken; Subgroup is strictly worse than SYM∗. We then formulate a new criterion that improves on both SYM∗ and Sub- group, answering Wilhelm’s criticisms of SYM∗ along the way. We con- clude by arguing that no criterion that looks only to the automorphisms of mathematical objects to compare their structure can be fully satisfactory.
Thomas Barrett
UC Santa Barbara
Auburn University
Graduate Student and Teaching Assistant
Florida State University
Post-doctoral fellow
Lingnan University
UC Santa Barbara
Dalhousie University
No attendee has checked-in to this session!
Program Navigator
460 visits