Computer assisted theorem proving is an increasingly important part of mathematical methodology, as well as a long-standing topic in artificial intelligence (AI) research. However, the current generation of theorem proving software have limited functioning in terms of providing new proofs. Importantly, they are not able to discriminate interesting theorems and proofs from trivial ones. In order for computers to develop further in theorem proving, there would need to be a radical change in how the software functions. Recently, machine (...) learning results in solving mathematical tasks have shown early promise that deep artificial neural networks could learn symbolic mathematical processing. In this paper, I analyze the theoretical prospects of such neural networks in proving mathematical theorems. In particular, I focus on the question how such AI systems could be incorporated in practice to theorem proving and what consequences that could have. In the most optimistic scenario, this includes the possibility of autonomous automated theorem provers (AATP). Here I discuss whether such AI systems could, or should, become accepted as active agents in mathematical communities. (shrink)

Mathematical instrumentalism construes some parts of mathematics, typically the abstract ones, as an instrument for establishing statements in other parts of mathematics, typically the elementary ones. Gödel’s second incompleteness theorem seems to show that one cannot prove the consistency of all of mathematics from within elementary mathematics. It is therefore generally thought to defeat instrumentalisms that insist on a proof of the consistency of abstract mathematics from within the elementary portion. This article argues that though some versions of (...) class='Hi'>mathematical instrumentalism are defeated by Gödel’s theorem, not all are. By considering inductive reasons in mathematics, we show that some mathematical instrumentalisms survive the theorem. (shrink)

This paper initiates the reverse mathematics of social choice theory, studying Arrow's impossibility theorem and related results including Fishburn's possibility theorem and the Kirman–Sondermann theorem within the framework of reverse mathematics. We formalise fundamental notions of social choice theory in second-order arithmetic, yielding a definition of countable society which is tractable in RCA0. We then show that the Kirman–Sondermann analysis of social welfare functions can be carried out in RCA0. This approach yields a proof of Arrow's theorem in RCA0, and (...) thus in PRA, since Arrow's theorem can be formalised as a Π01 sentence. Finally we show that Fishburn's possibility theorem for countable societies is equivalent to ACA0 over RCA0. (shrink)

The present first part about the eventual completeness of mathematics (called “Hilbert mathematics”) is concentrated on the Gödel incompleteness (1931) statement: if it is an axiom rather than a theorem inferable from the axioms of (Peano) arithmetic, (ZFC) set theory, and propositional logic, this would pioneer the pathway to Hilbert mathematics. One of the main arguments that it is an axiom consists in the direct contradiction of the axiom of induction in arithmetic and the axiom of infinity in set theory. (...) Thus, the pair of arithmetic and set are to be similar to Euclidean and non-Euclidean geometries distinguishably only by the Fifth postulate now, i.e. after replacing it and its negation correspondingly by the axiom of finiteness (induction) versus that of finiteness being idempotent negations to each other. Indeed, the axiom of choice, as far as it is equivalent to the well-ordering “theorem”, transforms any set in a well-ordering either necessarily finite according to the axiom of induction or also optionally infinite according to the axiom of infinity. So, the Gödel incompleteness statement relies on the logical contradiction of the axiom of induction and the axiom of infinity in the final analysis. Nonetheless, both can be considered as two idempotent versions of the same axiom (analogically to the Fifth postulate) and then unified after logicism and its inherent intensionality since the opposition of finiteness and infinity can be only extensional (i.e., relevant to the elements of any set rather than to the set by itself or its characteristic property being a proposition). So, the pathway for interpreting the Gödel incompleteness statement as an axiom and the originating from that assumption for “Hilbert mathematics” accepting its negation is pioneered. A much wider context relevant to realizing the Gödel incompleteness statement as a metamathematical axiom is consistently built step by step. The horizon of Hilbert mathematics is the proper subject in the third part of the paper, and a reinterpretation of Gödel’s papers (1930; 1931) as an apology of logicism as the only consistent foundations of mathematics is the topic of the next second part. (shrink)

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.

The determinism-free will debate is perhaps as old as philosophy itself and has been engaged in from a great variety of points of view including those of scientific, theological, and logical character. This chapter focuses on two arguments from logic. First, there is an argument in support of determinism that dates back to Aristotle, if not farther. It rests on acceptance of the Law of Excluded Middle, according to which every proposition is either true or false, no matter whether the (...) proposition is about the past, present or future. In particular, the argument goes, whatever one does or does not do in the future is determined in the present by the truth or falsity of the corresponding proposition. The second argument coming from logic is much more modern and appeals to Gödel's incompleteness theorems to make the case against determinism and in favour of free will, insofar as that applies to the mathematical potentialities of human beings. The claim more precisely is that as a consequence of the incompleteness theorems, those potentialities cannot be exactly circumscribed by the output of any computing machine even allowing unlimited time and space for its work. The chapter concludes with some new considerations that may be in favour of a partial mechanist account of the mathematical mind. (shrink)

Pluralist mathematical realism, the view that there exists more than one mathematical universe, has become an influential position in the philosophy of mathematics. I argue that, if mathematical pluralism is true (and we have good reason to believe that it is), then mathematical realism cannot (easily) be justified by arguments from the indispensability of mathematics to science. This is because any justificatory chain of inferences from mathematical applications in science to the total body of (...) class='Hi'>mathematical theorems can cover at most one mathematical universe. Indispensability arguments may thus lose their central role in the debate about mathematical ontology. (shrink)

To counter a general belief that all the paradoxes stem from a kind of circularity (or involve some self--reference, or use a diagonal argument) Stephen Yablo designed a paradox in 1993 that seemingly avoided self--reference. We turn Yablo's paradox, the most challenging paradox in the recent years, into a genuine mathematical theorem in Linear Temporal Logic (LTL). Indeed, Yablo's paradox comes in several varieties; and he showed in 2004 that there are other versions that are equally paradoxical. Formalizing these (...) versions of Yablo's paradox, we prove some theorems in LTL. This is the first time that Yablo's paradox(es) become new(ly discovered) theorems in mathematics and logic. (shrink)

The paper discusses Hilbert mathematics, a kind of Pythagorean mathematics, to which the physical world is a particular case. The parameter of the “distance between finiteness and infinity” is crucial. Any nonzero finite value of it features the particular case in the frameworks of Hilbert mathematics where the physical world appears “ex nihilo” by virtue of an only mathematical necessity or quantum information conservation physically. One does not need the mythical Big Bang which serves to concentrate all the violations (...) of energy conservation in a “safe”, maximally remote point in the alleged “beginning of the universe”. On the contrary, an omnipresent and omnitemporal medium obeying quantum information conservation rather than energy conservation permanently generates action and thus the physical world. The utilization of that creation “ex nihilo” is accessible to humankind, at least theoretically, as long as one observes the physical laws, which admit it in their new and wider generalization. One can oppose Hilbert mathematics to Gödel mathematics, which can be identified as all the standard mathematics until now featureable by the Gödel dichotomy of arithmetic to set theory: and then, “dialectic”, “intuitionistic”, and “Gödelian” mathematics within the former, according to a negative, positive, or zero value of the distance between finiteness and infinity. A mapping of Hilbert mathematics into pseudo-Riemannian space corresponds, therefore allowing for gravitation to be interpreted purely mathematically and ontologically in a Pythagorean sense. Information and quantum information can be involved in the foundations of mathematics and linked to the axiom of choice or alternatively, to the field of all rational numbers, from which the pair of both dual and anti-isometric Peano arithmetics featuring Hilbert arithmetic are immediately inferable. Noether’s theorems (1918) imply quantum information conservation as the maximally possible generalization of the pair of the conservation of a physical quantity and the corresponding Lie group of its conjugate. Hilbert mathematics can be interpreted from their viewpoint also after an algebraic generalization of them. Following the ideas of Noether’s theorem (1918), locality and nonlocality can be realized both physically and mathematically. The “light phase of the universe” can be linked to the gap of mathematics and physics in the Cartesian organization of cognition in Modernity and then opposed to its “dark phase”, in which physics and mathematics are merged. All physical quantities can be deduced from only mathematical premises by the mediation of the most fundamental physical constants such as the speed of light in a vacuum, the Planck and gravitational constants once they have been interpreted by the relation of locality and nonlocality. (shrink)

In this paper I defend an intermediate position between the ‘bare mathematical results’ view and the ‘transmission’ view of mathematical explanations of physical phenomena (MEPPs). I argue that, in MEPPs, it is not enough to deduce the explanandum from the generalizations cited in the explanans. Rather, we must add information regarding why those generalizations obtain. However, I also argue that it is not necessary to provide explanatory proofs of the mathematical theorems that represent those generalizations. I (...) illustrate this with the bridges of Königsberg case. -/- . (shrink)

In this paper I argue for an association between impurity and explanatory power in contemporary mathematics. This proposal is defended against the ancient and influential idea that purity and explanation go hand-in-hand (Aristotle, Bolzano) and recent suggestions that purity/impurity ascriptions and explanatory power are more or less distinct (Section 1). This is done by analyzing a central and deep result of additive number theory, Szemerédi’s theorem, and various of its proofs (Section 2). In particular, I focus upon the radically impure (...) (ergodic) proof due to Furstenberg (Section 3). Furstenberg’s ergodic proof is striking because it utilizes intuitively foreign and infinitary resources to prove a finitary combinatorial result and does so in a perspicuous fashion. I claim that Furstenberg’s proof is explanatory in light of its clear expression of a crucial structural result, which provides the “reason why” Szemerédi’s theorem is true. This is, however, rather surprising: how can such intuitively different conceptual resources “get a grip on” the theorem to be proved? I account for this phenomenon by articulating a new construal of the content of a mathematical statement, which I call structural content (Section 4). I argue that the availability of structural content saves intuitive epistemic distinctions made in mathematical practice and simultaneously explicates the intervention of surprising and explanatorily rich conceptual resources. Structural content also disarms general arguments for thinking that impurity and explanatory power might come apart. Finally, I sketch a proposal that, once structural content is in hand, impure resources lead to explanatory proofs via suitably understood varieties of simplification and unification (Section 5). (shrink)

The paper continues the consideration of Hilbert mathematics to mathematics itself as an additional “dimension” allowing for the most difficult and fundamental problems to be attacked in a new general and universal way shareable between all of them. That dimension consists in the parameter of the “distance between finiteness and infinity”, particularly able to interpret standard mathematics as a particular case, the basis of which are arithmetic, set theory and propositional logic: that is as a special “flat” case of Hilbert (...) mathematics. The following four essential problems are considered for the idea to be elucidated: Fermat’s last theorem proved by Andrew Wiles; Poincaré’s conjecture proved by Grigori Perelman and the only resolved from the seven Millennium problems offered by the Clay Mathematics Institute (CMI); the four-color theorem proved “machine-likely” by enumerating all cases and the crucial software assistance; the Yang-Mills existence and mass gap problem also suggested by CMI and yet unresolved. They are intentionally chosen to belong to quite different mathematical areas (number theory, topology, mathematical physics) just to demonstrate the power of the approach able to unite and even unify them from the viewpoint of Hilbert mathematics. Also, specific ideas relevant to each of them are considered. Fermat’s last theorem is shown as a Gödel insoluble statement by means of Yablo’s paradox. Thus, Wiles’s proof as a corollary from the modularity theorem and thus needing both arithmetic and set theory involves necessarily an inverse Grothendieck universe. On the contrary, its proof in “Fermat arithmetic” introduced by “epoché to infinity” (following the pattern of Husserl’s original “epoché to reality”) can be suggested by Hilbert arithmetic relevant to Hilbert mathematics, the mediation of which can be removed in the final analysis as a “Wittgenstein ladder”. Poincaré’s conjecture can be reinterpreted physically by Minkowski space and thus reduced to the “nonstandard homeomorphism” of a bit of information mathematically. Perelman’s proof can be accordingly reinterpreted. However, it is valid in Gödel (or Gödelian) mathematics, but not in Hilbert mathematics in general, where the question of whether it holds remains open. The four-color theorem can be also deduced from the nonstandard homeomorphism at issue, but the available proof by enumerating a finite set of all possible cases is more general and relevant to Hilbert mathematics as well, therefore being an indirect argument in favor of the validity of Poincaré’s conjecture in Hilbert mathematics. The Yang-Mills existence and mass gap problem furthermore suggests the most general viewpoint to the relation of Hilbert and Gödel mathematics justifying the qubit Hilbert space as the dual counterpart of Hilbert arithmetic in a narrow sense, in turn being inferable from Hilbert arithmetic in a wide sense. The conjecture that many if not almost all great problems in contemporary mathematics rely on (or at least relate to) the Gödel incompleteness is suggested. It implies that Hilbert mathematics is the natural medium for their discussion or eventual solutions. (shrink)

Political theorists study the attributes of desirable social-moral states of affairs. Schaefer (forthcoming) aims to show that "static political theory" of this kind rests on shaky foundations. His argument revolves around an application of an abstruse mathematical theorem -- Kakutani's fixed point theorem -- to the social-moral domain. We show that Schaefer has misunderstood the implications of this theorem for political theory. Theorists who wish to study the attributes of social-moral states of affairs should carry on, safe in the (...) knowledge that Kakutani's theorem poses no threat to this enterprise. (shrink)

Let mathematical justification be the kind of justification obtained when a mathematician provides a proof of a theorem. Are Gettier cases possible for this kind of justification? At first sight we might think not: The standard for mathematical justification is proof and, since proof is bound at the hip with truth, there is no possibility of having an epistemically lucky justification of a true mathematical proposition. In this paper, I argue that Gettier cases are possible (and indeed (...) actual) in mathematical reasoning. By analysing these cases, I suggest that the Gettier phenomenon indicates some upshots for actual mathematical practice. (shrink)

Pettit (2012) presents a model of popular control over government, according to which it consists in the government being subject to those policy-making norms that everyone accepts. In this paper, I provide a formal statement of this interpretation of popular control, which illuminates its relationship to other interpretations of the idea with which it is easily conflated, and which gives rise to a theorem, similar to the famous Gibbard-Satterthwaite theorem. The theorem states that if government policy is subject to popular (...) control, as Pettit interprets it, and policy responds positively to changes in citizens' normative attitudes, then there is a single individual whose normative attitudes unilaterally determine policy. I use the model and theorem as an illustrative example to discuss the role of mathematics in normative political theory. (shrink)

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 (...) relevant mathematical structure is Hilbert arithmetic in a wide sense, in the framework of which Hilbert arithmetic in a narrow sense and the qubit Hilbert space are dual to each other. A few cases involving set theory are possible: (1) only within the case “n=3” and implicitly, within any next level of “n” in Fermat’s equation; (2) the identification of the case “n=3” and the general case utilizing the axiom of choice rather than the axiom of induction. If the former is the case, the application of set theory and arithmetic can remain disjunctively divided: set theory, “locally”, within any level; and arithmetic, “globally”, to all levels. If the latter is the case, the proof is thoroughly within set theory. Thus, the relevance of Yablo’s paradox to the statement of Fermat’s last theorem is avoided in both cases. The idea of “arithmetic mechanics” is sketched: it might deduce the basic physical dimensions of mechanics (mass, time, distance) from the axioms of arithmetic after a relevant generalization, Furthermore, a future Part III of the paper is suggested: FLT by mediation of Hilbert arithmetic in a wide sense can be considered as another expression of Gleason’s theorem in quantum mechanics: the exclusions about (n = 1, 2) in both theorems as well as the validity for all the rest values of “n” can be unified after the theory of quantum information. The availability (respectively, non-availability) of solutions of Fermat’s equation can be proved as equivalent to the non-availability (respectively, availability) of a single probabilistic measure as to Gleason’s theorem. (shrink)

We examine the influence of word choices on mathematical practice, i.e. in developing definitions, theorems, and proofs. As a case study, we consider Euclid’s and Euler’s word choices in their influential developments of geometry and, in particular, their use of the term ‘polyhedron’. Then, jumping to the twentieth century, we look at word choices surrounding the use of the term ‘polyhedron’ in the work of Coxeter and of Grünbaum. We also consider a recent and explicit conflict of approach (...) between Grünbaum and Shephard on the one hand and that of Hilton and Pedersen on the other, elucidating that the conflict was engendered by disagreement over the proper conceptualization, and so also the appropriate word choices, in the study of polyhedra. (shrink)

The text is a continuation of the article of the same name published in the previous issue of Philosophical Alternatives. The philosophical interpretations of the Kochen- Specker theorem (1967) are considered. Einstein's principle regarding the,consubstantiality of inertia and gravity" (1918) allows of a parallel between descriptions of a physical micro-entity in relation to the macro-apparatus on the one hand, and of physical macro-entities in relation to the astronomical mega-entities on the other. The Bohmian interpretation ( 1952) of quantum mechanics proposes (...) that all quantum systems be interpreted as dissipative ones and that the theorem be thus derstood. The conclusion is that the continual representation, by force or (gravitational) field between parts interacting by means of it, of a system is equivalent to their mutual entanglement if representation is discrete. Gravity (force field) and entanglement are two different, correspondingly continual and discrete, images of a single common essence. General relativity can be interpreted as a superluminal generalization of special relativity. The postulate exists of an alleged obligatory difference between a model and reality in science and philosophy. It can also be deduced by interpreting a corollary of the heorem. On the other hand, quantum mechanics, on the basis of this theorem and of V on Neumann's (1932), introduces the option that a model be entirely identified as the modeled reality and, therefore, that absolutely reality be recognized: this is a non-standard hypothesis in the epistemology of science. Thus, the true reality begins to be understood mathematically, i.e. in a Pythagorean manner, for its identification with its mathematical model. A few linked problems are highlighted: the role of the axiom of choice forcorrectly interpreting the theorem; whether the theorem can be considered an axiom; whether the theorem can be considered equivalent to the negation of the axiom. (shrink)

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 (...) – Is continuality universal? – Diffeomorphism and velocity – Einstein’s general principle of relativity – „Mach’s principle“ – The Skolemian relativity of the discrete and the continuous – The counterexample in § 6 of their paper – About the classical tautology which is untrue being replaced by the statements about commeasurable quantum-mechanical quantities – Logical hidden parameters – The undecidability of the hypothesis about hidden parameters – Wigner’s work and и Weyl’s previous one – Lie groups, representations, and psi-function – From a qualitative to a quantitative expression of relativity − psi-function, or the discrete by the random – Bartlett’s approach − psi-function as the characteristic function of random quantity – Discrete and/ or continual description – Quantity and its “digitalized projection“ – The idea of „velocity−probability“ – The notion of probability and the light speed postulate – Generalized probability and its physical interpretation – A quantum description of macro-world – The period of the as-sociated de Broglie wave and the length of now – Causality equivalently replaced by chance – The philosophy of quantum information and religion – Einstein’s thesis about “the consubstantiality of inertia ant weight“ – Again about the interpretation of complex velocity – The speed of time – Newton’s law of inertia and Lagrange’s formulation of mechanics – Force and effect – The theory of tachyons and general relativity – Riesz’s representation theorem – The notion of covariant world line – Encoding a world line by psi-function – Spacetime and qubit − psi-function by qubits – About the physical interpretation of both the complex axes of a qubit – The interpretation of the self-adjoint operators components – The world line of an arbitrary quantity – The invariance of the physical laws towards quantum object and apparatus – Hilbert space and that of Minkowski – The relationship between the coefficients of -function and the qubits – World line = psi-function + self-adjoint operator – Reality and description – Does a „curved“ Hilbert space exist? – The axiom of choice, or when is possible a flattening of Hilbert space? – But why not to flatten also pseudo-Riemannian space? – The commutator of conjugate quantities – Relative mass – The strokes of self-movement and its philosophical interpretation – The self-perfection of the universe – The generalization of quantity in quantum physics – An analogy of the Feynman formalism – Feynman and many-world interpretation – The psi-function of various objects – Countable and uncountable basis – Generalized continuum and arithmetization – Field and entanglement – Function as coding – The idea of „curved“ Descartes product – The environment of a function – Another view to the notion of velocity-probability – Reality and description – Hilbert space as a model both of object and description – The notion of holistic logic – Physical quantity as the information about it – Cross-temporal correlations – The forecasting of future – Description in separable and inseparable Hilbert space – „Forces“ or „miracles“ – Velocity or time – The notion of non-finite set – Dasein or Dazeit – The trajectory of the whole – Ontological and onto-theological difference – An analogy of the Feynman and many-world interpretation − psi-function as physical quantity – Things in the world and instances in time – The generation of the physi-cal by mathematical – The generalized notion of observer – Subjective or objective probability – Energy as the change of probability per the unite of time – The generalized principle of least action from a new view-point – The exception of two dimensions and Fermat’s last theorem. (shrink)

In this paper we apply social epistemology to mathematical proofs and their role in mathematical knowledge. The most famous modern collaborative mathematical proof effort is the Classification of Finite Simple Groups. The history and sociology of this proof have been well-documented by Alma Steingart (2012), who highlights a number of surprising and unusual features of this collaborative endeavour that set it apart from smaller-scale pieces of mathematics. These features raise a number of interesting philosophical issues, but have (...) received very little attention. In this paper, we will consider the philosophical tensions that Steingart uncovers, and use them to argue that the best account of the epistemic status of the Classification Theorem will be essentially and ineliminably social. This forms part of the broader argument that in order to understand mathematical proofs, we must appreciate their social aspects. (shrink)

There are different narratives on mathematics as part of our world, some of which are more appropriate than others. Such narratives might be of the form ‘Mathematics is useful’, ‘Mathematics is beautiful’, or ‘Mathematicians aim at theorem-credit’. These narratives play a crucial role in mathematics education and in society as they are influencing people’s willingness to engage with the subject or the way they interpret mathematical results in relation to real-world questions; the latter yielding important normative considerations. Our strategy (...) is to frame current narratives of mathematics from a virtue-theoretic perspective. We identify the practice of mathematizing, put forward by Freudenthal’s ‘Realistic mathematics education’, as virtuous and use it to evaluate different narratives. We show that this can help to render the narratives more adequately, and to provide implications for societal organization. (shrink)

This paper introduces several new classes of mathematical structures that have close connections with physics and with the theory of dynamical systems. The most general of these structures, called generalized stochastic systems, collectively encompass many important kinds of stochastic processes, including Markov chains and random dynamical systems. This paper then states and proves a new theorem that establishes a precise correspondence between any generalized stochastic system and a unitarily evolving quantum system. This theorem therefore leads to a new formulation (...) of quantum theory, alongside the Hilbert-space, path-integral, and quasiprobability formulations. The theorem also provides a first-principles explanation for why quantum systems are based on the complex numbers, Hilbert spaces, linear-unitary time evolution, and the Born rule. In addition, the theorem suggests that by selecting a suitable Hilbert space, together with an appropriate choice of unitary evolution, one can simulate any generalized stochastic system on a quantum computer, thereby potentially opening up an extensive set of novel applications for quantum computing. (shrink)

A fundamental problem in science is how to make logical inferences from scientific data. Mere data does not suffice since additional information is necessary to select a domain of models or hypotheses and thus determine the likelihood of each model or hypothesis. Thomas Bayes’ Theorem relates the data and prior information to posterior probabilities associated with differing models or hypotheses and thus is useful in identifying the roles played by the known data and the assumed prior information when making inferences. (...) Scientists, philosophers, and theologians accumulate knowledge when analyzing different aspects of reality and search for particular hypotheses or models to fit their respective subject matters. Of course, a main goal is then to integrate all kinds of knowledge into an all-encompassing worldview that would describe the whole of reality. A generous description of the whole of reality would span, in the order of complexity, from the purely physical to the supernatural. These two extreme aspects of reality are bridged by a nonphysical realm, which would include elements of life, man, consciousness, rationality, mental and mathematical abstractions, etc. An urgent problem in the theory of knowledge is what science is and what it is not. Albert Einstein’s notion of science in terms of sense perception is refined by defining operationally the data that makes up the subject matter of science. It is shown, for instance, that theological considerations included in the prior information assumed by Isaac Newton is irrelevant in relating the data logically to the model or hypothesis. In addition, the concepts of naturalism, intelligent design, and evolutionary theory are critically analyzed. Finally, Eugene P. Wigner’s suggestions concerning the nature of human consciousness, life, and the success of mathematics in the natural sciences is considered in the context of the creative power endowed in humans by God. (shrink)

The philosophy of mathematics has largely abandoned foundational studies, but is still fixated on theorem proving, logic and number theory, and on whether mathematical knowledge is certain. That is not what mathematics looks like to, say, a knot theorist or an industrial mathematical modeller. The "computer revolution" shows that mathematics is a much more direct study of the world, especially its structural aspects.

Scientists use models to know the world. It i susually assumed that mathematicians doing pure mathematics do not. Mathematicians doing pure mathematics prove theorems about mathematical entities like sets, numbers, geometric figures, spaces, etc., they compute various functions and solve equations. In this paper, I want to exhibit models build by mathematicians to study the fundamental components of spaces and, more generally, of mathematical forms. I focus on one area of mathematics where models occupy a central role, (...) namely homotopy theory. I argue that mathematicians introduce genuine models and I offer a rough classification of these models. (shrink)

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 (...) the evaluation of major foundational approaches by a careful examination of two case studies: a partial realization of Hilbert’s program due to Simpson [1988], and predicativism in the extended form due to Feferman and Schütte. -/- Shore [2010, 2013] proposes that equivalences in reverse mathematics be proved in the same way as inequivalences, namely by considering only omega-models of the systems in question. Shore refers to this approach as computational reverse mathematics. This paper shows that despite some attractive features, computational reverse mathematics is inappropriate for foundational analysis, for two major reasons. Firstly, the computable entailment relation employed in computational reverse mathematics does not preserve justification for the foundational programs above. Secondly, computable entailment is a Pi-1-1 complete relation, and hence employing it commits one to theoretical resources which outstrip those available within any foundational approach that is proof-theoretically weaker than Pi-1-1-CA0. (shrink)

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 (...) a properly mathematical proof of the statement. It would imply the “four colour theorem”, the proof of which many philosophers and mathematicians believe not to be entirely satisfactory for it is not a “human proof”, but intermediated by computers unavoidably since the necessary calculations exceed the human capabilities fundamentally. It is furthermore rather unsatisfactory because it consists in enumerating and proving all cases one by one. Sometimes, a more general theorem turns out to be much easier for proving including a general “human” method, and the particular and too difficult for proving theorem to be implied as a corollary in certain simple conditions. The same approach will be followed as to the four colour theorem, i.e. to be deduced more or less trivially from the “four-letter theorem” if the latter is proved. References are only classical and thus very well-known papers: their complete bibliographic description is omitted. (shrink)

Suppose that a majority of jurors decide that a defendant is guilty (or not), and we want to know the likelihood that they reached the correct verdict. The French philosopher Marquis de Condorcet (1743-1794) showed that we can get a mathematically precise answer, a result known as the “Condorcet Jury Theorem.” Condorcet’s theorem isn’t just about juries, though; it’s about collective decision-making in general. As a result, some philosophers have used his theorem to argue for democratic forms of government. This (...) essay explains Condorcet’s theorem and how philosophers have used it as an argument for democracy. (shrink)

REVIEW OF: Automated Development of Fundamental Mathematical Theories by Art Quaife. (1992: Kluwer Academic Publishers) 271pp. Using the theorem prover OTTER Art Quaife has proved four hundred theorems of von Neumann-Bernays-Gödel set theory; twelve hundred theorems and definitions of elementary number theory; dozens of Euclidean geometry theorems; and Gödel's incompleteness theorems. It is an impressive achievement. To gauge its significance and to see what prospects it offers this review looks closely at the book and the (...) proofs it presents. (shrink)

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 = 3” has been known for a long time. It needs “Hilbert mathematics”, which is inherently complete unlike the usual “Gödel mathematics”, and based on “Hilbert arithmetic” to generalize Peano arithmetic in a way to unify it with the qubit Hilbert space of quantum information. An “epoché to infinity” (similar to Husserl’s “epoché to reality”) is necessary to map Hilbert arithmetic into Peano arithmetic in order to be relevant to Fermat’s age. Furthermore, the two linked semigroups originating from addition and multiplication and from the Peano axioms in the final analysis can be postulated algebraically as independent of each other in a “Hamilton” modification of arithmetic supposedly equivalent to Peano arithmetic. The inductive proof of FLT can be deduced absolutely precisely in that Hamilton arithmetic and the pransfered as a corollary in the standard Peano arithmetic furthermore in a way accessible in Fermat’s epoch and thus, to himself in principle. A future, second part of the paper is outlined, getting directed to an eventual proof of the case “n=3” based on the qubit Hilbert space and the Kochen-Specker theorem inferable from it. (shrink)

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 subspace (...) of Hilbert space and especially its uniqueness can be unambiguously linked to that of partial algebra or incommensurability, or interpreted as a relation of the two dual branches of Hilbert arithmetic in a wide sense. The investigation of the last relation allows for FLT and Gleason’s theorem to be equated in a sense, as two dual counterparts, and the former to be inferred from the latter, as well as vice versa under an additional condition relevant to the Gödel incompleteness of arithmetic to set theory. The qubit Hilbert space itself in turn can be interpreted by the unity of FLT and Gleason’s theorem. The proof of such a fundamental result in number theory as FLT by means of Hilbert arithmetic in a wide sense can be generalized to an idea about “quantum number theory”. It is able to research mathematically the origin of Peano arithmetic from Hilbert arithmetic by mediation of the “nonstandard bijection” and its two dual branches inherently linking it to information theory. Then, infinitesimal analysis and its revolutionary application to physics can be also re-realized in that wider context, for example, as an exploration of the way for physical quantity of time (respectively, for time derivative in any temporal process considered in physics) to appear at all. Finally, the result admits a philosophical reflection of how any hierarchy arises or changes itself only thanks to its dual and idempotent counterpart. (shrink)

Our conscious minds exist in the Universe, therefore they should be identified with physical states that are subject to physical laws. In classical theories of mind, the mental states are identified with brain states that satisfy the deterministic laws of classical mechanics. This approach, however, leads to insurmountable paradoxes such as epiphenomenal minds and illusionary free will. Alternatively, one may identify mental states with quantum states realized within the brain and try to resolve the above paradoxes using the standard Hilbert (...) space formalism of quantum mechanics. In this essay, we first show that identification of mind states with quantum states within the brain is biologically feasible, and then elaborating on the mathematical proofs of two quantum mechanical no-go theorems, we explain why quantum theory might have profound implications for the scientific understanding of one's mental states, self identity, beliefs and free will. (shrink)

Mathematics is everywhere and yet its objects are nowhere. There may be five apples on the table but the number five itself is not to be found in, on, beside or anywhere near the apples. So if not in space and time, where are numbers and other mathematical objects such as perfect circles and functions? And how do we humans discover facts about them, be it Pythagoras’ Theorem or Fermat’s Last Theorem? The metaphysical question of what numbers are and (...) the epistemological question of how we know about them are central to the philosophy of mathematics. These and related philosophical questions are of particular interest because of mathematics’ unusual status. Mathematics is exceptional in that, on the one hand, it appears unhesitatingly true—no one doubts that 2 + 3 = 5—but on the other, as just noted, it is not about the physical world. This ambivalent status is what gives the philosophy of mathematics its special interest. The philosophy of mathematics is also one of the oldest academic fields, more or less coeval with philosophy itself. But contemporary philosophy of mathematics is rather different from its pre-twentieth-century antecedents, largely for three reasons. The first is that since the seventeenth century, mathematics has become integral to science. Science has over the past few centuries become increasingly mathematical, and indeed the fundamental science of nature, physics, is today recognised as a branch of applied mathematics. The second is that mathematics underwent a transformation in the course of nineteenth century: having started the century as a rather traditional-looking science of quantity it emerged a hundred years later a radically transformed abstract theory of structure. The final factor in the transformation of the philosophy of mathematics is the rise of modern logic. Developed by Frege, Cantor and others in the late nineteenth century, modern logic pervades contemporary mathematics, philosophy and computer science, and has had an immeasurable effect on the philosophy of mathematics. These volumes will collect the major works in this major field, with a focus on the last few decades. The anthology will include technical work, which interprets philosophically significant mathematical results or subfields of mathematics, as well as purely philosophical writing, aimed at those without advanced mathematics. The collection should be of interest to both philosophers and mathematicians, as well as to anyone who is susceptible to wondering what the main intellectual tool used in science, economics and finance, and indeed everyday life is ultimately about. (shrink)

Do multi-level selection explanations of the evolution of social traits deepen the understanding provided by single-level explanations? Central to the former is a mathematical theorem, the multi-level Price decomposition. I build a framework through which to understand the explanatory role of such non-empirical decompositions in scientific practice. Applying this general framework to the present case places two tasks on the agenda. The first task is to distinguish the various ways of suppressing within-collective variation in fitness, and moreover to evaluate (...) their biological interest. I distinguish four such ways: increasing retaliatory capacity, homogenising assortment, and collapsing either fitness structure or character distribution to a mean value. The second task is to discover whether the third term of the Price decomposition measures the effect of any of these hypothetical interventions. On this basis I argue that the multi-level Price decomposition has explanatory value primarily when the sharing-out of collective resources is `subtractable'. Thus its value is more circumscribed than its champions Sober and Wilson (1998) suppose. (shrink)

The previous Part I of the paper discusses the option of the Gödel incompleteness statement (1931: whether “Satz VI” or “Satz X”) to be an axiom due to the pair of the axiom of induction in arithmetic and the axiom of infinity in set theory after interpreting them as logical negations to each other. The present Part II considers the previous Gödel’s paper (1930) (and more precisely, the negation of “Satz VII”, or “the completeness theorem”) as a necessary condition for (...) granting the Gödel incompleteness statement to be a theorem just as the statement itself, to be an axiom. Then, the “completeness paper” can be interpreted as relevant to Hilbert mathematics, according to which mathematics and reality as well as arithmetic and set theory are rather entangled or complementary rather than mathematics to obey reality able only to create models of the latter. According to that, both papers (1930; 1931) can be seen as advocating Russell’s logicism or the intensional propositional logic versus both extensional arithmetic and set theory. Reconstructing history of philosophy, Aristotle’s logic and doctrine can be opposed to those of Plato or the pre-Socratic schools as establishing ontology or intensionality versus extensionality. Husserl’s phenomenology can be analogically realized including and particularly as philosophy of mathematics. One can identify propositional logic and set theory by virtue of Gödel’s completeness theorem (1930: “Satz VII”) and even both and arithmetic in the sense of the “compactness theorem” (1930: “Satz X”) therefore opposing the latter to the “incompleteness paper” (1931). An approach identifying homomorphically propositional logic and set theory as the same structure of Boolean algebra, and arithmetic as the “half” of it in a rigorous construction involving information and its unit of a bit. Propositional logic and set theory are correspondingly identified as the shared zero-order logic of the class of all first-order logics and the class at issue correspondingly. Then, quantum mechanics does not need any quantum logics, but only the relation of propositional logic, set theory, arithmetic, and information: rather a change of the attitude into more mathematical, philosophical, and speculative than physical, empirical and experimental. Hilbert’s epsilon calculus can be situated in the same framework of the relation of propositional logic and the class of all mathematical theories. The horizon of Part III investigating Hilbert mathematics (i.e. according to the Pythagorean viewpoint about the world as mathematical) versus Gödel mathematics (i.e. the usual understanding of mathematics as all mathematical models of the world external to it) is outlined. (shrink)

Textbook for students in mathematical logic. Part 1. Total formalization is possible! Formal theories. First order languages. Axioms of constructive and classical logic. Proving formulas in propositional and predicate logic. Glivenko's theorem and constructive embedding. Axiom independence. Interpretations, models and completeness theorems. Normal forms. Tableaux method. Resolution method. Herbrand's theorem.

This paper generalises the classical Condorcet jury theorem from majority voting over two options to plurality voting over multiple options. The paper further discusses the debate between epistemic and procedural democracy and situates its formal results in that debate. The paper finally compares a number of different social choice procedures for many-option choices in terms of their epistemic merits. An appendix explores the implications of some of the present mathematical results for the question of how probable majority cycles (as (...) in Condorcet's paradox) are in large electorates. (shrink)

In this work we consider the problem of the approximate hedging of a contingent claim in the minimum mean square deviation criterion. A theorem on martingale representation in case of discrete time and an application of the result for semi-continuous market model are also given.

The Four-Colour Theorem (4CT) proof, presented to the mathematical community in a pair of papers by Appel and Haken in the late 1970's, provoked a series of philosophical debates. Many conceptual points of these disputes still require some elucidation. After a brief presentation of the main ideas of Appel and Haken’s procedure for the proof and a reconstruction of Thomas Tymoczko’s argument for the novelty of 4CT’s proof, we shall formulate some questions regarding the connections between the points raised (...) by Tymoczko and some Wittgensteinian topics in the philosophy of mathematics such as the importance of the surveyability as a criterion for distinguishing mathematical proofs from empirical experiments. Our aim is to show that the “characteristic Wittgensteinian invention” (Mühlhölzer 2006) – the strong distinction between proofs and experiments – can shed some light in the conceptual confusions surrounding the Four-Colour Theorem. (shrink)

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 I. Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them. Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines. The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV. Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations. (shrink)

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 or theorem (...) and its proof. An attempt is made to meet directly some of Wittgenstein’s critical comments on the mathematical treatment of infinity and irrational numbers. (shrink)

This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on classes given by universal and universal-existential sentences. In particular, we prove two amalgamation results using the technique of diagrams in the setting of structures valued on a finite MTL-algebra, from which analogues of the Łoś–Tarski and the Chang–Łoś–Suszko preservation theorems follow.

In this contribution an attempt is made to analyze an important mathematical discovery, the theorem of Gödel, and to explore the possible impact on the consistency of metaphysical systems. It is shown that mathematics is a pointer to a reality that is not exclusively subjected to physical laws. As the Gödel theorem deals with pure mathematics, the philosopher as such can not decide on the rightness of this theorem. What he, instead can do, is evaluating the general acceptance of (...) this mathematical finding and reflect on the consistency between consequences of the mathematical theorem with consequences of his metaphysical view. The findings of three mathematicians are involved in the argumentation: first Gödel himself, then the further elaboration by Turing and finally the consequences for the human mind as worked out by Penrose. As a result one is encouraged to distinguish two different types of intellectual activity in mathematics, which both can be carried out by humans. The astonishing thing is not the distinction between a formalized, logic approach on the one side and intuition, mathematical insight and meaning on the other. Philosophically challenging, however, is the claim that principally only one of these intellectual activities can be carried out by objects exclusively bound to the laws of physical reality. (shrink)

In this article, a possible generalization of the Löb’s theorem is considered. Main result is: let κ be an inaccessible cardinal, then ¬Con( ZFC +∃κ) .

This paper sets mathematics among the sciences, despite not being empirical, because it studies relations of various sorts, like the sciences. Each empirical science studies the relations among objects, which relations determining which science. The mathematical science studies relations as such, regardless of what those relations may be or be among, how relations themselves are related. This places it at the extreme among the sciences with no objects of its own (A Subject with no Object, by J.P. Burgess and (...) G. Rosen). Examples are discussed. The historical development of written mathematics from algorithms on clay tablets to theorems with proofs is said to show that application of algorithms to specific problems and theorems to scientific objects is like allegorical interpretation. Mathematics fits into the modern scientific context because the sciences, beginning with Galileo, have been constructed in imitation of mathematics. Viewing mathematics this way does not solve any ontological problems, but it does show how mathematics avoids them. Epistemological problems, insuperable for object realism, are simplified. For example, we have access to relations among any objects that we can consider objectively, first physical objects and then mathematical objects of greater and greater abstraction. (shrink)

In this work, we consider the problem of the approximate hedging of a contingent claim in the minimum mean square deviation criterion. A theorem on martingaỉe representation in the case of discrete time and an application of obtained result for semi-continous market model are given.

Georg Cantor's absolute infinity, the paradoxical Burali-Forti class Ω of all ordinals, is a monstrous non-entity for which being called a "class" is an undeserved dignity. This must be the ultimate vexation for mathematical philosophers who hold on to some residual sense of realism in set theory. By careful use of Ω, we can rescue Georg Cantor's 1899 "proof" sketch of the Well-Ordering Theorem––being generous, considering his declining health. We take the contrapositive of Cantor's suggestion and add Zermelo's choice (...) function. This results in a concise and uncomplicated proof of the Well-Ordering Theorem. (shrink)

Philosophers of language have drawn on metamathematical results in varied ways. Extensionalist philosophers have been particularly impressed with two, not unrelated, facts: the existence, due to Frege/Tarski, of a certain sort of semantics, and the seeming absence of intensional contexts from mathematical discourse. The philosophical import of these facts is at best murky. Extensionalists will emphasize the success and clarity of the model theoretic semantics; others will emphasize the relative poverty of the mathematical idiom; still others will question (...) the aptness of the standard extensional semantics for mathematics. In this paper I investigate some implications of the Gödel Second Incompleteness Theorem for these positions. I argue that the realm of mathematics, proof theory in particular, has been a breeding ground for intensionality and that satisfactory intensional semantic theories are implicit in certain rigorous technical accounts. (shrink)

It is a striking fact from reverse mathematics that almost all theorems of countable and countably representable mathematics are equivalent to just five subsystems of second order arithmetic. The standard view is that the significance of these equivalences lies in the set existence principles that are necessary and sufficient to prove those theorems. In this article I analyse the role of set existence principles in reverse mathematics, and argue that they are best understood as closure conditions on the (...) powerset of the natural numbers. (shrink)

This chapter describes Kurt Gödel's paper on the incompleteness theorems. Gödel's incompleteness results are two of the most fundamental and important contributions to logic and the foundations of mathematics. It had been assumed that first-order number theory is complete in the sense that any sentence in the language of number theory would be either provable from the axioms or refutable. Gödel's first incompleteness theorem showed that this assumption was false: it states that there are sentences of number theory that (...) are neither provable nor refutable. The first theorem is general in the sense that it applies to any axiomatic theory, which is ω-consistent, has an effective proof procedure, and is strong enough to represent basic arithmetic. Their importance lies in their generality: although proved specifically for extensions of system, the method Gödel used is applicable in a wide variety of circumstances. Gödel's results had a profound influence on the further development of the foundations of mathematics. It pointed the way to a reconceptualization of the view of axiomatic foundations. (shrink)