Results for 'arithmetical comprehension'

936 found
Order:
  1. Arithmetic is Necessary.Zachary Goodsell - 2024 - Journal of Philosophical Logic 53 (4).
    (Goodsell, Journal of Philosophical Logic, 51(1), 127-150 2022) establishes the noncontingency of sentences of first-order arithmetic, in a plausible higher-order modal logic. Here, the same result is derived using significantly weaker assumptions. Most notably, the assumption of rigid comprehension—that every property is coextensive with a modally rigid one—is weakened to the assumption that the Boolean algebra of properties under necessitation is countably complete. The results are generalized to extensions of the language of arithmetic, and are applied to answer a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2. The Enculturated Move From Proto-Arithmetic to Arithmetic.Markus Pantsar - 2019 - Frontiers in Psychology 10.
    The basic human ability to treat quantitative information can be divided into two parts. With proto-arithmetical ability, based on the core cognitive abilities for subitizing and estimation, numerosities can be treated in a limited and/or approximate manner. With arithmetical ability, numerosities are processed (counted, operated on) systematically in a discrete, linear, and unbounded manner. In this paper, I study the theory of enculturation as presented by Menary (2015) as a possible explanation of how we make the move from (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  3. Arrow's theorem, ultrafilters, and reverse mathematics.Benedict Eastaugh - forthcoming - Review of Symbolic Logic.
    This paper initiates the reverse mathematics of social choice theory, studying Arrow's impossibility theorem and related results including Fishburn's possibility theorem and the Kirman–Sondermann theorem within the framework of reverse mathematics. We formalise fundamental notions of social choice theory in second-order arithmetic, yielding a definition of countable society which is tractable in RCA0. We then show that the Kirman–Sondermann analysis of social welfare functions can be carried out in RCA0. This approach yields a proof of Arrow's theorem in RCA0, and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4.  66
    Why there can be no mathematical or meta-mathematical proof of consistency for ZF.Bhupinder Singh Anand - manuscript
    In the first part of this investigation we highlight two, seemingly irreconcilable, beliefs that suggest an impending crisis in the teaching, research, and practice of—primarily state-supported—mathematics: (a) the belief, with increasing, essentially faith-based, conviction and authority amongst academics that first-order Set Theory can be treated as the lingua franca of mathematics, since its theorems—even if unfalsifiable—can be treated as ‘knowledge’ because they are finite proof sequences which are entailed finitarily by self-evidently Justified True Beliefs; and (b) the slowly emerging, but (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5. Three Dogmas of First-Order Logic and some Evidence-based Consequences for Constructive Mathematics of differentiating between Hilbertian Theism, Brouwerian Atheism and Finitary Agnosticism.Bhupinder Singh Anand - manuscript
    We show how removing faith-based beliefs in current philosophies of classical and constructive mathematics admits formal, evidence-based, definitions of constructive mathematics; of a constructively well-defined logic of a formal mathematical language; and of a constructively well-defined model of such a language. -/- We argue that, from an evidence-based perspective, classical approaches which follow Hilbert's formal definitions of quantification can be labelled `theistic'; whilst constructive approaches based on Brouwer's philosophy of Intuitionism can be labelled `atheistic'. -/- We then adopt what may (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6. The Concept of a Substance and its Linguistic Embodiment.Henry Laycock - 2023 - Philosophies 8 (6):114.
    My objective is a better comprehension of two theoretically fundamental concepts. One, the concept of a substance in an ordinary (non-Aristotelian) sense, ranging over such things as salt, carbon, copper, iron, water, and methane – kinds of stuff that now count as (chemical) elements and compounds. The other I’ll call the object-concept in the abstract sense of Russell, Wittgenstein, and Frege in their logico-semantical enquiries. The material object-concept constitutes the heart of our received logico / ontic system, still massively (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  7. On interpreting Chaitin's incompleteness theorem.Panu Raatikainen - 1998 - Journal of Philosophical Logic 27 (6):569-586.
    The aim of this paper is to comprehensively question the validity of the standard way of interpreting Chaitin's famous incompleteness theorem, which says that for every formalized theory of arithmetic there is a finite constant c such that the theory in question cannot prove any particular number to have Kolmogorov complexity larger than c. The received interpretation of theorem claims that the limiting constant is determined by the complexity of the theory itself, which is assumed to be good measure of (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  8. ONE AND THE MULTIPLE ON THE PHILOSOPHY OF MATHEMATICS - ALEXIS KARPOUZOS.Alexis Karpouzos - 2025 - Comsic Spirit 1:6.
    The relationship between the One and the Multiple in mystic philosophy is a profound and central theme that explores the nature of existence, the cosmos, and the divine. This theme is present in various mystical traditions, including those of the East and West, and it addresses the paradoxical coexistence of the unity and multiplicity of all things. -/- In mystic philosophy, the **One** often represents the ultimate reality, the source from which all things emanate and to which all things return. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  9. Endless Incoherence— A Review of Shoemaker's Physical Realization (2009)(review revised 2019).Michael Starks - 2019 - In Talking Monkeys: Philosophy, Psychology, Science, Religion and Politics on a Doomed Planet - Articles and Reviews 2006-2019 Michael Starks 3rd Edition. Las Vegas, NV USA: Reality Press. pp. 284-301.
    Over 40 years ago I read a small grey book with metaphysics in the title which began with the words “Metaphysics is dead. Wittgenstein has killed it.” I am one of many who agree but sadly the rest of the world has not gotten the message. Shoemaker’s work is nonsense on stilts but is unusual only in that it never deviates into sense from the first paragraph to the last. At least with Dennett, Carruthers, Churchland etc. one gets a breath (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. Arithmetic, Set Theory, Reduction and Explanation.William D’Alessandro - 2018 - Synthese 195 (11):5059-5089.
    Philosophers of science since Nagel have been interested in the links between intertheoretic reduction and explanation, understanding and other forms of epistemic progress. Although intertheoretic reduction is widely agreed to occur in pure mathematics as well as empirical science, the relationship between reduction and explanation in the mathematical setting has rarely been investigated in a similarly serious way. This paper examines an important particular case: the reduction of arithmetic to set theory. I claim that the reduction is unexplanatory. In defense (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  11. Arithmetic Judgements, First-Person Judgements and Immunity to Error Through Misidentification.Michele Palmira - 2018 - Review of Philosophy and Psychology 10 (1):155-172.
    The paper explores the idea that some singular judgements about the natural numbers are immune to error through misidentification by pursuing a comparison between arithmetic judgements and first-person judgements. By doing so, the first part of the paper offers a conciliatory resolution of the Coliva-Pryor dispute about so-called “de re” and “which-object” misidentification. The second part of the paper draws some lessons about what it takes to explain immunity to error through misidentification. The lessons are: First, the so-called Simple Account (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  12. Semantic Arithmetic: A Preface.John Corcoran - 1995 - Agora 14 (1):149-156.
    SEMANTIC ARITHMETIC: A PREFACE John Corcoran Abstract Number theory, or pure arithmetic, concerns the natural numbers themselves, not the notation used, and in particular not the numerals. String theory, or pure syntax, concems the numerals as strings of «uninterpreted» characters without regard to the numbe~s they may be used to denote. Number theory is purely arithmetic; string theory is purely syntactical... in so far as the universe of discourse alone is considered. Semantic arithmetic is a broad subject which begins when (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  13. Exact and Approximate Arithmetic in an Amazonian Indigene Group.Pierre Pica, Cathy Lemer, Véronique Izard & Stanislas Dehaene - 2004 - Science 306 (5695):499-503.
    Is calculation possible without language? Or is the human ability for arithmetic dependent on the language faculty? To clarify the relation between language and arithmetic, we studied numerical cognition in speakers of Mundurukú, an Amazonian language with a very small lexicon of number words. Although the Mundurukú lack words for numbers beyond 5, they are able to compare and add large approximate numbers that are far beyond their naming range. However, they fail in exact arithmetic with numbers larger than 4 (...)
    Download  
     
    Export citation  
     
    Bookmark   173 citations  
  14. An Arithmetization of Logical Oppositions.Fabien Schang - 2016 - In Jean-Yves Béziau & Gianfranco Basti (eds.), The Square of Opposition: A Cornerstone of Thought. Basel, Switzerland: Birkhäuser. pp. 215-237.
    An arithmetic theory of oppositions is devised by comparing expressions, Boolean bitstrings, and integers. This leads to a set of correspondences between three domains of investigation, namely: logic, geometry, and arithmetic. The structural properties of each area are investigated in turn, before justifying the procedure as a whole. Io finish, I show how this helps to improve the logical calculus of oppositions, through the consideration of corresponding operations between integers.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  15. Arithmetic is Determinate.Zachary Goodsell - 2021 - Journal of Philosophical Logic 51 (1):127-150.
    Orthodoxy holds that there is a determinate fact of the matter about every arithmetical claim. Little argument has been supplied in favour of orthodoxy, and work of Field, Warren and Waxman, and others suggests that the presumption in its favour is unjustified. This paper supports orthodoxy by establishing the determinacy of arithmetic in a well-motivated modal plural logic. Recasting this result in higher-order logic reveals that even the nominalist who thinks that there are only finitely many things should think (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  16. Reducing Arithmetic to Set Theory.A. C. Paseau - 2009 - In Ø. Linnebo O. Bueno (ed.), New Waves in Philosophy of Mathematics. Palgrave-Macmillan. pp. 35-55.
    The revival of the philosophy of mathematics in the 60s following its post-1931 slump left us with two conflicting positions on arithmetic’s ontological relationship to set theory. W.V. Quine’s view, presented in 'Word and Object' (1960), was that numbers are sets. The opposing view was advanced in another milestone of twentieth-century philosophy of mathematics, Paul Benacerraf’s 'What Numbers Could Not Be' (1965): one of the things numbers could not be, it explained, was sets; the other thing numbers could not be, (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  17. Developing Artificial Human-Like Arithmetical Intelligence (and Why).Markus Pantsar - 2023 - Minds and Machines 33 (3):379-396.
    Why would we want to develop artificial human-like arithmetical intelligence, when computers already outperform humans in arithmetical calculations? Aside from arithmetic consisting of much more than mere calculations, one suggested reason is that AI research can help us explain the development of human arithmetical cognition. Here I argue that this question needs to be studied already in the context of basic, non-symbolic, numerical cognition. Analyzing recent machine learning research on artificial neural networks, I show how AI studies (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  18. Purity in Arithmetic: some Formal and Informal Issues.Andrew Arana - 2014 - In Godehard Link (ed.), Formalism and Beyond: On the Nature of Mathematical Discourse. Boston: De Gruyter. pp. 315-336.
    Over the years many mathematicians have voiced a preference for proofs that stay “close” to the statements being proved, avoiding “foreign”, “extraneous”, or “remote” considerations. Such proofs have come to be known as “pure”. Purity issues have arisen repeatedly in the practice of arithmetic; a famous instance is the question of complex-analytic considerations in the proof of the prime number theorem. This article surveys several such issues, and discusses ways in which logical considerations shed light on these issues.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  19. Hilbert arithmetic as a Pythagorean arithmetic: arithmetic as transcendental.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (54):1-24.
    The paper considers a generalization of Peano arithmetic, Hilbert arithmetic as the basis of the world in a Pythagorean manner. Hilbert arithmetic unifies the foundations of mathematics (Peano arithmetic and set theory), foundations of physics (quantum mechanics and information), and philosophical transcendentalism (Husserl’s phenomenology) into a formal theory and mathematical structure literally following Husserl’s tracе of “philosophy as a rigorous science”. In the pathway to that objective, Hilbert arithmetic identifies by itself information related to finite sets and series and quantum (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20. Modal-Epistemic Arithmetic and the problem of quantifying in.Jan Heylen - 2013 - Synthese 190 (1):89-111.
    The subject of this article is Modal-Epistemic Arithmetic (MEA), a theory introduced by Horsten to interpret Epistemic Arithmetic (EA), which in turn was introduced by Shapiro to interpret Heyting Arithmetic. I will show how to interpret MEA in EA such that one can prove that the interpretation of EA is MEA is faithful. Moreover, I will show that one can get rid of a particular Platonist assumption. Then I will discuss models for MEA in light of the problems of logical (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  21. The Relationship of Arithmetic As Two Twin Peano Arithmetic(s) and Set Theory: A New Glance From the Theory of Information.Vasil Penchev - 2020 - Metaphilosophy eJournal (Elseviers: SSRN) 12 (10):1-33.
    The paper introduces and utilizes a few new concepts: “nonstandard Peano arithmetic”, “complementary Peano arithmetic”, “Hilbert arithmetic”. They identify the foundations of both mathematics and physics demonstrating the equivalence of the newly introduced Hilbert arithmetic and the separable complex Hilbert space of quantum mechanics in turn underlying physics and all the world. That new both mathematical and physical ground can be recognized as information complemented and generalized by quantum information. A few fundamental mathematical problems of the present such as Fermat’s (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  22. Arithmetic with Satisfaction.James Cain - 1995 - Notre Dame Journal of Formal Logic 36 (2):299-303.
    A language in which we can express arithmetic and which contains its own satisfaction predicate (in the style of Kripke's theory of truth) can be formulated using just two nonlogical primitives: (the successor function) and Sat (a satisfaction predicate).
    Download  
     
    Export citation  
     
    Bookmark  
  23. A Comprehensive Account of Blame: Self-Blame, Non-Moral Blame, and Blame for the Non-Voluntary.Douglas W. Portmore - 2022 - In Andreas Carlsson (ed.), Self-Blame and Moral Responsibility. New York, USA: Cambridge University Press.
    Blame is multifarious. It can be passionate or dispassionate. It can be expressed or kept private. We blame both the living and the dead. And we blame ourselves as well as others. What’s more, we blame ourselves, not only for our moral failings, but also for our non-moral failings: for our aesthetic bad taste, gustatory self-indulgence, or poor athletic performance. And we blame ourselves both for things over which we exerted agential control (e.g., our voluntary acts) and for things over (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  24. The Comprehensibility of the Universe: A New Conception of Science.Nicholas Maxwell - 1998 - Oxford, GB: Oxford University Press UK.
    The Comprehensibility of the Universe puts forward a radically new conception of science. According to the orthodox conception, scientific theories are accepted and rejected impartially with respect to evidence, no permanent assumption being made about the world independently of the evidence. Nicholas Maxwell argues that this orthodox view is untenable. He urges that in its place a new orthodoxy is needed, which sees science as making a hierarchy of metaphysical assumptions about the comprehensibility and knowability of the universe, these assumptions (...)
    Download  
     
    Export citation  
     
    Bookmark   33 citations  
  25. Arithmetical algorithms for elementary patterns.Samuel A. Alexander - 2015 - Archive for Mathematical Logic 54 (1-2):113-132.
    Elementary patterns of resemblance notate ordinals up to the ordinal of Pi^1_1-CA_0. We provide ordinal multiplication and exponentiation algorithms using these notations.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  26. Carnapian Modal and Epistemic Arithmetic.Heylen Jan - 2009 - In Carrara Massimiliano & Morato Vittorio (eds.), Language, Knowledge, and Metaphysics. Selected papers from the First SIFA Graduate Conference. College Publications. pp. 97-121.
    The subject of the first section is Carnapian modal logic. One of the things I will do there is to prove that certain description principles, viz. the ''self-predication principles'', i.e. the principles according to which a descriptive term satisfies its own descriptive condition, are theorems and that others are not. The second section will be devoted to Carnapian modal arithmetic. I will prove that, if the arithmetical theory contains the standard weak principle of induction, modal truth collapses to truth. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  27. There May Be Many Arithmetical Gödel Sentences.Kaave Lajevardi & Saeed Salehi - 2021 - Philosophia Mathematica 29 (2):278–287.
    We argue that, under the usual assumptions for sufficiently strong arithmetical theories that are subject to Gödel’s First Incompleteness Theorem, one cannot, without impropriety, talk about *the* Gödel sentence of the theory. The reason is that, without violating the requirements of Gödel’s theorem, there could be a true sentence and a false one each of which is provably equivalent to its own unprovability in the theory if the theory is unsound.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  28. Weak Arithmetics and Kripke Models.Morteza Moniri - 2002 - Mathematical Logic Quarterly 48 (1):157-160.
    In the first section of this paper we show that i Π1 ≡ W⌝⌝lΠ1 and that a Kripke model which decides bounded formulas forces iΠ1 if and only if the union of the worlds in any path in it satisflies IΠ1. In particular, the union of the worlds in any path of a Kripke model of HA models IΠ1. In the second section of the paper, we show that for equivalence of forcing and satisfaction of Πm-formulas in a linear Kripke (...)
    Download  
     
    Export citation  
     
    Bookmark  
  29. Formal Arithmetic Before Grundgesetze.Richard Kimberly Heck - 2019 - In Philip A. Ebert & Marcus Rossberg (eds.), Essays on Frege's Basic Laws of Arithmetic. Oxford: Oxford University Press. pp. 497-537.
    A speculative investigation of how Frege's logical views change between Begriffsschrift and Grundgesetze and how this might have affected the formal development of logicism.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  30. Two-Sorted Frege Arithmetic is Not Conservative.Stephen Mackereth & Jeremy Avigad - 2022 - Review of Symbolic Logic 16 (4):1199-1232.
    Neo-Fregean logicists claim that Hume’s Principle (HP) may be taken as an implicit definition of cardinal number, true simply by fiat. A long-standing problem for neo-Fregean logicism is that HP is not deductively conservative over pure axiomatic second-order logic. This seems to preclude HP from being true by fiat. In this paper, we study Richard Kimberly Heck’s Two-Sorted Frege Arithmetic (2FA), a variation on HP which has been thought to be deductively conservative over second-order logic. We show that it isn’t. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  31. An empirically feasible approach to the epistemology of arithmetic.Markus Pantsar - 2014 - Synthese 191 (17):4201-4229.
    Recent years have seen an explosion of empirical data concerning arithmetical cognition. In this paper that data is taken to be philosophically important and an outline for an empirically feasible epistemological theory of arithmetic is presented. The epistemological theory is based on the empirically well-supported hypothesis that our arithmetical ability is built on a protoarithmetical ability to categorize observations in terms of quantities that we have already as infants and share with many nonhuman animals. It is argued here (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  32. Comprehension, Demonstration, and Accuracy in Aristotle.Breno Zuppolini - 2020 - Journal of the History of Philosophy 58 (1):29-48.
    according to aristotle's posterior analytics, scientific expertise is composed of two different cognitive dispositions. Some propositions in the domain can be scientifically explained, which means that they are known by "demonstration", a deductive argument in which the premises are explanatory of the conclusion. Thus, the kind of cognition that apprehends those propositions is called "demonstrative knowledge".1 However, not all propositions in a scientific domain are demonstrable. Demonstrations are ultimately based on indemonstrable principles, whose knowledge is called "comprehension".2 If the (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  33. Ramified Frege Arithmetic.Richard G. Heck - 2011 - Journal of Philosophical Logic 40 (6):715-735.
    Øystein Linnebo has recently shown that the existence of successors cannot be proven in predicative Frege arithmetic, using Frege’s definitions of arithmetical notions. By contrast, it is shown here that the existence of successor can be proven in ramified predicative Frege arithmetic.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  34. On Radical Enactivist Accounts of Arithmetical Cognition.Markus Pantsar - 2022 - Ergo: An Open Access Journal of Philosophy 9.
    Hutto and Myin have proposed an account of radically enactive (or embodied) cognition (REC) as an explanation of cognitive phenomena, one that does not include mental representations or mental content in basic minds. Recently, Zahidi and Myin have presented an account of arithmetical cognition that is consistent with the REC view. In this paper, I first evaluate the feasibility of that account by focusing on the evolutionarily developed proto-arithmetical abilities and whether empirical data on them support the radical (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  35. Arithmetic logical Irreversibility and the Halting Problem (Revised and Fixed version).Yair Lapin - manuscript
    The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially, this means that an algorithm can only preserve information about an input, rather than generate new information. This uncertainty arises from characteristics such as arithmetic logical irreversibility, Landauer's principle, and memory erasure, which ultimately lead to a loss of information and an increase in entropy. To measure this uncertainty and loss (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36.  53
    A Comprehensive Evaluation and Methodology on Enhancing Computational Efficiency through Accelerated Computing.Sankara Reddy Thamma - 2024 - Journal of Science Technology and Research (JSTAR) 5 (1):517-525.
    Accelerated computing leverages specialized hardware and software techniques to optimize the performance of computationally intensive tasks, offering significant speed-ups in scientific, engineering, and data-driven fields. This paper presents a comprehensive study examining the role of accelerated computing in enhancing processing capabilities and reducing execution times in diverse applications. Using a custom-designed experimental framework, we evaluated different methodologies for parallelization, GPU acceleration, and CPU-GPU coordination. The aim was to assess how various factors, such as data size, computational complexity, and task concurrency, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  37. Comprehensive or Political Liberalism? The Impartial Spectator and the Justification of Political Principles.Nir Ben-Moshe - 2021 - Utilitas 33 (3):253-269.
    John Rawls raises three challenges – to which one can add a fourth challenge – to an impartial spectator account: (a) the impartial spectator is a utility-maximizing device that does not take seriously the distinction between persons; (b) the account does not guarantee that the principles of justice will be derived from it; (c) the notion of impartiality in the account is the wrong one, since it does not define impartiality from the standpoint of the litigants themselves; (d) the account (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  38. Arithmetic without the successor axiom.Andrew Boucher -
    Second-order Peano Arithmetic minus the Successor Axiom is developed from first principles through Quadratic Reciprocity and a proof of self-consistency. This paper combines 4 other papers of the author in a self-contained exposition.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  39. On the Arithmetical Truth of Self‐Referential Sentences.Kaave Lajevardi & Saeed Salehi - 2019 - Theoria 85 (1):8-17.
    We take an argument of Gödel's from his ground‐breaking 1931 paper, generalize it, and examine its validity. The argument in question is this: "the sentence G says about itself that it is not provable, and G is indeed not provable; therefore, G is true".
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  40. Predicative Frege Arithmetic and ‘Everyday’ Mathematics.Richard Heck - 2014 - Philosophia Mathematica 22 (3):279-307.
    The primary purpose of this note is to demonstrate that predicative Frege arithmetic naturally interprets certain weak but non-trivial arithmetical theories. It will take almost as long to explain what this means and why it matters as it will to prove the results.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  41.  57
    Husserl’s Philosophy of Arithmetic in Reviews.Carlo Ierna - 2013 - The New Yearbook for Phenomenology and Phenomenological Philosophy 12:198-242.
    This present collection of (translations of) reviews is intended to help obtain a more balanced picture of the reception and impact of Edmund Husserl’s first book, the 1891 Philosophy of Arithmetic. One of the insights to be gained from this non-exhaustive collection of reviews is that the Philosophy of Arithmetic had a much more widespread reception than hitherto assumed: in the present collection alone there already are fourteen, all published between 1891 and 1895. Three of the reviews appeared in mathematical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  42. The justification of comprehension-based beliefs.J. P. Grodniewicz - 2022 - Review of Philosophy and Psychology 13 (1):109-126.
    What justifies our beliefs about what other people say? According to epistemic inferentialism​, the justification of comprehension-based beliefs depends on the justification of other beliefs, e.g., beliefs about what words the speaker uttered or even what sounds they produced. According to epistemic non-inferentialism, the justification of comprehension-based beliefs ​does not depend on the justification of other beliefs. This paper offers a new defense of epistemic non-inferentialism. First, I discuss three counterexamples to epistemic non-inferentialism provided recently by Brendan Balcerak (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  43. Gentzen’s “cut rule” and quantum measurement in terms of Hilbert arithmetic. Metaphor and understanding modeled formally.Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal 14 (14):1-37.
    Hilbert arithmetic in a wide sense, including Hilbert arithmetic in a narrow sense consisting by two dual and anti-isometric Peano arithmetics, on the one hand, and the qubit Hilbert space (originating for the standard separable complex Hilbert space of quantum mechanics), on the other hand, allows for an arithmetic version of Gentzen’s cut elimination and quantum measurement to be described uniformy as two processes occurring accordingly in those two branches. A philosophical reflection also justifying that unity by quantum neo-Pythagoreanism links (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44. Arithmetic, Logicism, and Frege’s Definitions.Timothy Perrine - 2021 - International Philosophical Quarterly 61 (1):5-25.
    This paper describes both an exegetical puzzle that lies at the heart of Frege’s writings—how to reconcile his logicism with his definitions and claims about his definitions—and two interpretations that try to resolve that puzzle, what I call the “explicative interpretation” and the “analysis interpretation.” This paper defends the explicative interpretation primarily by criticizing the most careful and sophisticated defenses of the analysis interpretation, those given my Michael Dummett and Patricia Blanchette. Specifically, I argue that Frege’s text either are inconsistent (...)
    Download  
     
    Export citation  
     
    Bookmark  
  45. Mental simulation and language comprehension: The case of copredication.Michelle Liu - 2024 - Mind and Language 39 (1):2-21.
    Empirical evidence suggests that perceptual‐motor simulations are often constitutively involved in language comprehension. Call this “the simulation view of language comprehension”. This article applies the simulation view to illuminate the much‐discussed phenomenon of copredication, where a noun permits multiple predications which seem to select different senses of the noun simultaneously. On the proposed account, the (in)felicitousness of a copredicational sentence is closely associated with the perceptual simulations that the language user deploys in comprehending the sentence.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  46. (1 other version)The Modal Status of Contextually A Priori Arithmetical Truths.Markus Pantsar - 2016 - In Francesca Boccuni & Andrea Sereni (eds.), Objectivity, Realism, and Proof. FilMat Studies in the Philosophy of Mathematics. Cham, Switzerland: Springer International Publishing. pp. 67-79.
    In Pantsar (2014), an outline for an empirically feasible epistemological theory of arithmetic is presented. According to that theory, arithmetical knowledge is based on biological primitives but in the resulting empirical context develops an essentially a priori character. Such contextual a priori theory of arithmetical knowledge can explain two of the three characteristics that are usually associated with mathematical knowledge: that it appears to be a priori and objective. In this paper it is argued that it can also (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  47. Husserl’s Early Semiotics and Number Signs: Philosophy of Arithmetic through the Lens of “On the Logic of Signs ”.Thomas Byrne - 2017 - Journal of the British Society for Phenomenology 48 (4):287-303.
    This paper demonstrates that Edmund Husserl’s frequently overlooked 1890 manuscript, “On the Logic of Signs,” when closely investigated, reveals itself to be the hermeneutical touchstone for his seminal 1891 Philosophy of Arithmetic. As the former comprises Husserl’s earliest attempt to account for all of the different kinds of signitive experience, his conclusions there can be directly applied to the latter, which is focused on one particular type of sign; namely, number signs. Husserl’s 1890 descriptions of motivating and replacing signs will (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  48. The (Metaphysical) Foundations of Arithmetic?Thomas Donaldson - 2017 - Noûs 51 (4):775-801.
    Gideon Rosen and Robert Schwartzkopff have independently suggested (variants of) the following claim, which is a varian of Hume's Principle: -/- When the number of Fs is identical to the number of Gs, this fact is grounded by the fact that there is a one-to-one correspondence between the Fs and Gs. -/- My paper is a detailed critique of the proposal. I don't find any decisive refutation of the proposal. At the same time, it has some consequences which many will (...)
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  49. An Exact Pair for the Arithmetic Degrees Whose Join is Not a Weak Uniform Upper Bound.Harold T. Hodes - 1982 - Recursive Function Theory-Newsletters 28.
    Proof uses forcing on perfect trees for 2-quantifier sentences in the language of arithmetic. The result extends to exact pairs for the hyperarithmetic degrees.
    Download  
     
    Export citation  
     
    Bookmark  
  50. Fermat’s last theorem proved in Hilbert arithmetic. II. Its proof in Hilbert arithmetic by the Kochen-Specker theorem with or without induction.Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 14 (10):1-52.
    The paper is a continuation of another paper published as Part I. Now, the case of “n=3” is inferred as a corollary from the Kochen and Specker theorem (1967): the eventual solutions of Fermat’s equation for “n=3” would correspond to an admissible disjunctive division of qubit into two absolutely independent parts therefore versus the contextuality of any qubit, implied by the Kochen – Specker theorem. Incommensurability (implied by the absence of hidden variables) is considered as dual to quantum contextuality. The (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 936