Results for 'Hilbert arithmetic'

354 found
Order:
  1.  61
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  2.  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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  4.  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  
  5. What the Tortoise Said to Achilles: Lewis Carroll’s Paradox in Terms of Hilbert Arithmetic.Vasil Penchev - 2021 - Logic and Philosophy of Mathematics eJournal (Elsevier: SSRN) 13 (22):1-32.
    Lewis Carroll, both logician and writer, suggested a logical paradox containing furthermore two connotations (connotations or metaphors are inherent in literature rather than in mathematics or logics). The paradox itself refers to implication demonstrating that an intermediate implication can be always inserted in an implication therefore postponing its ultimate conclusion for the next step and those insertions can be iteratively and indefinitely added ad lib, as if ad infinitum. Both connotations clear up links due to the shared formal structure with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  6.  54
    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  
  7. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  8. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  9.  87
    Hilbert's Metamathematical Problems and Their Solutions.Besim Karakadilar - 2008 - Dissertation, Boston University
    This dissertation examines several of the problems that Hilbert discovered in the foundations of mathematics, from a metalogical perspective. The problems manifest themselves in four different aspects of Hilbert’s views: (i) Hilbert’s axiomatic approach to the foundations of mathematics; (ii) His response to criticisms of set theory; (iii) His response to intuitionist criticisms of classical mathematics; (iv) Hilbert’s contribution to the specification of the role of logical inference in mathematical reasoning. This dissertation argues that Hilbert’s (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. Reid, Constance. Hilbert (a Biography). Reviewed by Corcoran in Philosophy of Science 39 (1972), 106–08.John Corcoran - 1972 - Philosophy of Science 39 (1):106-108.
    Reid, Constance. Hilbert (a Biography). Reviewed by Corcoran in Philosophy of Science 39 (1972), 106–08. -/- Constance Reid was an insider of the Berkeley-Stanford logic circle. Her San Francisco home was in Ashbury Heights near the homes of logicians such as Dana Scott and John Corcoran. Her sister Julia Robinson was one of the top mathematical logicians of her generation, as was Julia’s husband Raphael Robinson for whom Robinson Arithmetic was named. Julia was a Tarski PhD and, in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11.  70
    How to Prove the Consistency of Arithmetic.Jaakko Hintikka & Besim Karakadilar - 2006 - Acta Philosophica Fennica 78:1.
    It is argued that the goal of Hilbert's program was to prove the model-theoretical consistency of different axiom systems. This Hilbert proposed to do by proving the deductive consistency of the relevant systems. In the extended independence-friendly logic there is a complete proof method for the contradictory negations of independence-friendly sentences, so the existence of a single proposition that is not disprovable from arithmetic axioms can be shown formally in the extended independence-friendly logic. It can also be (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  12.  66
    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  
  13. 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  
    Translate
     
     
    Export citation  
     
    Bookmark  
  14. 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  
  15.  44
    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   8 citations  
  16.  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 addable axiom(s) of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  17.  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 conditions. (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  18.  53
    “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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  19.  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  
  20. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  21. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  22. What is Mathematics: Gödel's Theorem and Around (Edition 2015).Karlis Podnieks - manuscript
    Introduction to mathematical logic, part 2.Textbook for students in mathematical logic and foundations of mathematics. Platonism, Intuition, Formalism. Axiomatic set theory. Around the Continuum Problem. Axiom of Determinacy. Large Cardinal Axioms. Ackermann's Set Theory. First order arithmetic. Hilbert's 10th problem. Incompleteness theorems. Consequences. Connected results: double incompleteness theorem, unsolvability of reasoning, theorem on the size of proofs, diophantine incompleteness, Loeb's theorem, consistent universal statements are provable, Berry's paradox, incompleteness and Chaitin's theorem. Around Ramsey's theorem.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  23. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24. 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 and (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  25. Universal Logic in Terms of Quantum Information.Vasil Penchev - 2020 - Metaphilosophy eJournal (Elsevier: SSRN) 12 (9):1-5.
    Any logic is represented as a certain collection of well-orderings admitting or not some algebraic structure such as a generalized lattice. Then universal logic should refer to the class of all subclasses of all well-orderings. One can construct a mapping between Hilbert space and the class of all logics. Thus there exists a correspondence between universal logic and the world if the latter is considered a collection of wave functions, as which the points in Hilbert space can be (...)
    Download  
     
    Export citation  
     
    Bookmark  
  26.  88
    The Kochen - Specker Theorem in Quantum Mechanics: A Philosophical Comment (Part 1).Vasil Penchev - 2013 - Philosophical Alternatives 22 (1):67-77.
    Non-commuting quantities and hidden parameters – Wave-corpuscular dualism and hidden parameters – Local or nonlocal hidden parameters – Phase space in quantum mechanics – Weyl, Wigner, and Moyal – Von Neumann’s theorem about the absence of hidden parameters in quantum mechanics and Hermann – Bell’s objection – Quantum-mechanical and mathematical incommeasurability – Kochen – Specker’s idea about their equivalence – The notion of partial algebra – Embeddability of a qubit into a bit – Quantum computer is not Turing machine – (...)
    Download  
     
    Export citation  
     
    Bookmark  
  27.  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  
  28. Epsilon Theorems in Intermediate Logics.Matthias Baaz & Richard Zach - 2022 - Journal of Symbolic Logic 87 (2):682-720.
    Any intermediate propositional logic can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus. The first and second $\varepsilon $ -theorems for classical logic establish conservativity of the $\varepsilon $ -calculus over its classical base logic. It is well known that the second $\varepsilon $ -theorem fails for the intuitionistic $\varepsilon $ -calculus, as prenexation is impossible. The paper investigates the effect of adding critical $\varepsilon $ (...)
    Download  
     
    Export citation  
     
    Bookmark  
  29. Computational Reverse Mathematics and Foundational Analysis.Benedict Eastaugh - manuscript
    Reverse mathematics studies which subsystems of second order arithmetic are equivalent to key theorems of ordinary, non-set-theoretic mathematics. The main philosophical application of reverse mathematics proposed thus far is foundational analysis, which explores the limits of different foundations for mathematics in a formally precise manner. This paper gives a detailed account of the motivations and methodology of foundational analysis, which have heretofore been largely left implicit in the practice. It then shows how this account can be fruitfully applied in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  30. The Case of Quantum Mechanics Mathematizing Reality: The “Superposition” of Mathematically Modelled and Mathematical Reality: Is There Any Room for Gravity?Vasil Penchev - 2020 - Cosmology and Large-Scale Structure eJournal (Elsevier: SSRN) 2 (24):1-15.
    A case study of quantum mechanics is investigated in the framework of the philosophical opposition “mathematical model – reality”. All classical science obeys the postulate about the fundamental difference of model and reality, and thus distinguishing epistemology from ontology fundamentally. The theorems about the absence of hidden variables in quantum mechanics imply for it to be “complete” (versus Einstein’s opinion). That consistent completeness (unlike arithmetic to set theory in the foundations of mathematics in Gödel’s opinion) can be interpreted furthermore (...)
    Download  
     
    Export citation  
     
    Bookmark  
  31. 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 arithmetics having (...)
    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 the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  33. 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  
  34.  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  
  35. Философия на квантовата информация.Vasil Penchev - 2009 - Sofia: BAS: IPhR.
    The book is devoted to the contemporary stage of quantum mechanics – quantum information, and especially to its philosophical interpretation and comprehension: the first one of a series monographs about the philosophy of quantum information. The second will consider Be l l ’ s inequalities, their modified variants and similar to them relations. The beginning of quantum information was in the thirties of the last century. Its speed development has started over the last two decades. The main phenomenon is entanglement. (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  36. 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 of (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  37. Hilbert's Program Then and Now.Richard Zach - 2007 - In Dale Jacquette (ed.), Philosophy of Logic. Amsterdam: North Holland. pp. 411–447.
    Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the consistency of these axiomatic systems. Although Gödel’s incompleteness theorems show that the program as originally conceived cannot be carried out, it had (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  38. From Hilbert Proofs to Consecutions and Back.Tore Fjetland Øgaard - 2021 - Australasian Journal of Logic 18 (2):51-72.
    Restall set forth a "consecution" calculus in his "An Introduction to Substructural Logics." This is a natural deduction type sequent calculus where the structural rules play an important role. This paper looks at different ways of extending Restall's calculus. It is shown that Restall's weak soundness and completeness result with regards to a Hilbert calculus can be extended to a strong one so as to encompass what Restall calls proofs from assumptions. It is also shown how to extend the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  39. 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  
  40.  3
    Hilbert Space Dimensions 3, 4, 5.Paul Merriam, Daniel Huber & Bob Hanlon - forthcoming - Foundations of Physics:6.
    This is a pdf of a Mathematica calculation that supplements the paper "Presentist Fragmentalism and Quantum Mechanics" forthcoming in Foundations of Physics. In that paper the Born rule (or at least a progenitor) is derived from experimental conditions on the mutual observations of two fragments. In this pdf the experimental conditions are applied to Hilbert space dimensions 3, 4, and 5. It turns out each of these have a 1-dimensional solution space which, it is hoped, can be interpretated as (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  41.  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  
  42. 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  
  43. 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  
  44. Completeness Before Post: Bernays, Hilbert, and the Development of Propositional Logic.Richard Zach - 1999 - Bulletin of Symbolic Logic 5 (3):331-366.
    Some of the most important developments of symbolic logic took place in the 1920s. Foremost among them are the distinction between syntax and semantics and the formulation of questions of completeness and decidability of logical systems. David Hilbert and his students played a very important part in these developments. Their contributions can be traced to unpublished lecture notes and other manuscripts by Hilbert and Bernays dating to the period 1917-1923. The aim of this paper is to describe these (...)
    Download  
     
    Export citation  
     
    Bookmark   32 citations  
  45. 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 (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  46. 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  
  47. Hilbert on Consistency as a Guide to Mathematical Reality.Fiona T. Doherty - 2017 - Logique Et Analyse 237:107-128.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  48. Hilbert's Program Revisited.Panu Raatikainen - 2003 - Synthese 137 (1):157-177.
    After sketching the main lines of Hilbert's program, certain well-known and influential interpretations of the program are critically evaluated, and an alternative interpretation is presented. Finally, some recent developments in logic related to Hilbert's program are reviewed.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  49. Numbers and Functions in Hilbert's Finitism.Richard Zach - 1998 - Taiwanese Journal for History and Philosophy of Science 10:33-60.
    David Hilbert's finitistic standpoint is a conception of elementary number theory designed to answer the intuitionist doubts regarding the security and certainty of mathematics. Hilbert was unfortunately not exact in delineating what that viewpoint was, and Hilbert himself changed his usage of the term through the 1920s and 30s. The purpose of this paper is to outline what the main problems are in understanding Hilbert and Bernays on this issue, based on some publications by them which (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  50.  99
    Hilbert izlencesinin izinde adcılık adına yeni bulgular.Besim Karakadılar - manuscript
    Hilbert izlencesinin kanıt kuramsal amacı tarihsel gelişimi içinde özetlendikten sonra arka plandaki model-kuramsal motivasyonu belirtilmektedir. Hilbert'in nihai hedefinin matematiğin temellerine ilişkin tüm epistemolojik ve ontolojik varsayımlardan arındırılmış bir matematik kuramı geliştirmek olduğu savunulmaktadır. Yakın geçmişte mantıktaki bazı gelişmelerin Hilbert izlencesinin yalnızca adcı varsayımlar temelinde sürdürülebileceğine ilişkin yeni bir bakış açısı sağladığı öne sürülmektedir.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
1 — 50 / 354