Results for 'transfinite arithmetic'

340 found
Order:
  1. Inverse Operations with Transfinite Numbers and the Kalam Cosmological Argument.Graham Oppy - 1995 - International Philosophical Quarterly 35 (2):219-221.
    William Lane Craig has argued that there cannot be actual infinities because inverse operations are not well-defined for infinities. I point out that, in fact, there are mathematical systems in which inverse operations for infinities are well-defined. In particular, the theory introduced in John Conway's *On Numbers and Games* yields a well-defined field that includes all of Cantor's transfinite numbers.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  2. Retrieving the Mathematical Mission of the Continuum Concept from the Transfinitely Reductionist Debris of Cantor’s Paradise. Extended Abstract.Edward G. Belaga - forthcoming - International Journal of Pure and Applied Mathematics.
    What is so special and mysterious about the Continuum, this ancient, always topical, and alongside the concept of integers, most intuitively transparent and omnipresent conceptual and formal medium for mathematical constructions and the battle field of mathematical inquiries ? And why it resists the century long siege by best mathematical minds of all times committed to penetrate once and for all its set-theoretical enigma ? -/- The double-edged purpose of the present study is to save from the transfinite deadlock (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3. From Traditional Set Theory – that of Cantor, Hilbert , Gödel, Cohen – to Its Necessary Quantum Extension.Edward G. Belaga - manuscript
    The original purpose of the present study, 2011, started with a preprint «On the Probable Failure of the Uncountable Power Set Axiom», 1988, is to save from the transfinite deadlock of higher set theory the jewel of mathematical Continuum — this genuine, even if mostly forgotten today raison d’être of all traditional set-theoretical enterprises to Infinity and beyond, from Georg Cantor to David Hilbert to Kurt Gödel to W. Hugh Woodin to Buzz Lightyear.
    Download  
     
    Export citation  
     
    Bookmark  
  4. Review of The Art of the Infinite by R. Kaplan, E. Kaplan 324p(2003).Michael Starks - 2016 - In Suicidal Utopian Delusions in the 21st Century: Philosophy, Human Nature and the Collapse of Civilization-- Articles and Reviews 2006-2017 2nd Edition Feb 2018. Las Vegas, USA: Reality Press. pp. 619.
    This book tries to present math to the millions and does a pretty good job. It is simple and sometimes witty but often the literary allusions intrude and the text bogs down in pages of relentless math--lovely if you like it and horrid if you don´t. If you already know alot of math you will still probably find the discussions of general math, geometry, projective geometry, and infinite series to be a nice refresher. If you don´t know any and don´t (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5. The Quantum Strategy of Completeness: On the Self-Foundation of Mathematics.Vasil Penchev - 2020 - Cultural Anthropology eJournal (Elsevier: SSRN) 5 (136):1-12.
    Gentzen’s approach by transfinite induction and that of intuitionist Heyting arithmetic to completeness and the self-foundation of mathematics are compared and opposed to the Gödel incompleteness results as to Peano arithmetic. Quantum mechanics involves infinity by Hilbert space, but it is finitist as any experimental science. The absence of hidden variables in it interpretable as its completeness should resurrect Hilbert’s finitism at the cost of relevant modification of the latter already hinted by intuitionism and Gentzen’s approaches for (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6. Bolzano’s Mathematical Infinite.Anna Bellomo & Guillaume Massas - 2021 - Review of Symbolic Logic:1-55.
    Bernard Bolzano (1781–1848) is commonly thought to have attempted to develop a theory of size for infinite collections that follows the so-called part–whole principle, according to which the whole is always greater than any of its proper parts. In this paper, we develop a novel interpretation of Bolzano’s mature theory of the infinite and show that, contrary to mainstream interpretations, it is best understood as a theory of infinite sums. Our formal results show that Bolzano’s infinite sums can be equipped (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  7. A defense of Isaacson’s thesis, or how to make sense of the boundaries of finite mathematics.Pablo Dopico - 2024 - Synthese 203 (2):1-22.
    Daniel Isaacson has advanced an epistemic notion of arithmetical truth according to which the latter is the set of truths that we grasp on the basis of our understanding of the structure of natural numbers alone. Isaacson’s thesis is then the claim that Peano Arithmetic (PA) is the theory of finite mathematics, in the sense that it proves all and only arithmetical truths thus understood. In this paper, we raise a challenge for the thesis and show how it can (...)
    Download  
     
    Export citation  
     
    Bookmark  
  8. All science as rigorous science: the principle of constructive mathematizability of any theory.Vasil Penchev - 2020 - Logic and Philosophy of Mathematics eJournal 12 (12):1-15.
    A principle, according to which any scientific theory can be mathematized, is investigated. Social science, liberal arts, history, and philosophy are meant first of all. That kind of theory is presupposed to be a consistent text, which can be exhaustedly represented by a certain mathematical structure constructively. In thus used, the term “theory” includes all hypotheses as yet unconfirmed as already rejected. The investigation of the sketch of a possible proof of the principle demonstrates that it should be accepted rather (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9. Skolem’s “paradox” as logic of ground: The mutual foundation of both proper and improper interpretations.Vasil Penchev - 2020 - Epistemology eJournal (Elsevier: SSRN) 13 (19):1-16.
    A principle, according to which any scientific theory can be mathematized, is investigated. That theory is presupposed to be a consistent text, which can be exhaustedly represented by a certain mathematical structure constructively. In thus used, the term “theory” includes all hypotheses as yet unconfirmed as already rejected. The investigation of the sketch of a possible proof of the principle demonstrates that it should be accepted rather a metamathematical axiom about the relation of mathematics and reality. Its investigation needs philosophical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. What Is Quantum Information? Information Symmetry and Mechanical Motion.Vasil Penchev - 2020 - Information Theory and Research eJournal (Elsevier: SSRN) 1 (20):1-7.
    The concept of quantum information is introduced as both normed superposition of two orthogonal sub-spaces of the separable complex Hilbert space and in-variance of Hamilton and Lagrange representation of any mechanical system. The base is the isomorphism of the standard introduction and the representation of a qubit to a 3D unit ball, in which two points are chosen. The separable complex Hilbert space is considered as the free variable of quantum information and any point in it (a wave function describing (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. The Symmetries of Quantum and Classical Information. The Ressurrected “Ether" of Quantum Information.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (41):1-36.
    The paper considers the symmetries of a bit of information corresponding to one, two or three qubits of quantum information and identifiable as the three basic symmetries of the Standard model, U(1), SU(2), and SU(3) accordingly. They refer to “empty qubits” (or the free variable of quantum information), i.e. those in which no point is chosen (recorded). The choice of a certain point violates those symmetries. It can be represented furthermore as the choice of a privileged reference frame (e.g. that (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  12. Some Remarks on Wittgenstein’s Philosophy of Mathematics.Richard Startup - 2020 - Open Journal of Philosophy 10 (1):45-65.
    Drawing mainly from the Tractatus Logico-Philosophicus and his middle period writings, strategic issues and problems arising from Wittgenstein’s philosophy of mathematics are discussed. Topics have been so chosen as to assist mediation between the perspective of philosophers and that of mathematicians on their developing discipline. There is consideration of rules within arithmetic and geometry and Wittgenstein’s distinctive approach to number systems whether elementary or transfinite. Examples are presented to illuminate the relation between the meaning of an arithmetical generalisation (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  13. Hilbert’s Finitism: Historical, Philosophical, and Metamathematical Perspectives.Richard Zach - 2001 - Dissertation, University of California, Berkeley
    In the 1920s, David Hilbert proposed a research program with the aim of providing mathematics with a secure foundation. This was to be accomplished by first formalizing logic and mathematics in their entirety, and then showing---using only so-called finitistic principles---that these formalizations are free of contradictions. ;In the area of logic, the Hilbert school accomplished major advances both in introducing new systems of logic, and in developing central metalogical notions, such as completeness and decidability. The analysis of unpublished material presented (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  14. A reductionist reading of Husserl’s phenomenology by Mach’s descriptivism and phenomenalism.Vasil Penchev - 2020 - Continental Philosophy eJournal 13 (9):1-4.
    Husserl’s phenomenology is what is used, and then the conception of “bracketing reality” is modelled to generalize Peano arithmetic in its relation to set theory in the foundation of mathematics. The obtained model is equivalent to the generalization of Peano arithmetic by means of replacing the axiom of induction with that of transfinite induction. A comparison to Mach’s doctrine is used to be revealed the fundamental and philosophical reductionism of Husserl’s phenomenology leading to a kind of Pythagoreanism (...)
    Download  
     
    Export citation  
     
    Bookmark  
  15. Quantum information as the information of infinite collections or series.Vasil Penchev - 2020 - Information Theory and Research eJournal (Elsevier: SSRN) 1 (14):1-8.
    The quantum information introduced by quantum mechanics is equivalent to a certain generalization of classical information: from finite to infinite series or collections. The quantity of information is the quantity of choices measured in the units of elementary choice. The “qubit”, can be interpreted as that generalization of “bit”, which is a choice among a continuum of alternatives. The axiom of choice is necessary for quantum information. The coherent state is transformed into a well-ordered series of results in time after (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. Upper bounds on locally countable admissible initial segments of a Turing degree hierarchy.Harold T. Hodes - 1981 - Journal of Symbolic Logic 46 (4):753-760.
    Where AR is the set of arithmetic Turing degrees, 0 (ω ) is the least member of { $\mathbf{\alpha}^{(2)}|\mathbf{a}$ is an upper bound on AR}. This situation is quite different if we examine HYP, the set of hyperarithmetic degrees. We shall prove (Corollary 1) that there is an a, an upper bound on HYP, whose hyperjump is the degree of Kleene's O. This paper generalizes this example, using an iteration of the jump operation into the transfinite which is (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  17. Transfinitely Transitive Value.Kacper Kowalczyk - 2021 - Philosophical Quarterly 72 (1):108-134.
    This paper develops transfinite extensions of transitivity and acyclicity in the context of population ethics. They are used to argue that it is better to add good lives, worse to add bad lives, and equally good to add neutral lives, where a life's value is understood as personal value. These conclusions rule out a number of theories of population ethics, feed into an argument for the repugnant conclusion, and allow us to reduce different-number comparisons to same-number ones. Challenges to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  18. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  19. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   170 citations  
  20. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  21. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  22. 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  
  23. Transfinite Number in Wittgenstein's Tractatus.James R. Connelly - 2021 - Journal for the History of Analytical Philosophy 9 (2).
    In his highly perceptive, if underappreciated introduction to Wittgenstein’s Tractatus, Russell identifies a “lacuna” within Wittgenstein’s theory of number, relating specifically to the topic of transfinite number. The goal of this paper is two-fold. The first is to show that Russell’s concerns cannot be dismissed on the grounds that they are external to the Tractarian project, deriving, perhaps, from logicist ambitions harbored by Russell but not shared by Wittgenstein. The extensibility of Wittgenstein’s theory of number to the case of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24. Arithmetic is Necessary.Zachary Goodsell - forthcoming - Journal of Philosophical Logic.
    (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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  25. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  26. Eliminating the ordinals from proofs. An analysis of transfinite recursion.Edoardo Rivello - 2014 - In Proceedings of the Conference "Philosophy, Mathematics, Linguistics. Aspects of Interaction", St. Petersburg, April 21-25, 2014. pp. 174-184.
    Transfinite ordinal numbers enter mathematical practice mainly via the method of definition by transfinite recursion. Outside of axiomatic set theory, there is a significant mathematical tradition in works recasting proofs by transfinite recursion in other terms, mostly with the intention of eliminating the ordinals from the proofs. Leaving aside the different motivations which lead each specific case, we investigate the mathematics of this action of proof transforming and we address the problem of formalising the philosophical notion of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  27. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  28. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  29. 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  
  30. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  31. The construction of transfinite equivalence algorithms.Han Geurdes - manuscript
    Context: Consistency of mathematical constructions in numerical analysis and the application of computerized proofs in the light of the occurrence of numerical chaos in simple systems. Purpose: To show that a computer in general and a numerical analysis in particular can add its own peculiarities to the subject under study. Hence the need of thorough theoretical studies on chaos in numerical simulation. Hence, a questioning of what e.g. a numerical disproof of a theorem in physics or a prediction in numerical (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. On Certain Axiomatizations of Arithmetic of Natural and Integer Numbers.Urszula Wybraniec-Skardowska - 2019 - Axioms 2019 (Deductive Systems).
    The systems of arithmetic discussed in this work are non-elementary theories. In this paper, natural numbers are characterized axiomatically in two di erent ways. We begin by recalling the classical set P of axioms of Peano’s arithmetic of natural numbers proposed in 1889 (including such primitive notions as: set of natural numbers, zero, successor of natural number) and compare it with the set W of axioms of this arithmetic (including the primitive notions like: set of natural numbers (...)
    Download  
     
    Export citation  
     
    Bookmark  
  33. 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  
  34. Arithmetic and possible experience.Emily Carson - manuscript
    This paper is part of a larger project about the relation between mathematics and transcendental philosophy that I think is the most interesting feature of Kant’s philosophy of mathematics. This general view is that in the course of arguing independently of mathematical considerations for conditions of experience, Kant also establishes conditions of the possibility of mathematics. My broad aim in this paper is to clarify the sense in which this is an accurate description of Kant’s view of the relation between (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. 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  
  36. 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  
  37. 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  
  38. 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 could potentially (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  39. 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 that (...)
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  40. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  41. 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 enactivist view. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  42. 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 the proto-arithmetical (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  43. 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  
  44. 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  
  45.  93
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  46. 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  
  47. 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  
  48. 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  
  49. 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 explain (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  50. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 340