Mathematical proof is the primary form of justification for mathematical knowledge, but in order to count as a proper justification for a piece of mathematical knowl- edge, a mathematical proof must be rigorous. What does it mean then for a mathematical proof to be rigorous? According to what I shall call the standard view, a mathematical proof is rigorous if and only if it can be routinely translated into a formal proof. The standard view (...) is almost an orthodoxy among contemporary mathematicians, and is endorsed by many logicians and philosophers, but it has also been heavily criticized in the philosophy of mathematics literature. Progress on the debate between the proponents and opponents of the standard view is, however, currently blocked by a major obstacle, namely the absence of a precise formulation of it. To remedy this deficiency, I undertake in this paper to provide a precise formulation and a thorough evaluation of the standard view of mathematical rigor. The upshot of this study is that the standard view is more robust to criticisms than it transpires from the various arguments advanced against it, but that it also requires a certain conception of how mathematical proofs are judged to be rigorous in mathematical practice, a conception that can be challenged on empirical grounds by exhibiting rigor judgments of mathematical proofs in mathematical practice conflicting with it. (shrink)

Many arguments found in the physics literature involve concepts that are not well-defined by the usual standards of mathematics. I argue that physicists are entitled to employ such concepts without rigorously defining them so long as they restrict the sorts of mathematical arguments in which these concepts are involved. Restrictions of this sort allow the physicist to ignore calculations involving these concepts that might lead to contradictory results. I argue that such restrictions need not be ad hoc, but can (...) sometimes be justified by considering some of the metaphysical issues surrounding the question of the applicability of mathematics to physical reality. 1 Introduction 2 Rejecting inferential permissiveness 3 The agreement problem 4 Independent objections to the liberal view. (shrink)

Mathematical rigor is commonly formulated by mathematicians and philosophers using the notion of proof gap: a mathematical proof is rig­orous when there is no gaps in the mathematical reasoning of the proof. Any philosophical approach to mathematical rigor along this line requires then an account of what a proof gap is. However, the notion of proof gap makes sense only relatively to a given conception of valid mathematical reasoning, i.e., to a given conception (...) of the validity of mathematical inference. A proof gap can in particular be conceived as a failure in drawing a valid mathematical inference. The aim of this paper is to discuss two possible views of the validity of math­ematical inference with respect to their capacity to yield a plausible account of the intuitive notion(s) of proof gap present in mathematical practice. The first view is the one provided by the contemporary standards of mathematical rigor: a mathematical inference is valid if and only if its conclusion can be formally derived from its premises. We will argue that this conception does not lead to a plausible account of the intuitive notion(s) of proof gap. The second view is based on a new account of the validity of inference proposed by Prawitz: an inference is valid if and only if it consists in an operation that provides a ground for its conclusion given (previously obtained) grounds for its premises. We will first specify Prawitz's account to mathematical inference and we will then argue that the resulting ground-based account is able to capture various intuitive notions of proof gap as different types of failure in drawing valid mathematical inferences. We conclude that the ground-based account ap­pears of particular interest for the philosophy of mathematical practice, and we finally raise several challenges facing a full development of a ground-based account of the notions of mathematical rigor, proof gap and the validity of mathematical inference. (shrink)

Rigorous proof is supposed to guarantee that the premises invoked imply the conclusion reached, and the problem of rigor may be described as that of bringing together the perspectives of formal logic and mathematical practice on how this is to be achieved. This problem has recently raised a lot of discussion among philosophers of mathematics. We survey some possible solutions and argue that failure to understand its terms properly has led to misunderstandings in the literature.

The present paper examines the role of exact results in the theory of many‐body physics, and specifically the example of the Mermin‐Wagner theorem, a rigorous result concerning the absence of phase transitions in low‐dimensional systems. While the theorem has been shown to hold for a wide range of many‐body models, it is frequently ‘violated’ by results derived from the same models using numerical techniques. This raises the question of how scientists regulate their theoretical commitments in such cases, given that the (...) models, too, are often described as approximations to the underlying ‘full’ many‐body problem. (shrink)

Nobody can deny that the figure of Edmund Husserl represents the key to the philosophical horizon of our time in both version, as continental as analytical one. But, how can the same approach give ground and support to the development of such diverse topics? Although much work has been done to explain the renewed sense that science and philosophy acquire inside their proposal, the way Husserl reached that conclusion is not sufficiently clear yet. That is why in this article we (...) intend to clarify some aspects of his thought transformation, keeping it up whit his early concerns that will lead, inevitably, in his critique of knowledge. To achieve this, we will follow the husserlian itinerary from The philosophy of arithmetic to his conception of philosophy as the strictest science. (shrink)

The ArgumentIt has long been apparent that in the nineteenth century, mathematics in France and England developed along different lines. The differences, which might well be labelled stylistic, are most easy to see on the foundational level. At first this may seem surprising because it is such a fundamental area, but, upon reflection, it is to be expected. Ultimately discussions about the foundations of mathematics turn on views about what mathematics is, and this is a question which is answered by (...) a variety of different groups including mathematicians, students, curricular planners, parents, etc. Mathematical practice rests on some kind of mixture of the answers to this fundamental question which come from these diverse groups. Comparing the cultural matrices which supported mathematics in France and Britain in the first decades of the nineteenth century sheds light on the real though often subtle differences in the ways the subject was pursued in the two countries. (shrink)

Duhem's portrayal of the history of mathematics as manifesting calm and regular development is traced to his conception of mathematical rigor as an essentially static concept. This account is undermined by citing controversies over rigorous demonstration from the eighteenth and twentieth centuries.

The relationship is explored between formal derivations, which occur in artificial languages, and mathematical proof, which occurs in natural languages. The suggestion that ordinary mathematical proofs are abbreviations or sketches of formal derivations is presumed false. The alternative suggestion that the existence of appropriate derivations in formal logical languages is a norm for ordinary rigorous mathematical proof is explored and rejected.

With the arrival of the nineteenth century, a process of change guided the treatment of three basic elements in the development of mathematics: rigour, the arithmetization and the clarification of the concept of function, categorised as the most important tool in the development of the mathematical analysis. In this paper we will show how several prominent mathematicians contributed greatly to the development of these basic elements that allowed the solid underpinning of mathematics and the consideration of mathematics as an (...) axiomatic way of thinking in which anyone can deduce valid conclusions from certain types of premises. This nineteenth century stage shares, possibly with the Heroic Age of Ancient Greece, the most revolutionary period in all history of mathematics. (shrink)

While we are commonly told that the distinctive method of mathematics is rigorous proof, and that the special topic of mathematics is abstract structure, there has been no agreement among mathematicians, logicians, or philosophers as to just what either of these assertions means. John P. Burgess clarifies the nature of mathematical rigor and of mathematical structure, and above all of the relation between the two, taking into account some of the latest developments in mathematics, including the rise (...) of experimental mathematics on the one hand and computerized formal proofs on the other hand. Along the way, a great many historical developments in mathematics, philosophy, and logic are surveyed. Yet very little in the way of background knowledge on the part of the reader is presupposed. (shrink)

A new approach to informal rigorous mathematical proof is offered. To this end, algorithmic devices are characterized and their central role in mathematical proof delineated. It is then shown how all the puzzling aspects of mathematical proof, including its peculiar capacity to convince its practitioners, are explained by algorithmic devices. Diagrammatic reasoning is also characterized in terms of algorithmic devices, and the algorithmic device view of mathematical proof is compared to alternative construals of informal proof to (...) show its superiority. (shrink)

Criteria of acceptability for mathematical proofs are field-dependent. In topology, though not in most other domains, it is sometimes acceptable to appeal to visual intuition to support inferential steps. In previous work :829–842, 2014; Lolli, Panza, Venturi From logic to practice, Springer, Berlin, 2015; Larvor Mathematical cultures, Springer, Berlin, 2016) my co-author and I aimed at spelling out how topological proofs work on their own terms, without appealing to formal proofs which might be associated with them. In this (...) article, I address two criticisms that have been raised in Tatton-Brown against our approach: that it leads to a form of relativism according to which validity is equated with social agreement and that it implies an antiformalizability thesis according to which it is not the case that all rigorous mathematical proofs can be formalized. I reject both criticisms and suggest that our previous case studies provide insight into the plausibility of two related but quite different theses. (shrink)

This paper argues that a successful philosophical analysis of models and simulations must accommodate an account of mathematically rigorous results. Such rigorous results may be thought of as genuinely model-specific contributions, which can neither be deduced from fundamental theory nor inferred from empirical data. Rigorous results provide new indirect ways of assessing the success of models and simulations and are crucial to understanding the connections between different models. This is most obvious in cases where rigorous results map different models on (...) to one another. Not only does this put constraints on the extent to which performance in specific empirical contexts may be regarded as the main touchstone of success in scientific modelling, it also allows for the transfer of warrant across different models. Mathematically rigorous results can thus come to be seen as not only strengthening the cohesion between scientific strategies of modelling and simulation, but also as offering new ways of indirect confirmation. (shrink)

This paper critically examines and evaluates Yacin Hamami’s reconstruction of the standard view of mathematical rigor. We will argue that the reconstruction offered by Hamami is premised on a strong and controversial epistemological thesis and a strong and controversial thesis in the philosophy of mind. Secondly, we will argue that Hamami’s reconstruction of the standard view robs it of its original philosophical rationale, i.e. making sense of the notion of rigor in mathematical practice.

Logical paradoxes – like the Liar, Russell's, and the Sorites – are notorious. But in Paradoxes and Inconsistent Mathematics, it is argued that they are only the noisiest of many. Contradictions arise in the everyday, from the smallest points to the widest boundaries. In this book, Zach Weber uses “dialetheic paraconsistency” – a formal framework where some contradictions can be true without absurdity – as the basis for developing this idea rigorously, from mathematical foundations up. In doing so, Weber (...) directly addresses a longstanding open question: how much standard mathematics can paraconsistency capture? The guiding focus is on a more basic question, of why there are paradoxes. Details underscore a simple philosophical claim: that paradoxes are found in the ordinary, and that is what makes them so extraordinary. (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)

Against the modern tendency to considerate just the formal-empirical knowledge as Science, and this one mathematized as much as possible, here many declarations of Aristotle are raised in order to show that the scientific rigour is not univocal but analogic: it is determined according to the nature of the object to be known. This is a so elementary epistemological rule that not knowing it is understood by that philosopher as apaideusia, i.e., lack of basic education in the knowledge sphere in (...) general. To the Stagirite, a pepaideuménos, i.e., a well educated spirit requires to every subject just the kind of rigour which is adequate to it, attempting not to impose whether the demonstrative or the mathematical rigour to the subject. It is specially truth for the theological Science, whose subject, by being transcendent, asks for a sui generis rigour which has to be so faithful as possible to it. (shrink)

2014 Reprint of 1954 American Edition. Full facsimile of the original edition, not reproduced with Optical Recognition Software. This two volume classic comprises two titles: "Patterns of Plausible Inference" and "Induction and Analogy in Mathematics." This is a guide to the practical art of plausible reasoning, particularly in mathematics, but also in every field of human activity. Using mathematics as the example par excellence, Polya shows how even the most rigorous deductive discipline is heavily dependent on techniques of guessing, inductive (...) reasoning, and reasoning by analogy. In solving a problem, the answer must be guessed at before a proof can be given, and guesses are usually made from a knowledge of facts, experience, and hunches. The truly creative mathematician must be a good guesser first and a good prover afterward; many important theorems have been guessed but no proved until much later. In the same way, solutions to problems can be guessed, and a god guesser is much more likely to find a correct solution. This work might have been called "How to Become a Good Guesser."-From the Dust Jacket. (shrink)

Analyses in Greek geometry are traditionally seen as heuristic devices. However, many occurrences of analysis in formal treatises are difficult to justify in such terms. I show that Greek analysies of geometrics can also serve formal mathematical purposes, which are arguably incomplete without which their associated syntheses are arguably incomplete. Firstly, when the solution of a problem is preceded by an analysis, the analysis latter proves rigorously that there are no other solutions to the problem than those offered in (...) the synthesis. Secondly, whenever some construction assumption beyond ruler and compass is made, the problem is not only solvable by that assumption but is in fact equivalent to that assumption in a rigorous sense. (shrink)

Part I of the present work outlined the rigorous application of information theory to a quantum mechanical system in a thermodynamic equilibrium state. The general formula developed there for the best-guess density operator $\hat \rho$ was indeterminate because it involved in an essential way an unspecified prior probability distribution over the continuumD H of strong equilibrium density operators. In Part II mathematical evaluation of $\hat \rho$ is completed after an epistemological analysis which leads first to the discretization ofD H (...) and then to the adoption of a suitable indifference axiom to delimit the set of admissible prior distributions. Finally, quantal formulas for information-theoretic and thermodynamic entropies are contrasted, and the entire work is summarized. (shrink)

The classification of algebraic surfaces by the Italian School of algebraic geometry is universally recognized as a breakthrough in 20th-century mathematics. The methods by which it was achieved do not, however, meet the modern standard of rigor and therefore appear dubious from a contemporary viewpoint. In this article, we offer a glimpse into the mathematical practice of the three leading exponents of the Italian School of algebraic geometry: Castelnuovo, Enriques, and Severi. We then bring into focus their distinctive (...) conception of rigor and intuition. Unlike what is often assumed today, from their perspective, rigor is neither opposed to intuition nor understood as a unitary phenomenon – Enriques distinguishes between small-scale rigor and large-scale rigor and Severi between formal rigor and substantial rigor. Finally, we turn to the notion of mathematical objectivity. We draw from our case study in order to advance a multi-dimensional analysis of objectivity. Specifically, we suggest that various types of rigor may be associated with different conceptions of objectivity: namely, objectivity as faithfulness to facts and objectivity as intersubjectivity. (shrink)

Here the author of How to Solve It explains how to become a "good guesser." Marked by G. Polya's simple, energetic prose and use of clever examples from a wide range of human activities, this two-volume work explores techniques of guessing, inductive reasoning, and reasoning by analogy, and the role they play in the most rigorous of deductive disciplines.

The Prague Philosopher Bernard Bolzano (1781-1848) has long been admired for his groundbreaking work in mathematics: his rigorous proofs of fundamental theorems in analysis, his construction of a continuous, nowhere-differentiable function, his investigations of the infinite, and his anticipations of Cantor's set theory. He made equally outstanding contributions in philosophy, most notably in logic and methodology. One of the greatest mathematician-philosophers since Leibniz, Bolzano is now widely recognised as a major figure of nineteenth-century philosophy. Praised by Husserl as “one of (...) the greatest logicians of all times,” he has also been recognised by Michael Dummett as one of the first modern analytic philosophers and by Alberto Coffa as the founder of the “semantic tradition.” This volume contains English translations of the essay “On the Mathematical Method,” a concise introduction to Bolzano’s logic and philosophy of mathematics, as well as substantial selections from his correspondence with Franz Exner, Professor of Philosophy at the Charles University in Prague in the 1830s and 40s. It will be of interest to students of Austrian philosophy, the development of analytic philosophy, the philosophy of language, and the history and philosophy of logic and mathematics. (shrink)

Assuming no previous study in logic, this informal yet rigorous text covers the material of a standard undergraduate first course in mathematical logic, using natural deduction and leading up to the completeness theorem for first-order logic. At each stage of the text, the reader is given an intuition based on standard mathematical practice, which is subsequently developed with clean formal mathematics. Alongside the practical examples, readers learn what can and can't be calculated; for example the correctness of a (...) derivation proving a given sequent can be tested mechanically, but there is no general mechanical test for the existence of a derivation proving the given sequent. The undecidability results are proved rigorously in an optional final chapter, assuming Matiyasevich's theorem characterising the computably enumerable relations. Rigorous proofs of the adequacy and completeness proofs of the relevant logics are provided, with careful attention to the languages involved. Optinal sections discuss the classification of mathematical structures by first-order theories; the required theory of cardinality is developed from scratch. Throughout the book there are notes on historical aspects of the material, and connections with linguistics and computer science, and the discussion of syntax and semantics is influenced by modern linguistic approaches. Two basic themes in recent cognitive science studies of actual human reasoning are also introduced. Including extensive exercises and selected solutions, this text is ideal for students in logic, mathematics, philosophy, and computer science. (shrink)

Mark Balaguer’s project in this book is extremely ambitious; he sets out to defend both platonism and fictionalism about mathematical entities. Moreover, Balaguer argues that at the end of the day, platonism and fictionalism are on an equal footing. Not content to leave the matter there, however, he advances the anti-metaphysical conclusion that there is no fact of the matter about the existence of mathematical objects.1 Despite the ambitious nature of this project, for the most part Balaguer does (...) not shortchange the reader on rigor; all the main theses advanced are argued for at length and with remarkable clarity and cogency. There are, of course, gaps in the account but these should not be allowed to overshadow the sig-. (shrink)

Open texture is a kind of semantic indeterminacy first systematically studied by Waismann. In this paper, extant definitions of open texture will be compared and contrasted, with a view towards the consequences of open-textured concepts in mathematics. It has been suggested that these would threaten the traditional virtues of proof, primarily the certainty bestowed by proof-possession, and this suggestion will be critically investigated using recent work on informal proof. It will be argued that informal proofs have virtues that mitigate the (...) danger posed by open texture. Moreover, it will be argued that while rigor in the guise of formalisation and axiomatisation might banish open texture from mathematical theories through implicit definition, it can do so only at the cost of restricting the tamed concepts in certain ways. (shrink)

This paper has three goals: (i) to show that the foundational program begun in the Begriffsschroft, and carried forward in the Grundlagen, represented Frege's attempt to establish the autonomy of arithmetic from geometry and kinematics; the cogency and coherence of 'intuitive' reasoning were not in question. (ii) To place Frege's logicism in the context of the nineteenth century tradition in mathematical analysis, and, in particular, to show how the modern concept of a function made it possible for Frege to (...) pursue the goal of autonomy within the framework of the system of second-order logic of the Begriffsschrift. (iii) To address certain criticisms of Frege by Parsons and Boolos, and thereby to clarify what was and was not achieved by the development, in Part III of the Begriffsschrift, of a fragment of the theory of relations. (shrink)

This paper outlines a framework that may provide a mathematically rigorous quantum field theory. The framework relies upon the methods of nonstandard analysis. A theory of nonstandard inner product spaces and operators on these spaces is first developed. This theory is then applied to construct nonstandard Fock spaces which extend the standard Fock spaces. Then a rigorous framework for the field operators of quantum field theory is presented. The results are illustrated for the case of Klein-Gordon fields.

"With exceptional clarity, but with no evasion of essential ideas, the author outlines the fundamental structure of mathematics."--Carl B. Boyer, Brooklyn College. This enlightening survey of mathematical concept formation holds a natural appeal to philosophically minded readers, and no formal training in mathematics is necessary to appreciate its clear exposition. Contents include examinations of arithmetic and geometry; the rigorous construction of the theory of integers; the rational numbers and their foundation in arithmetic; and the rigorous construction of elementary arithmetic. (...) Advanced topics encompass the principle of complete induction; the limit and point of accumulation; operating with sequences and differential quotient; remarkable curves; real numbers and ultrareal numbers; and complex and hypercomplex numbers. 1959 ed. 27 Figures. Index. (shrink)

A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical (...) logic as well as practical applications through the easy to understand and use deductive systems of Semantic Tableaux and Resolution. The chapters on set theory, number theory, combinatorics and graph theory combine the necessary minimum of theory with numerous examples and selected applications. Written in a clear and reader-friendly style, each section ends with an extensive set of exercises, most of them provided with complete solutions which are available in the accompanying solutions manual. Key Features: Suitable for a variety of courses for students in both Mathematics and Computer Science. Extensive, in-depth coverage of classical logic, combined with a solid exposition of a selection of the most important fields of discrete mathematics Concise, clear and uncluttered presentation with numerous examples. Covers some applications including cryptographic systems, discrete probability and network algorithms. Logic and Discrete Mathematics: A Concise Introduction is aimed mainly at undergraduate courses for students in mathematics and computer science, but the book will also be a valuable resource for graduate modules and for self-study. (shrink)

In 1675, Leibniz elaborated his longest mathematical treatise he everwrote, the treatise ``On the arithmetical quadrature of the circle, theellipse, and the hyperbola. A corollary is a trigonometry withouttables''. It was unpublished until 1993, and represents a comprehensive discussion of infinitesimalgeometry. In this treatise, Leibniz laid the rigorous foundation of thetheory of infinitely small and infinite quantities or, in other words,of the theory of quantified indivisibles. In modern terms Leibnizintroduced `Riemannian sums' in order to demonstrate the integrabilityof continuous functions. (...) The article deals with this demonstration,with Leibniz's handling of infinitely small and infinite quantities,and with a general theorem regarding hyperboloids. (shrink)

The present paper focuses on a particular class of models intended to describe and explain the physical behaviour of systems that consist of a large number of interacting particles. Such many-body models are characterized by a specific Hamiltonian (energy operator) and are frequently employed in condensed matter physics in order to account for such phenomena as magnetism, superconductivity, and other phase transitions. Because of the dual role of many-body models as models of physical sys-tems (with specific physical phenomena as their (...) explananda) as well as mathematical structures, they form an important sub-class of scientific models, from which one can expect to draw general conclusions about the function and functioning of models in science, as well as to gain specific insight into the challenge of modelling complex systems of correlated particles in condensed matter physics. In particular, it is argued that many-body models contribute novel elements to the process of inquiry and open up new avenues of cross-model confirmation and model-based understanding. In contradistinction to phenomenological models, which have received comparatively more philosophical attention, many-body models typically gain their strength not from ‘empirical fit’ per se, but from their being the result of a constructive application of mature formalisms, which frees them from the grip of both ‘fundamental theory’ and an overly narrow conception of ‘empirical success’. (shrink)

Based on the ideas of Einstein and Minkowski, this concise treatment is derived from the author's many years of teaching the mathematics of relativity at the University of Michigan. Geared toward advanced undergraduates and graduate students of physics, the text covers old physics, new geometry, special relativity, curved space, and general relativity. Beginning with a discussion of the inverse square law in terms of simple calculus, the treatment gradually introduces increasingly complicated situations and more sophisticated mathematical tools. Changes in (...) fundamental concepts, which characterize relativity theory, and the refinements of mathematical technique are incorporated as necessary. The presentation thus offers an easier approach without sacrifice of rigor. Dover (2014) republication of the edition published by John Wiley & Sons, New York, 1950. See every Dover book in print at www.doverpublications.com. (shrink)

This eighth book of the author on gambling math presents in accessible terms the cold mathematics behind the sparkling slot machines, either physical or virtual. It contains all the mathematical facts grounding the configuration, functionality, outcome, and profits of the slot games. Therefore, it is not a so-called how-to-win book, but a complete, rigorous mathematical guide for the slot player and also for game producers, being unique in this respect. As it is primarily addressed to the slot player, (...) its goal is to present practical applications of the mathematical models of slot games, in order to provide numerical results that a player can use as criteria for gaming decisions or just as information for any slot game and any predicted winning event. These results are focused on probability and expected value, these being the most important parameters for decisional criteria in slots. The book is packed with plenty of figures, tables, and formulas. The content is organized so that readers can skip the theoretical parts and go picking the practical results (numerical, in tables of values where possible, or ready-to-compute formulas) for the desired situation. The practical results are gathered in the last chapter, titled "Practical Applications and Numerical Results," the largest part of the book, for the most popular categories of slot machines, namely with 3, 5, 9, and 16 reels. Any other category of slot games is covered in the theoretical part of the book, where the general formulas apply not only to existing slot games, but also to possible future slot games of any design and configuration. The author does not just throw the slot mathematics to the audience and run away, but offers an ultimate practical contribution with the chapter "How to estimate the number of stops and the symbol distribution on a reel", a surprise for both players and producers, where one can see that mathematics provides players with some statistical methods as well as methods based on physical measurements for retrieving these missing data. Having these data along with the mathematical results of this book, anyone can generate the PAR sheet of any slot machine. In the last decade, mathematics has been taken more and more seriously into account in gaming, as being the essence that governs the games of chance and the only rigorous tool providing information on optimal play, where possible. For the popular game of slots, mathematics already fulfilled its duty by providing all the data that it can provide and that cannot be found on the display of the slot machines - it is all here in this book. (shrink)

The main feature of NF/NFU is the notion of stratification, which sets it apart from other set theories. We define stratification and prove constructively that every stratified formula has the (unique) least assignment of types. The basic notion of stratification is concerned only with variables, but we extend it to abstraction terms in order to simplify further development. We reflect on nested abstraction terms, proving that they get the expected types. These extensions enable us to check whether some complex formula (...) is stratified without rewriting it in the basic language. We also introduce natural numbers and a variant of the axiom of infinity, in order to precisely introduce type level ordered pairs, which are crucial in simplifying the definitions in the last part of the article. Using these notions we can easily define the sets of ordinal and cardinal numbers, which we show at the end of the article. The same approach can be readily applied to NF. (shrink)

often insisted existence in mathematics means logical consistency, and formal logic is the sole guarantor of rigor. The paper joins this to his view of intuition and his own mathematics. It looks at predicativity and the infinite, Poincaré's early endorsement of the axiom of choice, and Cantor's set theory versus Zermelo's axioms. Poincaré discussed constructivism sympathetically only once, a few months before his death, and conspicuously avoided committing himself. We end with Poincaré on Couturat, Russell, and Hilbert.

At least since the seventeenth century, the strange combination of epistemological certainty and ontological power that characterizes mathematics has made it a major focus of philosophical, social, and cultural negotiation. In the eighteenth century, all of these factors were at play as mathematical thinkers struggled to assimilate and extend the analysis they had inherited from the seventeenth century. A combination of educational convictions and historical assumptions supported a humanistic mathematics essentially defined by its flexibility and breadth. This mathematics was (...) an expression of l’esprit humain, which was unfolding in a progressive historical narrative. The French Revolution dramatically altered the historical and educational landscapes that had supported this eighteenth‐century approach, and within thirty years Augustin Louis Cauchy had radically reconceptualized and restructured mathematics to be rigorous rather than narrative. (shrink)