The present paper argues that ‘mature mathematical formalisms’ play a central role in achieving representation via scientific models. A close discussion of two contemporary accounts of how mathematical models apply—the DDI account (according to which representation depends on the successful interplay of denotation, demonstration and interpretation) and the ‘matching model’ account—reveals shortcomings of each, which, it is argued, suggests that scientific representation may be ineliminably heterogeneous in character. In order to achieve a degree of unification that is compatible (...) with successful representation, scientists often rely on the existence of a ‘mature mathematical formalism’, where the latter refers to a—mathematically formulated and physically interpreted—notational system of locally applicable rules that derive from (but need not be reducible to) fundamental theory. As mathematical formalisms undergo a process of elaboration, enrichment, and entrenchment, they come to embody theoretical, ontological, and methodological commitments and assumptions. Since these are enshrined in the formalism itself, they are no longer readily obvious to either the novice or the proficient user. At the same time as formalisms constrain what may be represented, they also function as inferential and interpretative resources. (shrink)

The Narrative Gravity operator (Ng) has been criticized as lacking operational definition — as a conceptual label rather than a calculable variable. This paper provides the complete mathematical formalization of Ng = Ma / Sn squared, operationalizes its input variables, and demonstrates calculability through three benchmark cases. -/- Narrative Mass (Ma) is operationalized through four sub-variables scored 0.0-2.5: Causal Density (Cd), Informational Opacity (Io), Temporal Persistence (Tp), and Structural Centrality (Sc). Ma = Cd + Io + Tp + Sc, (...) range 0.0-10.0. -/- Narrative Entropy (Sn) is operationalized through Information Friction (If, scored 0.0-5.0) and Causal Branching (Cb, scored 0.0-5.0). Sn = If x Cb. Three benchmark calculations demonstrate the formula's calculability: Pulp Fiction (Ma=10.0, Sn=18.0, Ng=0.031 — edge of structural collapse through maximum entropy and maximum Vacuum Variable attractor), Crime and Punishment (Ma=7.8, Sn=5.0, Ng=0.312 — high stability through controlled entropy), and Moby Dick (Ma=9.4, Sn=7.5, Ng=0.167). -/- The Vacuum Variable is formally defined as an attractor with Io=2.5 (maximum informational opacity) and distinguished from Hitchcock's MacGuffin through precise mathematical criteria. Four testable predictions are derived, falsifiable through standard reader response methodology without biometric equipment. -/- The paper demonstrates that Ng constitutes a genuine structural contribution distinct from Shannon's Information Theory through three mathematical elements absent from Shannon: temporal integration of entropy, a formal counterforce mechanism, and a squared denominator capturing exponential attractor requirements of high-entropy systems. (shrink)

Previous work has shown that spontaneous collapse of Fock states of identical fermions can be modeled as arising from random Rabi oscillations between two states. In this paper, a mathematical formalism is presented to incorporate this into many-body quantum field theory. This formalism allows for nonlocal collapse in the context of a relativistic system. While there is no absolute time-ordering of events, this approach allows for a coherent narrative of the collapse process.

In a short article, published in an earlier volume of Philosophy 1 under the title “Philosophy and Mathematics,” I tried to explain the current conception of pure mathematics as the study of abstract structure by construction and elaboration of appropriate axiomatic formalisms. In the present paper I propose to consider certain philosophical problems, of interest to philosophers and mathematicians alike, which have their origin in the relation between such formalisms and any applications to experience that they may possess. Consideration of (...) problems of this kind is no new undertaking, and in Reichenbach's Wahrscheinlichkeitslehre , for instance, a considerable amount of space is devoted to the Anwendungsproblem or problem of application of the formal calculus under consideration. Most such discussions, however, are at bottom an appendage to an account of the formalism itself, and the author's interest is primarily mathematical. The result is that the philosophical issues involved are not given due weight; and it is these philosophical issues that I wish to discuss in the present paper. (shrink)

We revise the mathematical implementation of the Dirac formulation of quantum mechanics, presenting a rigorous framework that unifies most of versions of this implementation.

A physical theory intends to provide us with a picture of a certain domain of physical phenomena. We have become accustomed to deal rather with physical pictures than with phenomena themselves. This is indispensable, even if the number of phenomena contained in the picture is so large that we cannot have them in mind all at the same time or if the phenomena are not directly accessible to our senses and cannot be studied without the help of a set of (...) very complicated apparatus. (shrink)

Algebraic Art explores the invention of a peculiarly Victorian account of the nature and value of aesthetic form, and it traces that account to a surprising source: mathematics. Drawing on literature, art, and photography, it explores how the Victorian mathematical conception of form still resonates today.

This paper provides a mathematical axiomatization of Judgemental Philosophy (JP), aiming to formalize its core concepts—the Pre-Judgemental Field (PJF), the Resonance Drive (RD), and the Judgemental Triad (JT)—using the languages of quantum mechanics and information theory. We model the PJF by defining Indeterminacy as Semantic Entropy (H), Receptivity as an information channel, and Affectivity as a Valence Operator (Α) that generates an initial 'wave function of meaning' (Ψ). The RD is formalized as a negentropic principle that directs the system (...) to minimize semantic entropy, or equivalently, to maximize expected Resonance Intensity (E[ΔH]). The JT is then modeled as a two-step process: C1, a 'Modulation Operator' (Ĉ₁) that reshapes Ψ according to the RD's goal, and C2, a 'Collapse Operator' (Ĉ₂) that fixes the system into a single meaning-eigenstate. Finally, we formalize the 'Ontological Reach Pathway' of Resonance (R) as a Bayesian learning loop, where the subject continuously updates its internal model (Ψ) based on the consequences of its actions in the world. This axiomatization provides a rigorous, potentially computable framework for JP, bridging philosophical inquiry with formal and empirical science. (shrink)

In this paper, I utilise the growing literature on scientific modelling to investigate the nature of formal semantics from the perspective of the philosophy of science. Specifically, I incorporate the inferential framework proposed by Bueno and Colyvan : 345–374, 2011) in the philosophy of applied mathematics to offer an account of how formal semantics explains and models its data. This view produces a picture of formal semantic models as involving an embedded process of inference and representation applying indirectly to linguistic (...) phenomena. The final aim of the paper is directed at proposing a novel account of the syntax–semantics interface while shedding light on empty categories, semantically null forms, underspecified content and compositionality as a whole. (shrink)

"This book is interesting and well-written. The research methods were explained clearly and conclusions were summarized nicely. It is a relatively quick read at only 130 pages. Anyone who has been told, or who has told others, that mathematicians make better thinkers should read this book." MAA Reviews "The authors particularly attend to protecting positive correlations against the self-selection interpretation, merely that logical minds elect studying more mathematics. Here, one finds a stimulating survey of the systemic difficulties people have with (...) basic syllogisms and deductions." CHOICE connect "The authors particularly attend to protecting positive correlations against the self-selection interpretation, merely that logical minds elect studying more mathematics. Here, one finds a stimulating survey of the systemic difficulties people have with basic syllogisms and deductions." CHOICE Connect For centuries, educational policymakers have believed that studying mathematics is important, in part because it develops general thinking skills that are useful throughout life. This 'Theory of Formal Discipline' (TFD) has been used as a justification for mathematics education globally. Despite this, few empirical studies have directly investigated the issue, and those which have showed mixed results. Does Mathematical Study Develop Logical Thinking? describes a rigorous investigation of the TFD. It reviews the theory's history and prior research on the topic, followed by reports on a series of recent empirical studies. It argues that, contrary to the position held by sceptics, advanced mathematical study does develop certain general thinking skills, however these are much more restricted than those typically claimed by TFD proponents. Perfect for students, researchers and policymakers in education, further education and mathematics, this book provides much needed insight into the theory and practice of the foundations of modern educational policy. (shrink)

This paper engages with recent work on formalization in economics to develop a new perspective on mathematization. Boylan and O’Gorman draw on foundations of mathematics to argue that classical mathematics is inappropriate for economics; intuitionistic foundations and constructive mathematics should be used instead. The use of real analysis would be blocked and equilibrium results undermined. I argue that their line of thought faces several challenges; however, I then draw on their analyses and the philosophy of applied mathematics to propose a (...) novel approach in which questions about mathematization are properly understood as questions about the contextual aptness of relevant idealizations. (shrink)

A simple mathematical extension of quantum theory is presented. As well as opening the possibility of alternative methods of calculation, the additional formalism implies a new physical interpretation of the standard theory by providing a picture of an external reality. The new formalism, developed first for the single-particle case, has the advantage of generalizing immediately to quantum field theory and to the description of relativistic phenomena such as particle creation and annihilation.

This paper studies internal (or intra-)mathematical explanations, namely those proofs of mathematical theorems that seem to explain the theorem they prove. The goal of the paper is a rigorous analysis of these explanations. This will be done in two steps. First, we will show how to move from informal proofs of mathematical theorems to a formal presentation that involves proof trees, together with a decomposition of their elements; secondly we will show that those mathematical proofs that (...) are regarded as having explanatory power all display an increase of conceptual complexity from the assumptions to the conclusion. (shrink)

The guiding idea behind formalism is that mathematics is not a body of propositions representing an abstract sector of reality but is much more akin to a game, bringing with it no more commitment to an ontology of objects or properties than ludo or chess. This idea has some intuitive plausibility: consider the tyro toiling at multiplication tables or the student using a standard algorithm for differentiating or integrating a function. It also corresponds to some aspects of the practice (...) of advanced mathematicians in some periods—for example, the treatment of imaginary numbers for some time after Bombelli's introduction of them, and perhaps the attitude of some contemporary mathematicians towards the higher flights of set theory. Finally, it is often the position to which philosophically naïve respondents will gesture towards, when pestered by questions as to the nature of mathematics. (shrink)

Abraham Robinson’s philosophical stance has been the subject of several recent studies. Erhardt following Gaifman claims that Robinson was a finitist, and that there is a tension between his philosophical position and his actual mathematical output. We present evidence in Robinson’s writing that he is more accurately described as adhering to the philosophical approach of Formalism. Furthermore, we show that Robinson explicitly argued against certain finitist positions in his philosophical writings. There is no tension between Robinson’s mathematical (...) work and his philosophy because mathematics and metamathematics are distinct fields: Robinson advocates finitism for metamathematics but no such restriction for mathematics. We show that Erhardt’s analysis is marred by historical errors, by routine conflation of the generic and the technical meaning of several key terms, and by a philosophical parti pris. Robinson’s Formalism remains a viable alternative to mathematical Platonism. (shrink)

This article is a brief formulation of a radical thesis. We start with the formalist doctrine that mathematical objects have no meanings; we have marks and rules governing how these marks can be combined. That's all. Then I go further by arguing that the signs of a formal system of mathematics should be considered as physical objects, and the formal operations as physical processes. The rules of the formal operations are or can be expressed in terms of the laws (...) of physics governing these processes. In accordance with the physicalist understanding of mind, this is true even if the operations in question are executed in the head. A truth obtained through (mathematical) reasoning is, therefore, an observed outcome of a neuro-physiological (or other physical) experiment. Consequently, deduction is nothing but a particular case of induction. (shrink)

In the last decades two different and apparently unrelated lines of research have increasingly connected mathematics and evolutionism. Indeed, on the one hand different attempts to formalize darwinism have been made, while, on the other hand, different attempts to naturalize logic and mathematics have been put forward. Those researches may appear either to be completely distinct or at least in some way convergent. They may in fact both be seen as supporting a naturalistic stance. Evolutionism is indeed crucial for a (...) naturalistic perspective, and formalizing it seems to be a way to strengthen its scientificity. The paper shows that, on the contrary, those directions of research may be seen as conflicting, since the conception of knowledge on which they rest may be undermined by the consequences of accepting an evolutionary perspective. (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)

The philosophy of mathematics has long been concerned with deter- mining the means that are appropriate for justifying claims of mathemat- ical knowledge, and the metaphysical considerations that render them so. But, as of late, many philosophers have called attention to the fact that a much broader range of normative judgments arise in ordinary math- ematical practice; for example, questions can be interesting, theorems important, proofs explanatory, concepts powerful, and so on. The as- sociated values are often loosely classied as (...) aspects of \mathematical understanding." Meanwhile, in a branch of computer science known as \formal ver- ication," the practice of interactive theorem proving has given rise to software tools and systems designed to support the development of com- plex formal axiomatic proofs. Such eorts require one to develop models of mathematical language and inference that are more robust than the the simple foundational models of the last century. This essay explores some of the insights that emerge from this work, and some of the ways that these insights can inform, and be informed by, philosophical theories of mathematical understanding. (shrink)

The paper proposes a reflection on mathematical beauty, considering the possibility of aesthetic qualities for formal language. Through a concise overview of the way this question is understood by some famous scientists and mathematicians, we turn our attention to Gian-Carlo Rota’s theoretical proposal: his reflections as a mathematician and philosopher offer a perspective, of phenomenological matrix, fruitful for looking at the question. Rota’s contribution allows us to focus on the role of competence, acquired through effort, sedimentation and habit of (...) repetition, in cultivating the potential to recognise the aesthetic quality of formal language. Finally, we draw on some contributions from Gestalt theory, closely connected to twentieth-century phenomenology for chronological and conceptual reasons, applying the idea of gestalt wholeness to the mathematical product and proposing some reflections that may help to clarify some of the dynamics underlying the attribution of qualities of beauty to formulas or the detection of its lack. (shrink)

Zest for both system and objectivity is the formal logician's original sin. He pays for it by constant frustrations and by living ofttimes the life of an intellectual outcaste. The task of squeezing a large body of stubborn facts into a more or less rigid system can be a painful one, especially since the facts of mathematics are among the most stubborn of all facts. Moreover, the more general and abstract we get, the farther removed we are from the raw (...) mathematical experience. As intuition ceases to operate effectively, we fall into many unexpected traps. The formal logician gets little sympathy for his frustrations. He is regarded as too rigid by his philosophical colleagues and too speculative by his mathematical friends. The life of an intellectual outcaste may be a result partly of temperament and partly of the youthfulness of the logic profession. The unfortunate lack of wide appeal of logic may, however, be prolonged partly on account of the fact that very little of the well-established techniques of mathematics seems applicable to the treatment of serious problems of logic. The axiomatic method is well suited to provide results which are both exact and systematic. How attractive would it be if we could get an axiom system in which all the axioms and deductions were intuitively clear and all theorems of mathematics were provable? Such a system would undoubtedly satisfy Descartes who admits solely intuition and deduction, which are, for him, the only “mental operations by which we are able, wholly without fear of illusion, to arrive at the knowledge of things.” Indeed, according to Descartes, intuition and deduction “are the most certain routes to knowledge, and the mind should admit no others. All the rest should be rejected as suspect of error and dangerous.”. (shrink)

Proof requires a dialogue between agents to clarify obscure inference steps, fill gaps, or reveal implicit assumptions in a purported proof. Hence, argumentation is an integral component of the discovery process for mathematical proofs. This work presents how argumentation theories can be applied to describe specific informal features in the development of proof-events. The concept of proof-event was coined by Goguen who described mathematical proof as a public social event that takes place in space and time. This new (...) meta-methodological concept is designed to cover not only “traditional” formal proofs but all kinds of proofs and inference steps, including incomplete or purported proofs. Our approach attempts to make proof-events more comprehensive to express the complete trajectory of a mathematical proof-event until the ultimate validation of the proving outcome. Thus, we advance an extended version of proof-event calculus which is built on argumentation theories designed to capture the internal and external structure of collaborative mathematical practice and highlight the relationship between proof, human reasoning, and cognitive processes. In addition, another area in which argumentation can make a significant contribution is dealing with the defeasible knowledge of the Web which is a product of its open and ubiquitous nature. This approach seems to be sufficient for the presentation of Web-based proving processes as manifested in the case of the Mini-Polymath 4 project. (shrink)

In this paper we put a thesis that it is possible to perceive mathematics as a science of structures, where the difference between structure as the object of study and theory as something which describes this object is blurred. We discusses the view of set-theoretical structuralism with a special emphasis placed on a certain gradual development of set theory as a formal theory. We proposes a certain view concerning the methodology of formal sciences, which is an attempt at describing precisely (...) and capturing in a scheme the ways of development of deductive sciences in general, set theory including. We show that the standpoint of sui generis structuralism has some features characteristic of purely formal theory. (shrink)

In this paper we isolate a notion that we call "formalism freeness" from Gödel's 1946 Princeton Bicentennial Lecture, which asks for a transfer of the Turing analysis of computability to the cases of definability and provability We suggest an implementation of Gödel's idea in the case of definability, via versions of the constructible hierarchy based on fragments of second order logic. We also trace the notion of formalism freeness in the very wide context of developments in mathematical (...) logic in the 20th century. (shrink)

Suppose you attend a seminar where a mathematician presents a proof to some of his colleagues. Suppose further that what he is proving is an important mathematical statement Now the following happens: as the mathematician proceeds, his audience is amazed at first, then becomes angry and finally ends up disturbing the lecture (some walk out, some laugh, …). If in addition, you see that the proof he is presenting is formally speaking (nearly) correct, would you say you are witnessing (...) an extraordinary event in urgent need of explanation? Surely, your answer would be yes. But do events of this type actually occur? The matter of the fact is, yes, they do. This paper presents the details of such an event, suggests a possible explanation and examines its implications for our understanding of mathematical practice. (shrink)

This essay presents Husserl’s Formal and Transcendental Logic (1929) in three main sections following the layout of the work itself. The first section focuses on Husserl’s introduction where he explains the method and the aim of the essay. The method used in FTL is radical Besinnung and with it an intentional explication of proper sense of formal logic is sought for. The second section is on formal logic. The third section focuses on Husserl’s “transcendental logic,” which is needed to make (...) Husserl’s conception complete, i.e., to understand what makes Besinnung radical, how the proper sense of formal logic has been reached and how all this relates to transcendental constitution of an object in the world. Husserl’s work is connected to his context (in exact sciences) and the relevance of his views for the contemporary approaches is discussed. (shrink)

Formulas are not only an instrument for formalising mathematical theories, but also the basis of formalism in the philosophy of mathematics. A formula is a finite sequence of primitive symbols from an alphabet.

The formalist concept of mathematics was built in steps. The first step was taken by Hilbert when he investigated the foundation of geometry. It had long been recognised that Euclid’s Elements had flaws, as some proofs were not only reached through logical deduction, but also based on intuitive readings of figures and diagrams. While Euclid presented five axioms, Hilbert presented 20 axioms as the foundations of geometry. A second step was taken by the metamathematical programme, which turned mathematical theories (...) into objects for systematic study. They were concerned with the independence of mathematical axioms, the consistency and completeness of mathematical theories, and the possibility of solving the decision problem. A third step consisted of specifying what a formal system is in terms of: the alphabet the system; the sequences of symbols that count as formulas; the set of formulas that serve as axioms; the rules of inference to apply when making deductions; the notion of proof; and the definition of a theorem. With this clarification of a formal system, formalism declares that mathematics is made up of formalisms. (shrink)

In formal semantics, structure is treated as the essential ingredient in the creation of sentence meaning from individual word meaning. This book introduces some of the foundational concepts, principles and techniques in the formal semantics of natural language and outlines the mathematical principles that underlie linguistics meaning. Using English examples, Yoad Winter presents the most useful tools and concepts of formal semantics in an accessible style and includes a variety of practical exercises so that readers can learn to utilize (...) these tools effectively. For readers with an elementary background in set theory and linguistics or with an interest in mathematical modelling, this fascinating study is an ideal introduction to natural language semantics. Designed as a quick yet thorough introduction to one of the most vibrant areas of research in modern linguistics today this volume reveals the beauty and elegance of the mathematical study of meaning. (shrink)

Condensed mathematics, developed by Clausen and Scholze over the last few years, proposes a generalization of topology with better categorical properties. It replaces the concept of a topological space by that of a condensed set, which can be defined as a sheaf for the coherent topology on a certain category of compact Hausdorff spaces. In this case, the sheaf condition has a fairly simple explicit description, which arises from studying the relationship between the coherent, regular, and extensive topologies. In this (...) paper, we establish this relationship under minimal assumptions on the category, going beyond the case of compact Hausdorff spaces. Along the way, we also provide a characterization of sheaves and covering sieves for these categories. All results in this paper have been fully formalized in the Lean proof assistant. (shrink)

We propose a novel, ontological approach to studying mathematical propositions and proofs. By “ontological approach” we refer to the study of the categories of beings or concepts that, in their practice, mathematicians isolate as fruitful for the advancement of their scientific activity (like discovering and proving theorems, formulating conjectures, and providing explanations). We do so by developing what we call a “formal ontology” of proofs using semantic modeling tools (like RDF and OWL) developed by the computer science community. In (...) this article, (i) we describe this new approach and, (ii) to provide an example, we apply it to the problem of the identity of proofs. We also describe open issues and further applications of this approach (for example, the study of purity of methods). We lay some foundations to investigate rigorously and at large scale intellectual moves and attitudes that underpin the advancement of mathematics through cognitive means (carving out investigationally valuable concepts and techniques) and social means (like communication, collaboration, revision, and criticism of specific categories, inferential patterns, and levels of analysis). Our approach complements other types of analysis of proofs such as reconstruction in a deductive system and examination through a proof-assistant. (shrink)

Carnap's position on mathematical truth in The Logical Syntax of Language has been attacked from two sides: Kreisel argues that it is formalistic but should not be, and Friedman argues that it is not formalistic but needs to be. In this paper I argue that the Carnap of Syntax does not eliminate our ordinary notion of mathematical truth in favour of a formal analogue; so Carnap's notion of mathematical truth is not formalistic. I further argue that there (...) is no conflict between Carnap's use of informal notions and his principle of tolerance; so Carnap's definition of mathematical truth need not be formalistic. CiteULike Connotea Del.icio.us What's this? (shrink)

Over the past half-century, formal, machine-executable proofs have been developed for an impressive range of mathematical theorems. Formalists argue that such proofs should be seen as providing the fully worked out proofs of which mathematicians’ proofs are sketches. Nonformalists argue that this conception of the relationship of formal to informal proofs cannot explain the fact that formal proofs lack essential virtues enjoyed by mathematicians’ proofs, the fact, for example, that formal proofs are not convincing and lack the explanatory power (...) of their informal counterparts. Formal proofs do not yield mathematical insight or understanding, and they are not fruitful in the way that informal proofs can be, for instance, in suggesting novel approaches to old problems. And yet, there is a clear sense in which the formalist is right: Formal proofs do seem to make explicit what is otherwise taken for granted in the mathematician’s reasoning. Very recent work uncovers the source of the dilemma by showing that rigor does not entail formalism insofar as rigor, unlike formalism, is compatible with contentfulness. Mathematical proofs, were they to be recast in a Leibnizian language, at once a characteristica and a calculus, would be, or could be made to be, completely gap-free and hence machine checkable. Because as so recast they would be grounded in mathematical ideas, they would not be machine executable. It is on just this basis that a compelling account can be given of the fact that formal proofs are mostly irrelevant to mathematicians in their practice. (shrink)

It has been accepted since the early part of the Century that there is no problem formalizing mathematics in standard formal systems of axiomatic set theory. Most people feel that they know as much as they ever want to know about how one can reduce natural numbers, integers, rationals, reals, and complex numbers to sets, and prove all of their basic properties. Furthermore, that this can continue through more and more complicated material, and that there is never a real problem.

This books states, as clearly and concisely as possible, the most fundamental principles of set-theory and mathematical logic. Included is an original proof of the incompleteness of formal logic. Also included are clear and rigorous definitions of the primary arithmetical operations, as well as clear expositions of the arithmetic of transfinite cardinals.

In dealing with the problem of the interrelations between mathematical logic and formal logic, we must first of all make clear just what mathematical logic is. In our opinion, the concept "mathematical logic" is employed in two different senses in mathematical and logical literature. A successful approach to our problem necessitates a clear differentiation between these two senses. Therefore we shall speak hereafter not of mathematical logic in general, but of mathematical logic in the (...) narrow meaning and in the broad meaning of the term. (shrink)

Formalism shares with nominalism a distaste for _abstracta_. But an honest exposition of the former position risks introducing _abstracta_ as the stuff of syntax. This article describes the dangers, and offers a new escape route from platonism for the formalist. It is explained how the needed role of derivations in mathematical practice can be explained, not by a commitment to the derivations themselves, but by the commitment of the mathematician to a practice which is in accord with a (...) theory of derivations. (shrink)

In the article, philosophical and methodological analysis of the program of Hilbert’s formalism as a really working direction for consideration of the bases of modern mathematics is presented. For the professional mathematicians methodological advantages of the program of formalism advanced by David Hilbert, consist primarily in the fact that the highest possible level of theoretical rigor of modern mathematical theories was practically represented there. To resolve the fundamental difficulties of the problem of bases of mathematics, according to (...) Hilbert, the theory of mathematical proof is needed, but contrary to popular belief rigorous formalization of the proof is not a synonym of reliability and rigor of mathematical reasoning from the point of view of the philosophy of the foundations of mathematics. In fact, the consistency of the theories is "more important" than their logical consistency because not every statement, which does not contradict to the reasonable ones, can be attributed to a true statement. However, for working mathematicians, Hilbert is logical and consistent and the axiomatic method and formalism are an essential part of their rules of thinking. (shrink)

ABSTRACT In a recent essay, Sören Stenlund tries to align Wittgenstein’s approach to the foundations and nature of mathematics with the tradition of symbolic mathematics. The characterization of symbolic mathematics made by Stenlund, according to which mathematics is logically separated from its external applications, brings it closer to the formalist position. This raises naturally the question whether Wittgenstein holds a formalist position in philosophy of mathematics. The aim of this paper is to give a negative answer to this question, defending (...) the view that Wittgenstein always thought that there is no logical separation between mathematics and its applications. I will focus on Wittgenstein’s remarks about arithmetic during his middle period, because it is in this period that a formalist reading of his writings is most tempting. I will show how his idea of autonomy of arithmetic is not to be compared with the formalist idea of autonomy, according to which a calculus is “cut off” from its applications. The autonomy of arithmetic, according to Wittgenstein, guarantees its own applicability, thus providing its own raison d’être. RESUMO Em um recente artigo, Sören Stenlund procura alinhar a abordagem de Wittgenstein em relação aos fundamentos e à natureza da matemática com a tradição da matemática simbólica. A caracterização da matemática simbólica feita por Stenlund, de acordo com a qual a matemática é logicamente separada de suas aplicações externas, a aproxima da posição formalista. Isto naturalmente levanta a questão de se Wittgenstein defende uma posição formalista em filosofia da matemática. O objetivo deste artigo é dar uma resposta negativa a esta questão, ao defender que Wittgenstein sempre pensou não haver separação lógica entre a matemática e suas aplicações. Atenção especial será dada às observações de Wittgenstein sobre a aritmética pertencentes ao seu período intermediário, pois é neste período que uma leitura formalista de seus escritos é mais sedutora. Mostrarei como sua ideia de autonomia da aritmética não deve ser comparada à ideia formalista de autonomia, segundo a qual um cálculo é “cortado” de suas aplicações. A autonomia da aritmética, para Wittgenstein, garante ela própria sua aplicabilidade, provendo, assim, sua própria raison d’être. (shrink)

We introduce a class of forcing notions, called forcing notions of type S, which contains among other Sacks forcing, Prikry-Silver forcing and their iterations and products with countable supports. We construct and investigate some formalism suitable for this forcing notions, which allows all standard tricks for iterations or products with countable supports of Sacks forcing. On the other hand it does not involve internal combinatorial structure of conditions of iterations or products. We prove that the class of forcing notions (...) of type S is closed under products and certain iterations with countable supports. (shrink)

This series provides a forum for cutting-edge studies in logic and the modern philosophy of language as well as for publications in the field of analytical metaphysics.

The present paper discusses a proposal which says,roughly and with several qualifications, that thecollection of mathematical truths is identical withthe set of theorems of ZFC. It is argued that thisproposal is not as easily dismissed as outright falseor philosophically incoherent as one might think. Some morals of this are drawn for the concept ofmathematical knowledge.

This chapter examines the increasing use of mathematics in Arthur Cecil Pigou’s economic writings. Pigou’s attitudes towards biological and mechanical analogies as means by which to capture economic reality are considered by examining his attitudes to method generally and by reconstructing aspects of his training in mathematics and his use of mathematics over the course of his career. It is argued that Pigou’s heightened use of mathematics was a continuous and considered departure from Alfred Marshall’s practice of relegating mathematical (...) analysis to footnotes and appendices. It is also demonstrated, however, that Pigou retained the Marshallian trait of employing a plurality of methods, and that this can be understood in terms of the Fleckian notion of evolving thought styles. Pigou’s book The Theory of Unemployment is used as a case study to underline arguments presented in the chapter. (shrink)