Computation and Indispensability

Logic and Logical Philosophy:1 (forthcoming)
  Copy   BIBTEX

Abstract

This article provides a computational example of a mathematical explanation within science, concerning computational equivalence of programs. In addition, it outlines the logical structure of the reasoning involved in explanations in applied mathematics. It concludes with a challenge that the nominalist provide a nominalistic explanation for the computational equivalence of certain programs.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,105

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On computational explanations.Anna-Mari Rusanen & Otto Lappi - 2016 - Synthese 193 (12):3931-3949.
Isomorphism Testing For Equivalence Relations.Edward Szczypka - 1996 - Reports on Mathematical Logic:101-109.
Computation, individuation, and the received view on representation.Mark Sprevak - 2010 - Studies in History and Philosophy of Science Part A 41 (3):260-270.
Model-based recasting in answer-set programming.Thomas Eiter, Michael Fink, Jörg Pührer, Hans Tompits & Stefan Woltran - 2013 - Journal of Applied Non-Classical Logics 23 (1-2):75-104.

Analytics

Added to PP
2020-06-30

Downloads
46 (#460,186)

6 months
7 (#647,742)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

No citations found.

Add more citations

References found in this work

Science Without Numbers: A Defence of Nominalism.Hartry H. Field - 1980 - Princeton, NJ, USA: Princeton University Press.
The ways of paradox.W. V. Quine - 1966 - New York,: Random.
Philosophy of Logic.Hilary Putnam - 1971 - New York, NY, USA: Routledge. Edited by Stephen Laurence & Cynthia Macdonald.

View all 15 references / Add more references