Switch to: References

Citations of:

Diagrams in Mathematics

Foundations of Science 24 (3):583-604 (2019)

Add citations

You must login to add citations.
  1. Fallibility and Fruitfulness of Deductions.Cesare Cozzo - 2021 - Erkenntnis (7):1-17.
    The fallibility of deduction is the thesis that a thoughtful speaker-reasoner can wrongly believe that an inference is deductively valid. The author presents an argument to the effect that the fallibility of deduction is incompatible with the widespread view that deduction is epistemically unfruitful (the conclusion is contained in the premises, and the transition from premises to conclusion never extends knowledge). If the fallibility of deduction is a fact, the argument presented is a refutation of the doctrine of the unfruitfulness (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  • The Role of Notations in Mathematics.Carlo Cellucci - 2020 - Philosophia 48 (4):1397-1412.
    The terms of a mathematical problem become precise and concise if they are expressed in an appropriate notation, therefore notations are useful to mathematics. But are notations only useful, or also essential? According to prevailing view, they are not essential. Contrary to this view, this paper argues that notations are essential to mathematics, because they may play a crucial role in mathematical discovery. Specifically, since notations may consist of symbolic notations, diagrammatic notations, or a mix of symbolic and diagrammatic notations, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  • From Turing to Peirce. A semiotic interpretation of computation.Luca M. Possati - 2023 - Foundations of Science 28 (4):1085-1110.
    The thesis of the paper is that semiotic processes are intrinsic to computation and computational systems. An explanation of computation that does not take this semiotic dimension into account is incomplete. Semiosis is essential to computation and therefore requires a rigorous definition. To prove this thesis, the author analyzes two concepts of computation: the Turing machine and the mechanistic conception of physical computation. The paper is organized in two parts. The first part (Sects. 2 and 3) develops a re-interpretation of (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  • On the heuristic power of mathematical representations.Emiliano Ippoliti - 2022 - Synthese 200 (5):1-28.
    I argue that mathematical representations can have heuristic power since their construction can be ampliative. To this end, I examine how a representation introduces elements and properties into the represented object that it does not contain at the beginning of its construction, and how it guides the manipulations of the represented object in ways that restructure its components by gradually adding new pieces of information to produce a hypothesis in order to solve a problem.In addition, I defend an ‘inferential’ approach (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark