35 ideas
17749 | Post proved the consistency of propositional logic in 1921 [Walicki] |
Full Idea: A proof of the consistency of propositional logic was given by Emil Post in 1921. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], History E.2.1) |
17765 | Propositional language can only relate statements as the same or as different [Walicki] |
Full Idea: Propositional language is very rudimentary and has limited powers of expression. The only relation between various statements it can handle is that of identity and difference. As are all the same, but Bs can be different from As. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 7 Intro) | |
A reaction: [second sentence a paraphrase] In predicate logic you could represent two statements as being the same except for one element (an object or predicate or relation or quantifier). |
17764 | Boolean connectives are interpreted as functions on the set {1,0} [Walicki] |
Full Idea: Boolean connectives are interpreted as functions on the set {1,0}. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 5.1) | |
A reaction: 1 and 0 are normally taken to be true (T) and false (F). Thus the functions output various combinations of true and false, which are truth tables. |
17752 | The empty set is useful for defining sets by properties, when the members are not yet known [Walicki] |
Full Idea: The empty set is mainly a mathematical convenience - defining a set by describing the properties of its members in an involved way, we may not know from the very beginning what its members are. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 1.1) |
17753 | The empty set avoids having to take special precautions in case members vanish [Walicki] |
Full Idea: Without the assumption of the empty set, one would often have to take special precautions for the case where a set happened to contain no elements. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 1.1) | |
A reaction: Compare the introduction of the concept 'zero', where special precautions are therefore required. ...But other special precautions are needed without zero. Either he pays us, or we pay him, or ...er. Intersecting sets need the empty set. |
17759 | Ordinals play the central role in set theory, providing the model of well-ordering [Walicki] |
Full Idea: Ordinals play the central role in set theory, providing the paradigmatic well-orderings. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3) | |
A reaction: When you draw the big V of the iterative hierarchy of sets (built from successive power sets), the ordinals are marked as a single line up the middle, one ordinal for each level. |
17741 | To determine the patterns in logic, one must identify its 'building blocks' [Walicki] |
Full Idea: In order to construct precise and valid patterns of arguments one has to determine their 'building blocks'. One has to identify the basic terms, their kinds and means of combination. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], History Intro) | |
A reaction: A deceptively simple and important idea. All explanation requires patterns and levels, and it is the idea of building blocks which makes such things possible. It is right at the centre of our grasp of everything. |
8729 | Intuitionists deny excluded middle, because it is committed to transcendent truth or objects [Shapiro] |
Full Idea: Intuitionists in mathematics deny excluded middle, because it is symptomatic of faith in the transcendent existence of mathematical objects and/or the truth of mathematical statements. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 1.2) | |
A reaction: There are other problems with excluded middle, such as vagueness, but on the whole I, as a card-carrying 'realist', am committed to the law of excluded middle. |
17747 | A 'model' of a theory specifies interpreting a language in a domain to make all theorems true [Walicki] |
Full Idea: A specification of a domain of objects, and of the rules for interpreting the symbols of a logical language in this domain such that all the theorems of the logical theory are true is said to be a 'model' of the theory. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], History E.1.3) | |
A reaction: The basic ideas of this emerged 1915-30, but it needed Tarski's account of truth to really get it going. |
17748 | The L-S Theorem says no theory (even of reals) says more than a natural number theory [Walicki] |
Full Idea: The L-S Theorem is ...a shocking result, since it implies that any consistent formal theory of everything - even about biology, physics, sets or the real numbers - can just as well be understood as being about natural numbers. It says nothing more. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], History E.2) | |
A reaction: Illuminating. Particularly the point that no theory about the real numbers can say anything more than a theory about the natural numbers. So the natural numbers contain all the truths we can ever express? Eh????? |
17761 | A compact axiomatisation makes it possible to understand a field as a whole [Walicki] |
Full Idea: Having such a compact [axiomatic] presentation of a complicated field [such as Euclid's], makes it possible to relate not only to particular theorems but also to the whole field as such. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 4.1) |
17763 | Axiomatic systems are purely syntactic, and do not presuppose any interpretation [Walicki] |
Full Idea: Axiomatic systems, their primitive terms and proofs, are purely syntactic, that is, do not presuppose any interpretation. ...[142] They never address the world directly, but address a possible semantic model which formally represents the world. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 4.1) |
8763 | The number 3 is presumably identical as a natural, an integer, a rational, a real, and complex [Shapiro] |
Full Idea: It is surely wise to identify the positions in the natural numbers structure with their counterparts in the integer, rational, real and complex number structures. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 10.2) | |
A reaction: The point is that this might be denied, since 3, 3/1, 3.00.., and -3*i^2 are all arrived at by different methods of construction. Natural 3 has a predecessor, but real 3 doesn't. I agree, intuitively, with Shapiro. Russell (1919) disagreed. |
17757 | Members of ordinals are ordinals, and also subsets of ordinals [Walicki] |
Full Idea: Every member of an ordinal is itself an ordinal, and every ordinal is a transitive set (its members are also its subsets; a member of a member of an ordinal is also a member of the ordinal). | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3) |
17755 | Ordinals are the empty set, union with the singleton, and any arbitrary union of ordinals [Walicki] |
Full Idea: The collection of ordinals is defined inductively: Basis: the empty set is an ordinal; Ind: for an ordinal x, the union with its singleton is also an ordinal; and any arbitrary (possibly infinite) union of ordinals is an ordinal. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3) | |
A reaction: [symbolism translated into English] Walicki says they are called 'ordinal numbers', but are in fact a set. |
17756 | The union of finite ordinals is the first 'limit ordinal'; 2ω is the second... [Walicki] |
Full Idea: We can form infinite ordinals by taking unions of ordinals. We can thus form 'limit ordinals', which have no immediate predecessor. ω is the first (the union of all finite ordinals), ω + ω = sω is second, 3ω the third.... | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3) |
17760 | Two infinite ordinals can represent a single infinite cardinal [Walicki] |
Full Idea: There may be several ordinals for the same cardinality. ...Two ordinals can represent different ways of well-ordering the same number (aleph-0) of elements. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3) | |
A reaction: This only applies to infinite ordinals and cardinals. For the finite, the two coincide. In infinite arithmetic the rules are different. |
17758 | Ordinals are transitive sets of transitive sets; or transitive sets totally ordered by inclusion [Walicki] |
Full Idea: An ordinal can be defined as a transitive set of transitive sets, or else, as a transitive set totally ordered by set inclusion. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.3) |
18249 | Cauchy gave a formal definition of a converging sequence. [Shapiro] |
Full Idea: A sequence a1,a2,... of rational numbers is 'Cauchy' if for each rational number ε>0 there is a natural number N such that for all natural numbers m, n, if m>N and n>N then -ε < am - an < ε. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 7.2 n4) | |
A reaction: The sequence is 'Cauchy' if N exists. |
8764 | Categories are the best foundation for mathematics [Shapiro] |
Full Idea: There is a dedicated contingent who hold that the category of 'categories' is the proper foundation for mathematics. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 10.3 n7) | |
A reaction: He cites Lawvere (1966) and McLarty (1993), the latter presenting the view as a form of structuralism. I would say that the concept of a category will need further explication, and probably reduce to either sets or relations or properties. |
17762 | In non-Euclidean geometry, all Euclidean theorems are valid that avoid the fifth postulate [Walicki] |
Full Idea: Since non-Euclidean geometry preserves all Euclid's postulates except the fifth one, all the theorems derived without the use of the fifth postulate remain valid. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 4.1) |
17754 | Inductive proof depends on the choice of the ordering [Walicki] |
Full Idea: Inductive proof is not guaranteed to work in all cases and, particularly, it depends heavily on the choice of the ordering. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], 2.1.1) | |
A reaction: There has to be an well-founded ordering for inductive proofs to be possible. |
8762 | Two definitions of 3 in terms of sets disagree over whether 1 is a member of 3 [Shapiro] |
Full Idea: Zermelo said that for each number n, its successor is the singleton of n, so 3 is {{{null}}}, and 1 is not a member of 3. Von Neumann said each number n is the set of numbers less than n, so 3 is {null,{null},{null,{null}}}, and 1 is a member of 3. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 10.2) | |
A reaction: See Idea 645 - Zermelo could save Plato from the criticisms of Aristotle! These two accounts are cited by opponents of the set-theoretical account of numbers, because it seems impossible to arbitrate between them. |
8760 | Numbers do not exist independently; the essence of a number is its relations to other numbers [Shapiro] |
Full Idea: The structuralist vigorously rejects any sort of ontological independence among the natural numbers; the essence of a natural number is its relations to other natural numbers. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 10.1) | |
A reaction: This seems to place the emphasis on ordinals (what order?) rather than on cardinality (how many?). I am strongly inclined to think that this is the correct view, though you can't really have relations if there is nothing to relate. |
8761 | A 'system' is related objects; a 'pattern' or 'structure' abstracts the pure relations from them [Shapiro] |
Full Idea: A 'system' is a collection of objects with certain relations among them; a 'pattern' or 'structure' is the abstract form of a system, highlighting the interrelationships and ignoring any features they do not affect how they relate to other objects. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 10.1) | |
A reaction: Note that 'ignoring' features is a psychological account of abstraction, which (thanks to Frege and Geach) is supposed to be taboo - but which I suspect is actually indispensable in any proper account of thought and concepts. |
8744 | Logicism seems to be a non-starter if (as is widely held) logic has no ontology of its own [Shapiro] |
Full Idea: The thesis that principles of arithmetic are derivable from the laws of logic runs against a now common view that logic itself has no ontology. There are no particular logical objects. From this perspective logicism is a non-starter. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 5.1) | |
A reaction: This criticism strikes me as utterly devastating. There are two routes to go: prove that logic does have an ontology of objects (what would they be?), or - better - deny that arithmetic contains any 'objects'. Or give up logicism. |
8749 | Term Formalism says mathematics is just about symbols - but real numbers have no names [Shapiro] |
Full Idea: Term Formalism is the view that mathematics is just about characters or symbols - the systems of numerals and other linguistic forms. ...This will cover integers and rational numbers, but what are real numbers supposed to be, if they lack names? | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 6.1.1) | |
A reaction: Real numbers (such as pi and root-2) have infinite decimal expansions, so we can start naming those. We could also start giving names like 'Harry' to other reals, though it might take a while. OK, I give up. |
8750 | Game Formalism is just a matter of rules, like chess - but then why is it useful in science? [Shapiro] |
Full Idea: Game Formalism likens mathematics to chess, where the 'content' of mathematics is exhausted by the rules of operating with its language. ...This, however, leaves the problem of why the mathematical games are so useful to the sciences. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 6.1.2) | |
A reaction: This thought pushes us towards structuralism. It could still be a game, but one we learned from observing nature, which plays its own games. Chess is, after all, modelled on warfare. |
8752 | Deductivism says mathematics is logical consequences of uninterpreted axioms [Shapiro] |
Full Idea: The Deductivist version of formalism (sometimes called 'if-thenism') says that the practice of mathematics consists of determining logical consequences of otherwise uninterpreted axioms. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 6.2) | |
A reaction: [Hilbert is the source] More plausible than Term or Game Formalism (qv). It still leaves the question of why it seems applicable to nature, and why those particular axioms might be chosen. In some sense, though, it is obviously right. |
8753 | Critics resent the way intuitionism cripples mathematics, but it allows new important distinctions [Shapiro] |
Full Idea: Critics commonly complain that the intuitionist restrictions cripple the mathematician. On the other hand, intuitionist mathematics allows for many potentially important distinctions not available in classical mathematics, and is often more subtle. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 7.1) | |
A reaction: The main way in which it cripples is its restriction on talk of infinity ('Cantor's heaven'), which was resented by Hilbert. Since high-level infinities are interesting, it would be odd if we were not allowed to discuss them. |
8731 | Conceptualist are just realists or idealist or nominalists, depending on their view of concepts [Shapiro] |
Full Idea: I classify conceptualists according to what they say about properties or concepts. If someone classified properties as existing independent of language I would classify her as a realist in ontology of mathematics. Or they may be idealists or nominalists. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 2.2.1) | |
A reaction: In other words, Shapiro wants to eliminate 'conceptualist' as a useful label in philosophy of mathematics. He's probably right. All thought involves concepts, but that doesn't produce a conceptualist theory of, say, football. |
8730 | 'Impredicative' definitions refer to the thing being described [Shapiro] |
Full Idea: A definition of a mathematical entity is 'impredicative' if it refers to a collection that contains the defined entity. The definition of 'least upper bound' is impredicative as it refers to upper bounds and characterizes a member of this set. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 1.2) | |
A reaction: The big question is whether mathematics can live with impredicative definitions, or whether they threaten to be viciously circular, and undermine the whole enterprise. |
17742 | Scotus based modality on semantic consistency, instead of on what the future could allow [Walicki] |
Full Idea: The link between time and modality was severed by Duns Scotus, who proposed a notion of possibility based purely on the notion of semantic consistency. 'Possible' means for him logically possible, that is, not involving contradiction. | |
From: Michal Walicki (Introduction to Mathematical Logic [2012], History B.4) |
8725 | Rationalism tries to apply mathematical methodology to all of knowledge [Shapiro] |
Full Idea: Rationalism is a long-standing school that can be characterized as an attempt to extend the perceived methodology of mathematics to all of knowledge. | |
From: Stewart Shapiro (Thinking About Mathematics [2000], 1.1) | |
A reaction: Sometimes called 'Descartes's Dream', or the 'Enlightenment Project', the dream of proving everything. Within maths, Hilbert's Programme aimed for the same certainty. Idea 22 is the motto for the opposition to this approach. |
6027 | From the fact that some men die, we cannot infer that they all do [Philodemus] |
Full Idea: There is no necessary inference, from the fact that men familiar to us die when pierced through the heart, that all men do. | |
From: Philodemus (On Signs (damaged) [c.50 BCE], 1.3) | |
A reaction: This is scepticism about the logic of induction, long before David Hume. This is said to be a Stoic argument against Epicureans - though on the whole Stoics are not keen on scepticism. |