View topic on PhilPapers for more information
Related categories

14 found
Order:
More results on PhilPapers
  1. added 2020-09-28
    Fermat’s Last Theorem Proved by Induction (and Accompanied by a Philosophical Comment).Vasil Penchev - 2020 - Metaphilosophy eJournal (Elsevier: SSRN) 12 (8):1-8.
    A proof of Fermat’s last theorem is demonstrated. It is very brief, simple, elementary, and absolutely arithmetical. The necessary premises for the proof are only: the three definitive properties of the relation of equality (identity, symmetry, and transitivity), modus tollens, axiom of induction, the proof of Fermat’s last theorem in the case of.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  2. added 2020-09-02
    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 (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  3. added 2020-07-22
    Invited Book Review of Stanislas Debaene, The Number Sense: How the Mind Creates Mathematics (New York: Oxford University Press, 1997). [REVIEW]Stephen R. Palmquist - 2012 - Journal of Scientific Exploration 26 (4):928-930.
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  4. added 2020-06-14
    Неразрешимост на първата теорема за непълнотата. Гьоделова и Хилбертова математика.Vasil Penchev - 2010 - Philosophical Alternatives 19 (5):104-119.
    Can the so-ca\led first incompleteness theorem refer to itself? Many or maybe even all the paradoxes in mathematics are connected with some kind of self-reference. Gбdel built his proof on the ground of self-reference: а statement which claims its unprovabllity. So, he demonstrated that undecidaЬle propositions exist in any enough rich axiomatics (i.e. such one which contains Peano arithmetic in some sense). What about the decidabllity of the very first incompleteness theorem? We can display that it fulfills its conditions. That's (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  5. added 2020-04-10
    Hilbert's 10th Problem for Solutions in a Subring of Q.Agnieszka Peszek & Apoloniusz Tyszka - 2019 - Scientific Annals of Computer Science 29 (1):101-111.
    Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smoryński's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. Let R be a subring of Q with or without 1. By H_{10}(R), we denote the problem of whether there exists an algorithm which for any given Diophantine equation with integer coefficients, can decide whether (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  6. added 2020-04-10
    Two Conjectures on the Arithmetic in ℝ and ℂ†.Apoloniusz Tyszka - 2010 - Mathematical Logic Quarterly 56 (2):175-184.
    Let G be an additive subgroup of ℂ, let Wn = {xi = 1, xi + xj = xk: i, j, k ∈ {1, …, n }}, and define En = {xi = 1, xi + xj = xk, xi · xj = xk: i, j, k ∈ {1, …, n }}. We discuss two conjectures. If a system S ⊆ En is consistent over ℝ, then S has a real solution which consists of numbers whose absolute values belong to (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  7. added 2020-02-14
    Proving Quadratic Reciprocity: Explanation, Disagreement, Transparency and Depth.William D'Alessandro - 2020 - Synthese:1-44.
    Gauss’s quadratic reciprocity theorem is among the most important results in the history of number theory. It’s also among the most mysterious: since its discovery in the late 18th century, mathematicians have regarded reciprocity as a deeply surprising fact in need of explanation. Intriguingly, though, there’s little agreement on how the theorem is best explained. Two quite different kinds of proof are most often praised as explanatory: an elementary argument that gives the theorem an intuitive geometric interpretation, due to Gauss (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  8. added 2019-09-18
    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 and relation of (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  9. added 2017-05-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 defense (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   4 citations  
  10. added 2017-01-12
    Purity in Arithmetic: Some Formal and Informal Issues.Andrew Arana - 2014 - In Godehard Link (ed.), Formalism and Beyond: On the Nature of Mathematical Discourse. 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.
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   1 citation  
  11. added 2017-01-12
    L'infinité des nombres premiers : une étude de cas de la pureté des méthodes.Andrew Arana - 2011 - Les Etudes Philosophiques 97 (2):193.
    Une preuve est pure si, en gros, elle ne réfère dans son développement qu’à ce qui est « proche » de, ou « intrinsèque » à l’énoncé à prouver. L’infinité des nombres premiers, un théorème classique de l’arithmétique, est un cas d’étude particulièrement riche pour les recherches philosophiques sur la pureté. Deux preuves différentes de ce résultat sont ici considérées, à savoir la preuve euclidienne classique et une preuve « topologique » plus récente proposée par Furstenberg. D’un point de vue (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  12. added 2016-11-15
    Finding Structure in a Meditative State.Bas Rasmussen - manuscript
    I have been experimenting with meditation for a long time, but just recently I seem to have come across another being in there. It may just be me looking at me, but whatever it is, it is showing me some really interesting arrangements of colored balls. At first, I thought it was just random colors and shapes, but it became very ordered. It was like this being (me?) was trying to talk to me but couldn’t, so was showing me some (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark  
  13. added 2014-03-10
    Hilbert's Objectivity.Lydia Patton - 2014 - Historia Mathematica 41 (2):188-203.
    Detlefsen (1986) reads Hilbert's program as a sophisticated defense of instrumentalism, but Feferman (1998) has it that Hilbert's program leaves significant ontological questions unanswered. One such question is of the reference of individual number terms. Hilbert's use of admittedly "meaningless" signs for numbers and formulae appears to impair his ability to establish the reference of mathematical terms and the content of mathematical propositions (Weyl (1949); Kitcher (1976)). The paper traces the history and context of Hilbert's reasoning about signs, which illuminates (...)
    Remove from this list   Download  
     
    Export citation  
     
    Bookmark   2 citations  
  14. added 2012-11-14
    What is The Reason to Use Clifford Algebra in Quantum Cognition? Part I: “It From Qubit” On The Possibility That the Amino Acids Can Discern Between Two Quantum Spin States.Elio Conte - 2012 - Neuroquantology 10 (3):561-565.
    Starting with 1985, we discovered the possible existence of electrons with net helicity in biomolecules as amino acids and their possibility to discern between the two quantum spin states. It is well known that the question of a possible fundamental role of quantum mechanics in biological matter constitutes still a long debate. In the last ten years we have given a rather complete quantum mechanical elaboration entirely based on Clifford algebra whose basic entities are isomorphic to the well known spin (...)
    Remove from this list   Download  
    Translate
     
     
    Export citation  
     
    Bookmark