14 found
Order:
See also
Paula Quinon
Lund University
  1.  21
    Can Church’s Thesis Be Viewed as a Carnapian Explication?Paula Quinon - 2019 - Synthese 198 (Suppl 5):1047-1074.
    Turing and Church formulated two different formal accounts of computability that turned out to be extensionally equivalent. Since the accounts refer to different properties they cannot both be adequate conceptual analyses of the concept of computability. This insight has led to a discussion concerning which account is adequate. Some authors have suggested that this philosophical debate—which shows few signs of converging on one view—can be circumvented by regarding Church’s and Turing’s theses as explications. This move opens up the possibility that (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  2.  5
    Cognitive Structuralism: Explaining the Regularity of the Natural Numbers Progression.Paula Quinon - forthcoming - Review of Philosophy and Psychology:1-23.
    According to one of the most powerful paradigms explaining the meaning of the concept of natural number, natural numbers get a large part of their conceptual content from core cognitive abilities. Carey’s bootstrapping provides a model of the role of core cognition in the creation of mature mathematical concepts. In this paper, I conduct conceptual analyses of various theories within this paradigm, concluding that the theories based on the ability to subitize, or on the ability to approximate quantities, or both, (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  3.  13
    The Anti-Mechanist Argument Based on Gödel’s Incompleteness Theorems, Indescribability of the Concept of Natural Number and Deviant Encodings.Paula Quinon - 2020 - Studia Semiotyczne 34 (1):243-266.
    This paper reassesses the criticism of the Lucas-Penrose anti-mechanist argument, based on Gödel’s incompleteness theorems, as formulated by Krajewski : this argument only works with the additional extra-formal assumption that “the human mind is consistent”. Krajewski argues that this assumption cannot be formalized, and therefore that the anti-mechanist argument – which requires the formalization of the whole reasoning process – fails to establish that the human mind is not mechanistic. A similar situation occurs with a corollary to the argument, that (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  4.  4
    A Taxonomy of Deviant Encodings.Paula Quinon - 2018 - In F. Manea, R. Miller & D. Nowotka (eds.), Sailing Routes in the World of Computation. CiE 2018. Lecture Notes in Computer Science, vol 10936. Springer. pp. 338-348.
    The main objective of this paper is to design a common background for various philosophical discussions about adequate conceptual analysis of “computation”.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  5.  9
    Situated Counting.Peter Gärdenfors & Paula Quinon - 2020 - Review of Philosophy and Psychology:1-24.
    We present a model of how counting is learned based on the ability to perform a series of specific steps. The steps require conceptual knowledge of three components: numerosity as a property of collections; numerals; and one-to-one mappings between numerals and collections. We argue that establishing one-to-one mappings is the central feature of counting. In the literature, the so-called cardinality principle has been in focus when studying the development of counting. We submit that identifying the procedural ability to count with (...)
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  6.  1
    Implicit and Explicit Examples of the Phenomenon of Deviant Encodings.Paula Quinon - 2020 - Studies in Logic, Grammar and Rhetoric 63 (1):53-67.
    The core of the problem discussed in this paper is the following: the Church-Turing Thesis states that Turing Machines formally explicate the intuitive concept of computability. The description of Turing Machines requires description of the notation used for the input and for the output. Providing a general definition of notations acceptable in the process of computations causes problems. This is because a notation, or an encoding suitable for a computation, has to be computable. Yet, using the concept of computation, in (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  7
    Intensionality in mathematics: problems and prospects.Marianna Antonutti Marfori & Paula Quinon - forthcoming - Synthese:1-5.
    No categories
    Direct download (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  8.  4
    Book Review of “Numbers and the Making of Us: Counting and the Course of Human Cultures” by Caleb Everett.Paula Quinon & Markus Pantsar - 2018 - Journal of Numerical Cognition 4 (2).
  9.  2
    Intensionality in Mathematics: Problems and Prospects: Introduction to the Special Issue.Paula Quinon & Marianna Antonutti Marfori - 2021 - Synthese 198 (Suppl 5):995-999.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  10.  20
    La Métalangue d'Une Syntaxe Inscriptionnelle.Paula Quinon - 2011 - History and Philosophy of Logic 32 (2):191 - 193.
    History and Philosophy of Logic, Volume 32, Issue 2, Page 191-193, May 2011.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  11. Magnitude and Number Sensitivity of the Approximate Number System in Conceptual Spaces.Paula Quinon & Aleksander Gemel - 2019 - In Peter Gärdenfors, Antti Hautamäki, Frank Zenker & Mauri Kaipainen (eds.), Conceptual Spaces: Elaborations and Applications. Springer Verlag.
    No categories
     
    Export citation  
     
    Bookmark   1 citation  
  12.  8
    Metalanguage of Inscriptional Syntax.Paula Quinon - 2011 - History and Philosophy of Logic 32 (2):191-193.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  13. The Intended Model of Arithmetic. An Argument From Tennenbaum's Theorem.Paula Quinon & Konrad Zdanowski - 2006
    Translate
     
     
    Export citation  
     
    Bookmark  
  14.  1
    Thank Goodness–Parking Tickets Aren’T Tax Deductible: Practical Advice on Filing for Tax Returns.Frank Zenker & Paula Quinon - unknown
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark