Logicism in Mathematics

We can introduce singular terms for ordered pairs by means of an abstraction principle. Doing so proves useful for a number of projects in the philosophy of mathematics. However there is a question whether we can appeal to the abstraction principle in good faith, since a version of the Caesar Problem can be generated, posing the worry that abstraction fails to introduce expressions which refer determinately to the requisite sort of object. In this short paper I will pose the difficulty, (...) and then propose a solution. (shrink)

Section 1 reviews Strawson’s logic of presuppositions. Strawson’s justification is critiqued and a new justification proposed. Section 2 extends the logic of presuppositions to cases when the subject class is necessarily empty, such as (x)((Px & ~Px) → Qx) . The strong similarity of the resulting logic with Richard Diaz’s truth-relevant logic is pointed out. Section 3 further extends the logic of presuppositions to sentences with many variables, and a certain valuation is proposed. It is noted that, given this valuation, (...) Gödel’s sentence becomes neither true nor false. The similarity of this outcome with Goldstein and Gaifman’s solution of the Liar paradox, which is discussed in section 4, is emphasized. Section 5 returns to the definition of meaningfulness; the meaninglessness of certain sentences with empty subjects and of the Liar sentence is discussed. The objective of this paper is to show how all of the above-mentioned concepts are interrelated. (shrink)

Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. We re-explore this idea and discover that in the setting of the (...) potential infinite one can interpret first-order Peano arithmetic, but not second-order Peano arithmetic. We conclude that in order for the logicist to weaken the metaphysically loaded claim of necessary actual infinities, they must also weaken the mathematics they recover. (shrink)

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

Neo-Fregean logicists claim that Hume's Principle (HP) may be taken as an implicit definition of cardinal number, true simply by fiat. A longstanding problem for neo-Fregean logicism is that HP is not deductively conservative over pure axiomatic second-order logic. This seems to preclude HP from being true by fiat. In this paper, we study Richard Kimberly Heck's Two-sorted Frege Arithmetic (2FA), a variation on HP which has been thought to be deductively conservative over second-order logic. We show that it isn't. (...) In fact, 2FA is not conservative over $n$-th order logic, for all $n \geq 2$. It follows that in the usual one-sorted setting, HP is not deductively Field-conservative over second- or higher-order logic. (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)

Any logic is represented as a certain collection of well-orderings admitting or not some algebraic structure such as a generalized lattice. Then universal logic should refer to the class of all subclasses of all well-orderings. One can construct a mapping between Hilbert space and the class of all logics. Thus there exists a correspondence between universal logic and the world if the latter is considered a collection of wave functions, as which the points in Hilbert space can be interpreted. The (...) correspondence can be further extended to the foundation of mathematics by set theory and arithmetic, and thus to all mathematics. (shrink)

The rather unrestrained use of second-order logic in the neo-logicist program is critically examined. It is argued in some detail that it brings with it genuine set-theoretical existence assumptions and that the mathematical power that Hume’s Principle seems to provide, in the derivation of Frege’s Theorem, comes largely from the ‘logic’ assumed rather than from Hume’s Principle. It is shown that Hume’s Principle is in reality not stronger than the very weak Robinson Arithmetic Q. Consequently, only a few rudimentary facts (...) of arithmetic are logically derivable from Hume’s Principle. And that hardly counts as a vindication of logicism. (shrink)

This paper aims to answer the question of whether or not Frege's solution limited to value-ranges and truth-values proposed to resolve the "problem of indeterminacy of reference" in section 10 of Grundgesetze is a violation of his principle of complete determination, which states that a predicate must be defined to apply for all objects in general. Closely related to this doubt is the common allegation that Frege was unable to solve a persistent version of the Caesar problem for value-ranges. It (...) is argued that, in Frege’s standards of reducing arithmetic to logic, his solution to the indeterminacy does not give rise to any sort of Caesar problem in the book. (shrink)

Gottlob Frege abandoned his logicist program after Bertrand Russell had discovered that some assumptions of Frege’s system lead to contradiction (so called Russell’s paradox). Nevertheless, he proposed a new attempt for the foundations of mathematics in two last years of his life. According to this new program, the whole of mathematics is based on the geometrical source of knowledge. By the geometrical source of cognition Frege meant intuition which is the source of an infinite number of objects in arithmetic. In (...) this article, I describe this final attempt of Frege to provide the foundations of mathematics. Furthermore, I compare Frege’s views of intuition from The Foundations of Arithmetic (and his later views) with the Kantian conception of pure intuition as the source of geometrical axioms. In the conclusion of the essay, I examine some implications for the debate between Hans Sluga and Michael Dummett concerning the realistic and idealistic interpretations of Frege’s philosophy. (shrink)

Within the context of the Quine–Putnam indispensability argument, one discussion about the status of mathematics is concerned with the ‘Enhanced Indispensability Argument’, which makes explicit in what way mathematics is supposed to be indispensable in science, namely explanatory. If there are genuine mathematical explanations of empirical phenomena, an argument for mathematical platonism could be extracted by using inference to the best explanation. The best explanation of the primeness of the life cycles of Periodical Cicadas is genuinely mathematical, according to Baker (...) :223–238, 2005; Br J Philos Sci 60:611–633, 2009). Furthermore, the result is then also used to strengthen the platonist position :779–793, 2017a). We pick up the circularity problem brought up by Leng Mathematical reasoning, heuristics and the development of mathematics, King’s College Publications, London, pp 167–189, 2005) and Bangu :13–20, 2008). We will argue that Baker’s attempt to solve this problem fails, if Hume’s Principle is analytic. We will also provide the opponent of the Enhanced Indispensability Argument with the so-called ‘interpretability strategy’, which can be used to come up with alternative explanations in case Hume’s Principle is non-analytic. (shrink)

This essay examines the philosophical significance of $\Omega$-logic in Zermelo-Fraenkel set theory with choice (ZFC). The categorical duality between coalgebra and algebra permits Boolean-valued algebraic models of ZFC to be interpreted as coalgebras. The modal profile of $\Omega$-logical validity can then be countenanced within a coalgebraic logic, and $\Omega$-logical validity can be defined via deterministic automata. I argue that the philosophical significance of the foregoing is two-fold. First, because the epistemic and modal profiles of $\Omega$-logical validity correspond to those of (...) second-order logical consequence, $\Omega$-logical validity is genuinely logical. Second, the foregoing provides a modal account of the interpretation of mathematical vocabulary. (shrink)

In the early 1900s, Russell began to recognize that he, and many other mathematicians, had been using assertions like the Axiom of Choice implicitly, and without explicitly proving them. In working with the Axioms of Choice, Infinity, and Reducibility, and his and Whitehead’s Multiplicative Axiom, Russell came to take the position that some axioms are necessary to recovering certain results of mathematics, but may not be proven to be true absolutely. The essay traces historical roots of, and motivations for, Russell’s (...) method of analysis, which are intended to shed light on his view about the status of mathematical axioms. I describe the position Russell develops in consequence as “immanent logicism,” in contrast to what Irving (1989) describes as “epistemic logicism.” Immanent logicism allows Russell to avoid the logocentric predicament, and to propose a method for discovering structural relationships of dependence within mathematical theories. (shrink)

I was faced with a question I thought I could not answer. -/- What do I know, with certainty? -/- I know with absolute certainty that every thought I have is based on my belief system. My beliefs may change and when they do, my thoughts will be directly related to my belief.

A crucial part of the contemporary interest in logicism in the philosophy of mathematics resides in its idea that arithmetical knowledge may be based on logical knowledge. Here an implementation of this idea is considered that holds that knowledge of arithmetical principles may be based on two things: (i) knowledge of logical principles and (ii) knowledge that the arithmetical principles are representable in the logical principles. The notions of representation considered here are related to theory-based and structure-based notions of representation (...) from contemporary mathematical logic. It is argued that the theory-based versions of such logicism are either too liberal (the plethora problem) or are committed to intuitively incorrect closure conditions (the consistency problem). Structure-based versions must on the other hand respond to a charge of begging the question (the circularity problem) or explain how one may have a knowledge of structure in advance of a knowledge of axioms (the signature problem). This discussion is significant because it gives us a better idea of what a notion of representation must look like if it is to aid in realizing some of the traditional epistemic aims of logicism in the philosophy of mathematics. (shrink)

Contents: Introduction / Naïve Logicism / Restricted Logicism / Metaphysics (Early, Middle, Late) / Knowledge (Early, Middle, Late) / Language (Early, Middle, Late) / The Infinite.

Øystein Linnebo has recently shown that the existence of successors cannot be proven in predicative Frege arithmetic, using Frege’s definitions of arithmetical notions. By contrast, it is shown here that the existence of successor can be proven in ramified predicative Frege arithmetic.

It has been known for a few years that no more than Pi-1-1 comprehension is needed for the proof of "Frege's Theorem". One can at least imagine a view that would regard Pi-1-1 comprehension axioms as logical truths but deny that status to any that are more complex—a view that would, in particular, deny that full second-order logic deserves the name. Such a view would serve the purposes of neo-logicists. It is, in fact, no part of my view that, say, (...) Delta-3-1 comprehension axioms are not logical truths. What I am going to suggest, however, is that there is a special case to be made on behalf of Pi-1-1 comprehension. Making the case involves investigating extensions of first-order logic that do not rely upon the presence of second-order quantifiers. A formal system for so-called "ancestral logic" is developed, and it is then extended to yield what I call "Arché logic". (shrink)

According to Quine, Charles Parsons, Mark Steiner, and others, Russell’s logicist project is important because, if successful, it would show that mathematical theorems possess desirable epistemic properties often attributed to logical theorems, such as aprioricity, necessity, and certainty. Unfortunately, Russell never attributed such importance to logicism, and such a thesis contradicts Russell’s explicitly stated views on the relationship between logic and mathematics. This raises the question: what did Russell understand to be the philosophical importance of logicism? Building on recent work (...) by Andrew Irvine and Martin Godwyn, I argue that Russell thought a systematic reduction of mathematics increases the certainty of known mathematical theorems (even basic arithmetical facts) by showing mathematical knowledge to be coherently organized. The paper outlines Russell’s theory of coherence, and discusses its relevance to logicism and the certainty attributed to mathematics. (shrink)

For over thirty years I have argued that all branches of science and scholarship would have both their intellectual and humanitarian value enhanced if pursued in accordance with the edicts of wisdom-inquiry rather than knowledge-inquiry. I argue that this is true of mathematics. Viewed from the perspective of knowledge-inquiry, mathematics confronts us with two fundamental problems. (1) How can mathematics be held to be a branch of knowledge, in view of the difficulties that view engenders? What could mathematics be knowledge (...) about? (2) How do we distinguish significant from insignificant mathematics? This is a fundamental philosophical problem concerning the nature of mathematics. But it is also a practical problem concerning mathematics itself. In the absence of the solution to the problem, there is the danger that genuinely significant mathematics will be lost among the unchecked growth of a mass of insignificant mathematics. This second problem cannot, it would seem, be solved granted knowledge-inquiry. For, in order to solve the problem, mathematics needs to be related to values, but this is, it seems, prohibited by knowledge-inquiry because it could only lead to the subversion of mathematical rigour. Both problems are solved, however, when mathematics is viewed from the perspective of wisdom-inquiry. (1) Mathematics is not a branch of knowledge. It is a body of systematized, unified and inter-connected problem-solving methods, a body of problematic possibilities. (2) A piece of mathematics is significant if (a) it links up to the interconnected body of existing mathematics, ideally in such a way that some problems difficult to solve in other branches become much easier to solve when translated into the piece of mathematics in question; (b) it has fruitful applications for (other) worthwhile human endeavours. If ever the revolution from knowledge to wisdom occurs, I would hope wisdom mathematics would flourish, the nature of mathematics would become much more transparent, more pupils and students would come to appreciate the fascination of mathematics, and it would be easier to discern what is genuinely significant in mathematics (something that baffled even Einstein). As a result of clarifying what should count as significant, the pursuit of wisdom mathematics might even lead to the development of significant new mathematics. (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)

A central element in neo-Fregean philosophy of mathematics is the focus on abstraction principles, and the use of abstraction principles to ground various areas of mathematics. But as is well known, not all abstraction principles are in good standing. Various proposals for singling out the acceptable abstraction principles have been presented. Here I investigate what philosophical underpinnings can be provided for these proposals; specifically, underpinnings that fit the neo-Fregean's general outlook. Among the philosophical ideas I consider are: general views on (...) a priori justification; the idea of abstraction as reconceptualization, the idea that truth is prior to reference in the sense associated with Frege's context principle; and various broadly relativistic views. The conclusions are by and large negative. (shrink)

This largely expository lecture deals with aspects of traditional solid geometry suitable for applications in logic courses. Polygons are plane or two-dimensional; the simplest are triangles. Polyhedra [or polyhedrons] are solid or three-dimensional; the simplest are tetrahedra [or triangular pyramids, made of four triangles]. -/- A regular polygon has equal sides and equal angles. A polyhedron having congruent faces and congruent [polyhedral] angles is not called regular, as some might expect; rather they are said to be subregular—a word coined for (...) this lecture. To repeat, a subregular polyhedron has congruent faces and congruent [polyhedral] angles. A subregular polyhedron whose faces are all regular polygons is regular—using standard terminology. -/- Geometers before Euclid showed that there are “essentially” only five regular polyhedra: every regular polyhedron is a tetrahedron (4 faces), a hexahedron or cube (6 faces), an octahedron (8 faces), a dodecahedron (12 faces), or an icosahedron (20 faces). -/- The first question is whether there are subregular polyhedra that are not regular. For example, are there tetrahedra having congruent angles and congruent triangular faces but whose faces are not equilateral triangles? -/- Another question is the classification of subregular polyhedra if they exist. For example, considering the fact that the regular tetrahedra all have equilateral triangles as faces, we ask which triangles other than equilaterals are faces of subregular tetrahedra. Similarly, considering the fact that the regular hexahedra all have squares as faces, we ask which quadrangles other than squares are faces of subregular hexahedra. -/- After introductory remarks that include historical and philosophical points, we concentrate on tetrahedra. A triangle that is congruent to each of the four faces of a tetrahedron is called a generator of the tetrahedron. The main result proved is that every acute triangle is a generator of a subregular tetrahedron. The proof includes an algorithm –implementable with scissors and paper –that constructs from any given acute triangle a subregular tetrahedron whose faces are congruent to the given triangle. -/- Algorithm: Given any acute triangle. Construct a similar triangle whose sides are double the sides of the given triangle. Draw the three lines connecting the three midpoints of the sides (making four triangles congruent to the given triangle—a central triangle surrounded by three peripheral triangles). Make three “hinges” along the lines connecting the midpoints. “Fold” the peripheral triangles together (into a tetrahedron). [LIGHTLY EDITED VERSION OF PRINTED ABSTRACT] Acknowledgements: William Lawvere, Colin McLarty, Irvin Miller, Frango Nabrasa, Lawrence Spector, Roberto Torretti, and Richard Vesley. -/- . (shrink)

In this work I study the main tenets of the logicist philosophy of mathematics. I deal, basically, with two problems: (1) To what extent can one dispense with intuition in mathematics? (2) What is the appropriate logic for the purposes of logicism? By means of my considerations I try to determine the pros and cons of logicism. My standpoint favors the logicist line of thought. -/- .

Neo-logicism uses definitions and Hume's Principle to derive arithmetic in second-order logic. This paper investigates how much arithmetic can be derived using definitions alone, without any additional principle such as Hume's.