Results for 'Peano arithmetic'

241 found
Order:
  1. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  2. Categoricity, Open-Ended Schemas and Peano Arithmetic.Adrian Ludușan - 2015 - Logos and Episteme 6 (3):313-332.
    One of the philosophical uses of Dedekind’s categoricity theorem for Peano Arithmetic is to provide support for semantic realism. To this end, the logical framework in which the proof of the theorem is conducted becomes highly significant. I examine different proposals regarding these logical frameworks and focus on the philosophical benefits of adopting open-ended schemas in contrast to second order logic as the logical medium of the proof. I investigate Pederson and Rossberg’s critique of the ontological advantages of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3.  63
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4. 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  
  5. Fermat’s Last Theorem Proved in Hilbert Arithmetic. III. The Quantum-Information Unification of Fermat’s Last Theorem and Gleason’s Theorem.Vasil Penchev - 2022 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 14 (12):1-30.
    The previous two parts of the paper demonstrate that the interpretation of Fermat’s last theorem (FLT) in Hilbert arithmetic meant both in a narrow sense and in a wide sense can suggest a proof by induction in Part I and by means of the Kochen - Specker theorem in Part II. The same interpretation can serve also for a proof FLT based on Gleason’s theorem and partly similar to that in Part II. The concept of (probabilistic) measure of a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6. A Mathematical Model of Quantum Computer by Both Arithmetic and Set Theory.Vasil Penchev - 2020 - Information Theory and Research eJournal 1 (15):1-13.
    A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section (...)
    Download  
     
    Export citation  
     
    Bookmark  
  7. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  8.  66
    Fermat’s Last Theorem Proved in Hilbert Arithmetic. I. From the Proof by Induction to the Viewpoint of Hilbert Arithmetic.Vasil Penchev - 2021 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 13 (7):1-57.
    In a previous paper, an elementary and thoroughly arithmetical proof of Fermat’s last theorem by induction has been demonstrated if the case for “n = 3” is granted as proved only arithmetically (which is a fact a long time ago), furthermore in a way accessible to Fermat himself though without being absolutely and precisely correct. The present paper elucidates the contemporary mathematical background, from which an inductive proof of FLT can be inferred since its proof for the case for “n (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9. Self-Reference and the Languages of Arithmetic.Richard Heck - 2007 - Philosophia Mathematica 15 (1):1-29.
    I here investigate the sense in which diagonalization allows one to construct sentences that are self-referential. Truly self-referential sentences cannot be constructed in the standard language of arithmetic: There is a simple theory of truth that is intuitively inconsistent but is consistent with Peano arithmetic, as standardly formulated. True self-reference is possible only if we expand the language to include function-symbols for all primitive recursive functions. This language is therefore the natural setting for investigations of self-reference.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  10.  38
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11.  53
    A New Reading and Comparative Interpretation of Gödel’s Completeness (1930) and Incompleteness (1931) Theorems.Vasil Penchev - 2016 - Логико-Философские Штудии 13 (2):187-188.
    Peano arithmetic cannot serve as the ground of mathematics for it is inconsistent to infinity, and infinity is necessary for its foundation. Though Peano arithmetic cannot be complemented by any axiom of infinity, there exists at least one (logical) axiomatics consistent to infinity. That is nothing else than a new reading at issue and comparative interpretation of Gödel’s papers (1930; 1931) meant here. Peano arithmetic admits anyway generalizations consistent to infinity and thus to some (...)
    Download  
     
    Export citation  
     
    Bookmark  
  12.  35
    God and the Numbers.Paul Studtmann - manuscript
    According to Augustine, abstract objects are ideas in the Mind of God. Because numbers are a type of abstract object, it would follow that numbers are ideas in the Mind of God. Let us call such a view the Augustinian View of Numbers (AVN). In this paper, I present a formal theory for AVN. The theory stems from the symmetry conception of God as it appears in Studtmann (2021). I show that Robinson’s Arithmetic, Q, can be interpreted by the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  13. 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  
  14. 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  
  15.  80
    Неразрешимост на първата теорема за непълнотата. Гьоделова и Хилбертова математика.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 (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  16. The Truth Assignments That Differentiate Human Reasoning From Mechanistic Reasoning: The Evidence-Based Argument for Lucas' Goedelian Thesis.Bhupinder Singh Anand - 2016 - Cognitive Systems Research 40:35-45.
    We consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary evidence-based definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways: (1) in terms of classical algorithmic verifiabilty; and (2) in terms of finitary algorithmic computability. We then show that the two definitions correspond to two distinctly different assignments of satisfaction (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  17. 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  
  18. Do Goedel's Incompleteness Theorems Set Absolute Limits on the Ability of the Brain to Express and Communicate Mental Concepts Verifiably?Bhupinder Singh Anand - 2004 - Neuroquantology 2:60-100.
    Classical interpretations of Goedels formal reasoning, and of his conclusions, implicitly imply that mathematical languages are essentially incomplete, in the sense that the truth of some arithmetical propositions of any formal mathematical language, under any interpretation, is, both, non-algorithmic, and essentially unverifiable. However, a language of general, scientific, discourse, which intends to mathematically express, and unambiguously communicate, intuitive concepts that correspond to scientific investigations, cannot allow its mathematical propositions to be interpreted ambiguously. Such a language must, therefore, define mathematical truth (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  19.  67
    Quantum Phenomenology as a “Rigorous Science”: The Triad of Epoché and the Symmetries of Information.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (48):1-18.
    Husserl (a mathematician by education) remained a few famous and notable philosophical “slogans” along with his innovative doctrine of phenomenology directed to transcend “reality” in a more general essence underlying both “body” and “mind” (after Descartes) and called sometimes “ontology” (terminologically following his notorious assistant Heidegger). Then, Husserl’s tradition can be tracked as an idea for philosophy to be reinterpreted in a way to be both generalized and mathenatizable in the final analysis. The paper offers a pattern borrowed from the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  20. The 'Noncausal Causality' of Quantum Information.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (45):1-7.
    The paper is concentrated on the special changes of the conception of causality from quantum mechanics to quantum information meaning as a background the revolution implemented by the former to classical physics and science after Max Born’s probabilistic reinterpretation of wave function. Those changes can be enumerated so: (1) quantum information describes the general case of the relation of two wave functions, and particularly, the causal amendment of a single one; (2) it keeps the physical description to be causal by (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  21. String Theory.John Corcoran, William Frank & Michael Maloney - 1974 - Journal of Symbolic Logic 39 (4):625-637.
    For each positive n , two alternative axiomatizations of the theory of strings over n alphabetic characters are presented. One class of axiomatizations derives from Tarski's system of the Wahrheitsbegriff and uses the n characters and concatenation as primitives. The other class involves using n character-prefixing operators as primitives and derives from Hermes' Semiotik. All underlying logics are second order. It is shown that, for each n, the two theories are definitionally equivalent [or synonymous in the sense of deBouvere]. It (...)
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  22. The Gödel Incompleteness Theorems (1931) by the Axiom of Choice.Vasil Penchev - 2020 - Econometrics: Mathematical Methods and Programming eJournal (Elsevier: SSRN) 13 (39):1-4.
    Those incompleteness theorems mean the relation of (Peano) arithmetic and (ZFC) set theory, or philosophically, the relation of arithmetical finiteness and actual infinity. The same is managed in the framework of set theory by the axiom of choice (respectively, by the equivalent well-ordering "theorem'). One may discuss that incompleteness form the viewpoint of set theory by the axiom of choice rather than the usual viewpoint meant in the proof of theorems. The logical corollaries from that "nonstandard" viewpoint the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  23. The Inexpressibility of Validity.Julien Murzi - 2014 - Analysis 74 (1):65-81.
    Tarski's Undefinability of Truth Theorem comes in two versions: that no consistent theory which interprets Robinson's Arithmetic (Q) can prove all instances of the T-Scheme and hence define truth; and that no such theory, if sound, can even express truth. In this note, I prove corresponding limitative results for validity. While Peano Arithmetic already has the resources to define a predicate expressing logical validity, as Jeff Ketland has recently pointed out (2012, Validity as a primitive. Analysis 72: (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  24. Trial and Error Mathematics: Dialectical Systems and Completions of Theories.Luca San Mauro, Jacopo Amidei, Uri Andrews, Duccio Pianigiani & Andrea Sorbi - 2019 - Journal of Logic and Computation 1 (29):157-184.
    This paper is part of a project that is based on the notion of a dialectical system, introduced by Magari as a way of capturing trial and error mathematics. In Amidei et al. (2016, Rev. Symb. Logic, 9, 1–26) and Amidei et al. (2016, Rev. Symb. Logic, 9, 299–324), we investigated the expressive and computational power of dialectical systems, and we compared them to a new class of systems, that of quasi-dialectical systems, that enrich Magari’s systems with a natural mechanism (...)
    Download  
     
    Export citation  
     
    Bookmark  
  25. Deflationary Truth and Pathologies.Cezary Cieśliński - 2010 - Journal of Philosophical Logic 39 (3):325-337.
    By a classical result of Kotlarski, Krajewski and Lachlan, pathological satisfaction classes can be constructed for countable, recursively saturated models of Peano arithmetic. In this paper we consider the question of whether the pathology can be eliminated; we ask in effect what generalities involving the notion of truth can be obtained in a deflationary truth theory (a theory of truth which is conservative over its base). It is shown that the answer depends on the notion of pathology we (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  26.  78
    God and the Numbers.Paul Studtmann - manuscript
    According to Augustine, abstract objects are ideas in the Mind of God. Because numbers are a type of abstract object, it would follow that numbers are ideas in the Mind of God. Let us call such a view the Augustinian View of Numbers (AVN). In this paper, I present a formal theory for AVN. The theory stems from the symmetry conception of God as it appears in Studtmann (2021). I show that Robinson’s Arithmetic is a conservative extension of the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  27. Typed and Untyped Disquotational Truth.Cezary Cieśliński - 2015 - In Kentaro Fujimoto, José Martínez Fernández, Henri Galinon & Theodora Achourioti (eds.), Unifying the Philosophy of Truth. Springer Verlag.
    We present an overview of typed and untyped disquotational truth theories with the emphasis on their (non)conservativity over the base theory of syntax. Two types of conservativity are discussed: syntactic and semantic. We observe in particular that TB—one of the most basic disquotational theories—is not semantically conservative over its base; we show also that an untyped disquotational theory PTB is a syntactically conservative extension of Peano Arithmetic.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  28.  36
    From the Four-Color Theorem to a Generalizing “Four-Letter Theorem”: A Sketch for “Human Proof” and the Philosophical Interpretation.Vasil Penchev - 2020 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 12 (21):1-10.
    The “four-color” theorem seems to be generalizable as follows. The four-letter alphabet is sufficient to encode unambiguously any set of well-orderings including a geographical map or the “map” of any logic and thus that of all logics or the DNA plan of any alive being. Then the corresponding maximally generalizing conjecture would state: anything in the universe or mind can be encoded unambiguously by four letters. That admits to be formulated as a “four-letter theorem”, and thus one can search for (...)
    Download  
     
    Export citation  
     
    Bookmark  
  29.  92
    The Potential in Frege’s Theorem.Will Stafford - forthcoming - Review of Symbolic Logic:1-25.
    Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. We re-explore this idea and discover that in the setting of the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  30. “Truth-Preserving and Consequence-Preserving Deduction Rules”,.John Corcoran - 2014 - Bulletin of Symbolic Logic 20 (1):130-1.
    A truth-preservation fallacy is using the concept of truth-preservation where some other concept is needed. For example, in certain contexts saying that consequences can be deduced from premises using truth-preserving deduction rules is a fallacy if it suggests that all truth-preserving rules are consequence-preserving. The arithmetic additive-associativity rule that yields 6 = (3 + (2 + 1)) from 6 = ((3 + 2) + 1) is truth-preserving but not consequence-preserving. As noted in James Gasser’s dissertation, Leibniz has been criticized (...)
    Download  
     
    Export citation  
     
    Bookmark  
  31.  54
    “Two Bits Less” After Quantum-Information Conservation and Their Interpretation as “Distinguishability / Indistinguishability” and “Classical / Quantum”.Vasil Penchev - 2021 - Philosophy of Science eJournal (Elsevier: SSRN) 14 (46):1-7.
    The paper investigates the understanding of quantum indistinguishability after quantum information in comparison with the “classical” quantum mechanics based on the separable complex Hilbert space. The two oppositions, correspondingly “distinguishability / indistinguishability” and “classical / quantum”, available implicitly in the concept of quantum indistinguishability can be interpreted as two “missing” bits of classical information, which are to be added after teleportation of quantum information to be restored the initial state unambiguously. That new understanding of quantum indistinguishability is linked to the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  32. The Significance of Evidence-Based Reasoning in Mathematics, Mathematics Education, Philosophy, and the Natural Sciences.Bhupinder Singh Anand - 2020 - Mumbai: DBA Publishing (First Edition).
    In this multi-disciplinary investigation we show how an evidence-based perspective of quantification---in terms of algorithmic verifiability and algorithmic computability---admits evidence-based definitions of well-definedness and effective computability, which yield two unarguably constructive interpretations of the first-order Peano Arithmetic PA---over the structure N of the natural numbers---that are complementary, not contradictory. The first yields the weak, standard, interpretation of PA over N, which is well-defined with respect to assignments of algorithmically verifiable Tarskian truth values to the formulas of PA under (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  33. The Frontier of Time: The Concept of Quantum Information.Vasil Penchev - 2020 - Cosmology and Large-Scale Structure eJournal (Elsevier: SSRN) 2 (17):1-5.
    The concept of formal transcendentalism is utilized. The fundamental and definitive property of the totality suggests for “the totality to be all”, thus, its externality (unlike any other entity) is contained within it. This generates a fundamental (or philosophical) “doubling” of anything being referred to the totality, i.e. considered philosophically. Thus, that doubling as well as transcendentalism underlying it can be interpreted formally as an elementary choice such as a bit of information and a quantity corresponding to the number of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34. Representation and Reality by Language: How to Make a Home Quantum Computer?Vasil Penchev - 2020 - Philosophy of Science eJournal (Elsevier: SSRN) 13 (34):1-14.
    A set theory model of reality, representation and language based on the relation of completeness and incompleteness is explored. The problem of completeness of mathematics is linked to its counterpart in quantum mechanics. That model includes two Peano arithmetics or Turing machines independent of each other. The complex Hilbert space underlying quantum mechanics as the base of its mathematical formalism is interpreted as a generalization of Peano arithmetic: It is a doubled infinite set of doubled Peano (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. Choice, Infinity, and Negation: Both Set-Theory and Quantum-Information Viewpoints to Negation.Vasil Penchev - 2020 - Logic and Philosophy of Mathematics eJournal 12 (14):1-3.
    The concepts of choice, negation, and infinity are considered jointly. The link is the quantity of information interpreted as the quantity of choices measured in units of elementary choice: a bit is an elementary choice between two equally probable alternatives. “Negation” supposes a choice between it and confirmation. Thus quantity of information can be also interpreted as quantity of negations. The disjunctive choice between confirmation and negation as to infinity can be chosen or not in turn: This corresponds to set-theory (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36.  58
    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  
  37.  46
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  38.  42
    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  
  39.  53
    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  
  40. Remarks on Wittgenstein, Gödel, Chaitin, Incompleteness, Impossiblity and the Psychological Basis of Science and Mathematics.Michael Richard Starks - 2019 - In Remarks on Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason in Chaitin, Wittgenstein, Hofstadter, Wolpert, Doria, da Costa, Godel, Searle, Rodych, Berto, Floyd, Moyal. Las Vegas, NV USA: Reality Press. pp. 24-38.
    It is commonly thought that such topics as Impossibility, Incompleteness, Paraconsistency, Undecidability, Randomness, Computability, Paradox, Uncertainty and the Limits of Reason are disparate scientific physical or mathematical issues having little or nothing in common. I suggest that they are largely standard philosophical problems (i.e., language games) which were resolved by Wittgenstein over 80 years ago. -/- Wittgenstein also demonstrated the fatal error in regarding mathematics or language or our behavior in general as a unitary coherent logical ‘system,’ rather than as (...)
    Download  
     
    Export citation  
     
    Bookmark  
  41.  63
    An Elementary, Pre-Formal, Proof of FLT: Why is X^N+y^N=Z^N Solvable Only for N≪3?Bhupinder Singh Anand - manuscript
    Andrew Wiles' analytic proof of Fermat's Last Theorem FLT, which appeals to geometrical properties of real and complex numbers, leaves two questions unanswered: (i) What technique might Fermat have used that led him to, even if only briefly, believe he had `a truly marvellous demonstration' of FLT? (ii) Why is x^n+y^n=z^n solvable only for n<3? In this inter-disciplinary perspective, we offer insight into, and answers to, both queries; yielding a pre-formal proof of why FLT can be treated as a true (...)
    Download  
     
    Export citation  
     
    Bookmark  
  42. The Epistemic Significance of Numerals.Jan8 Heylen - forthcoming - Synthese 198 (Suppl 5):1019-1045.
    The central topic of this article is de re knowledge about natural numbers and its relation with names for numbers. It is held by several prominent philosophers that numerals are eligible for existential quantification in epistemic contexts, whereas other names for natural numbers are not. In other words, numerals are intimately linked with de re knowledge about natural numbers, whereas the other names for natural numbers are not. In this article I am looking for an explanation of this phenomenon. It (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  43. 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   8 citations  
  44.  83
    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   4 citations  
  45. 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   153 citations  
  46. Arithmetic is Determinate.Zachary Goodsell - 2022 - 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  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  47. An Arithmetization of Logical Oppositions.Fabien Schang - 2016 - In Jean-Yves Beziau & Gianfranco Basti (eds.), The Square of Opposition: A Cornerstone of Thought. Bâle, Suisse: 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  
  48. Peano e la filosofia della matematica.Enrico Pasini - 2004 - In Elisa Gallo - Livia Giacardi - Clara Silvia Roero (ed.), Conferenze E Seminari 2003-2004. Associazione Subalpina Mathesis. pp. 203-220.
    It is well known that Peano had a reluctant attitude towards philosophy, including philosophy of mathematics. Some scholars have suggested the existence of an 'implicit' philosophy, without being able to describe it. In this paper a first attempt is done to reconstruct, if not a general philosophy of mathematics, at least Peano' epistemology of mathematics and its relation to contemporary positions.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  49. Frege and Peano on Definitions.Edoardo Rivello - forthcoming - In Proceedings of the "Frege: Freunde und Feinde" conference, held in Wismar, May 12-15, 2013.
    Frege and Peano started in 1896 a debate where they contrasted the respective conceptions on the theory and practice of mathematical definitions. Which was (if any) the influence of the Frege-Peano debate on the conceptions by the two authors on the theme of defining in mathematics and which was the role played by this debate in the broader context of their scientific interaction?
    Download  
     
    Export citation  
     
    Bookmark  
  50. Two-Sorted Frege Arithmetic is Not Conservative.Stephen Mackereth & Jeremy Avigad - 2022 - Review of Symbolic Logic:1-34.
    Neo-Fregean logicists claim that Hume's Principle (HP) may be taken as an implicit definition of cardinal number, true simply by fiat. A longstanding 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 — 50 / 241