Formalism in Mathematics

Can you find an xy-equation that, when graphed, writes itself on the plane? This idea became internet-famous when a Wikipedia article on Tupper’s self-referential formula went viral in 2012. Under scrutiny, the question has two flaws: it is meaningless (it depends on fonts) and it is trivial. We fix these flaws by formalizing the problem.

One shortcoming of the chain rule is that it does not iterate: it gives the derivative of f(g(x)), but not (directly) the second or higher-order derivatives. We present iterated differentials and a version of the multivariable chain rule which iterates to any desired level of derivative. We first present this material informally, and later discuss how to make it rigorous (a discussion which touches on formal foundations of calculus). We also suggest a finite calculus chain rule (contrary to Graham, Knuth (...) and Patashnik's claim that "there's no corresponding chain rule of finite calculus"). (shrink)

Brouwer’s intuitionism was a far-reaching attempt to reform the foundations of mathematics. While the mathematical community was reluctant to accept Brouwer’s work, its response to later-developed brands of intuitionism, such as those presented by Hermann Weyl and Arend Heyting, was different. The paper accounts for this difference by analyzing the intuitionistic versions of Brouwer, Weyl, and Heyting in light of a two-tiered model of the body and image of mathematical knowledge. Such a perspective provides a richer account of each story (...) and points to a possible connection between the community’s reaction and the changes each mathematician had proposed. (shrink)

Mathematical formalism is the the view that numbers are "signs" and that arithmetic is like a game played with such signs. Frege's colleague Thomae defended formalism using an analogy with chess, and Frege's critique of this analogy has had a major influence on discussions in analytic philosophy about signs, rules, meaning, and mathematics. Here I offer a new interpretation of formalism as defended by Thomae and his predecessors, paying close attention to the mathematical details and historical context. I argue that (...) for Thomae, the formal standpoint is an _algebraic perspective_ on a domain of objects, and a "sign" is not a linguistic expression or mark, but a representation of an object within that perspective. Thomae exploits a shift into this perspective to give a purely algebraic construction of the real numbers from the rational numbers. I suggest that Thomae's chess analogy is intended to provide a model for such shifts in perspective. (shrink)

Frege says, at the end of a discussion of formalism in the Foundations of Arithmetic, that his own foundational program “could be called formal” but is “completely different” from the view he has just criticized. This essay examines Frege’s relationship to Hermann Hankel, his main formalist interlocutor in the Foundations, in order to make sense of these claims. The investigation reveals a surprising result: Frege’s foundational program actually has quite a lot in common with Hankel’s. This undercuts Frege’s claim that (...) his own view is completely different from Hankel’s formalism, and motivates a closer examination of where the differences lie. On the interpretation offered here, Frege shares important parts of the formalist perspective, but differs in recognizing a kind of content for arithmetical terms which can only be made available via proof from prior postulates. (shrink)

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 (...) a metamathematical axiom about the relation of mathematics and reality. The main statement is formulated as follows: Any scientific theory admits isomorphism to some mathematical structure in a way constructive. Its investigation needs philosophical means. Husserl’s phenomenology is what is used, and then the conception of “bracketing reality” is modelled to generalize Peano arithmetic in its relation to set theory in the foundation of mathematics. The obtained model is equivalent to the generalization of Peano arithmetic by means of replacing the axiom of induction with that of transfinite induction. The sketch of the proof is organized in five steps: a generalization of epoché; involving transfinite induction in the transition between Peano arithmetic and set theory; discussing the finiteness of Peano arithmetic; applying transfinite induction to Peano arithmetic; discussing an arithmetical model of reality. Accepting or rejecting the principle, two kinds of mathematics appear differing from each other by its relation to reality. Accepting the principle, mathematics has to include reality within itself in a kind of Pythagoreanism. These two kinds are called in paper correspondingly Hilbert mathematics and Gödel mathematics. The sketch of the proof of the principle demonstrates that the generalization of Peano arithmetic as above can be interpreted as a model of Hilbert mathematics into Gödel mathematics therefore showing that the former is not less consistent than the latter, and the principle is an independent axiom. The present paper follows a pathway grounded on Husserl’s phenomenology and “bracketing reality” to achieve the generalized arithmetic necessary for the principle to be founded in alternative ontology, in which there is no reality external to mathematics: reality is included within mathematics. That latter mathematics is able to self-found itself and can be called Hilbert mathematics in honour of Hilbert’s program for self-founding mathematics on the base of arithmetic. The principle of universal mathematizability is consistent to Hilbert mathematics, but not to Gödel mathematics. Consequently, its validity or rejection would resolve the problem which mathematics refers to our being; and vice versa: the choice between them for different reasons would confirm or refuse the principle as to the being. An information interpretation of Hilbert mathematics is involved. It is a kind of ontology of information. The Schrödinger equation in quantum mechanics is involved to illustrate that ontology. Thus the problem which of the two mathematics is more relevant to our being is discussed again in a new way A few directions for future work can be: a rigorous formal proof of the principle as an independent axiom; the further development of information ontology consistent to both kinds of mathematics, but much more natural for Hilbert mathematics; the development of the information interpretation of quantum mechanics as a mathematical one for information ontology and thus Hilbert mathematics; the description of consciousness in terms of information ontology. (shrink)

The paper introduces and utilizes a few new concepts: “nonstandard Peano arithmetic”, “complementary Peano arithmetic”, “Hilbert arithmetic”. They identify the foundations of both mathematics and physics demonstrating the equivalence of the newly introduced Hilbert arithmetic and the separable complex Hilbert space of quantum mechanics in turn underlying physics and all the world. That new both mathematical and physical ground can be recognized as information complemented and generalized by quantum information. A few fundamental mathematical problems of the present such as Fermat’s (...) last theorem, four-color theorem as well as its new-formulated generalization as “four-letter theorem”, Poincaré’s conjecture, “P vs NP” are considered over again, from and within the new-founding conceptual reference frame of information, as illustrations. Simple or crucially simplifying solutions and proofs are demonstrated. The link between the consistent completeness of the system mathematics-physics on the ground of information and all the great mathematical problems of the present (rather than the enumerated ones) is suggested. (shrink)

Vann McGee has recently argued that Belnap’s criteria constrain the formal rules of classical natural deduction to uniquely determine the semantic values of the propositional logical connectives and quantifiers if the rules are taken to be open-ended, i.e., if they are truth-preserving within any mathematically possible extension of the original language. The main assumption of his argument is that for any class of models there is a mathematically possible language in which there is a sentence true in just those models. (...) I show that this assumption does not hold for the class of models of classical propositional logic. In particular, I show that the existence of non-normal models for negation undermines McGee’s argument. (shrink)

This study aims to find out how high the level and trends of student misconceptions experienced by high school students in Indonesia. The subject of research that is a class XI student of Natural Science (IPA) SMA Negeri 1 Anjatan with the subject matter limit function. Forms of research used in this study is a qualitative research, with a strategy that is descriptive qualitative research. The data analysis focused on the results of the students' answers on the test essay subject (...) matter limit function with the number of students by 16 (sixteen). Data collection techniques used are shaped test methods essay, interview method to students who have misconceptions, and methods of documentation of the test answers. Examination of the validity of the data using a triangulation technique that compares the data written test results with data from interviews. The results of this study can be described as follows; (1) The level of misconceptions experienced by students belonging to the category of low, amounting to 12.18%. However, students who do not understand the concept quite high at 40.38%, and the others are students who understand the concept that is equal to 47.44%. (2) The misconception most experienced students lie in subconcepts explain the meaning of limit function at one point through the calculation of values around that point, that is equal to 20.51%. The tendency misconceptions experienced by students is located on errors and operating concepts that misconceptions students that there should be no limit in the completion of the writing of the emblem and misconceptions about the limit students to conclude if the limit value of 0 is no limit to the value of the function. (shrink)

Filtration combustion is described by Laplacian growth without surface tension. These equations have elegant analytical solutions that replace the complex integro-differential motion equations by simple differential equations of pole motion in a complex plane. The main problem with such a solution is the existence of finite time singularities. To prevent such singularities, nonzero surface tension is usually used. However, nonzero surface tension does not exist in filtration combustion, and this destroys the analytical solutions. However, a more elegant approach exists for (...) solving the problem. First, we can introduce a small amount of pole noise to the system. Second, for regularisation of the problem, we throw out all new poles that can produce a finite time singularity. It can be strictly proved that the asymptotic solution for such a system is a single finger. Moreover, the qualitative consideration demonstrates that a finger with 1 2 of the channel width is statistically stable. Therefore, all properties of such a solution are exactly the same as those of the solution with nonzero surface tension under numerical noise. The solution of the ST problem without surface tension is similar to the solution for the equation of cellular flames in the case of the combustion of gas mixtures. (shrink)

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 infinity. The most (...) utilized example of those generalizations is the complex Hilbert space. Any generalization of Peano arithmetic consistent to infinity, e.g. the complex Hilbert space, can serve as a foundation for mathematics to found itself and by itself. (shrink)

The formalist philosophy of mathematics (in its purest, most extreme version) is widely regarded as a “discredited position”. This pure and extreme version of formalism is called by some authors “game formalism”, because it is alleged to represent mathematics as a meaningless game with strings of symbols. Nevertheless, I would like to draw attention to some arguments in favour of game formalism as an appropriate philosophy of real mathematics. For the most part, these arguments have not yet been used or (...) were neglected in past discussions. (shrink)

Detlefsen (1986) reads Hilbert's program as a sophisticated defense of instrumentalism, but Feferman (1998) has it that Hilbert's program leaves significant ontological questions unanswered. One such question is of the reference of individual number terms. Hilbert's use of admittedly "meaningless" signs for numbers and formulae appears to impair his ability to establish the reference of mathematical terms and the content of mathematical propositions (Weyl (1949); Kitcher (1976)). The paper traces the history and context of Hilbert's reasoning about signs, which illuminates (...) Hilbert's account of mathematical objectivity, axiomatics, idealization, and consistency. (shrink)

Can the so-ca\led first incompleteness theorem refer to itself? Many or maybe even all the paradoxes in mathematics are connected with some kind of self-reference. Gбdel built his proof on the ground of self-reference: а statement which claims its unprovabllity. So, he demonstrated that undecidaЬle propositions exist in any enough rich axiomatics (i.e. such one which contains Peano arithmetic in some sense). What about the decidabllity of the very first incompleteness theorem? We can display that it fulfills its conditions. That's (...) why it can Ье applied to itself, proving that it is an undecidaЬle statement. It seems to Ье а too strange kind of proposition: its validity implies its undecidabllity. If the validity of а statement implies its untruth, then it is either untruth (reductio ad absurdum) or an antinomy (if also its negation implies its validity). А theory that contains а contradiction implies any statement. Appearing of а proposition, whose validity implies its undecidabllity, is due to the statement that claims its unprovability. Obviously, it is а proposition of self-referential type. Ву Gбdel's words, it is correlative with Richard's or liar paradox, or even with any other semantic or mathematical one. What is the cost, if а proposition of that special kind is used in а proof? ln our opinion, the price is analogous to «applying» of а contradictory in а theory: any statement turns out to Ье undecidaЬ!e. Ifthe first incompleteness theorem is an undecidaЬ!e theorem, then it is impossiЬle to prove that the very completeness of Peano arithmetic is also an tmdecidaЬle statement (the second incompleteness theorem). Hilbert's program for ап arithmetical self-foundation of matheшatics is partly rehabllitated: only partly, because it is not decidaЬ!e and true, but undecidaЬle; that's wby both it and its negation шау Ье accepted as true, however not siшultaneously true. The first incompleteness theoreш gains the statute of axiom of а very special, semi-philosophical kind: it divides mathematics as whole into two parts: either Godel шathematics or Нilbert matheшatics. Нilbert's program of self-foundation ofmatheшatic is valid only as to the latter. (shrink)

Friedrich Waismann, a little-known mathematician and onetime student of Wittgenstein's, provides answers to problems that vexed Wittgenstein in his attempt to explicate the foundations of mathematics through an analysis of its practice. Waismann argues in favor of mathematical intuition and the reality of infinity with a Wittgensteinian twist. Waismann's arguments lead toward an approach to the foundation of mathematics that takes into consideration the language and practice of experts.

After sketching the main lines of Hilbert's program, certain well-known andinfluential interpretations of the program are critically evaluated, and analternative interpretation is presented. Finally, some recent developments inlogic related to Hilbert's program are reviewed.

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 have so far received (...) little attention, and on a number of philosophical reconstructions of the viewpoint (in particular, by Hand, Kitcher, and Tait). (shrink)

This paper explores the relationship between Hume's Prinicple and Basic Law V, investigating the question whether we really do need to suppose that, already in Die Grundlagen, Frege intended that HP should be justified by its derivation from Law V.

Abstract The Theory of Computation in its existed form is based on Church –Turing Thesis. Throughout this paper, we show that the Turing computation model of this theory leads us to a contradiction. In brief, by applying a well-known paradox (Unexpected hanging paradox) we show a contradiction in the Theory when we consider the Turing model as our Computation model.