77 ideas
| 13466 | We are all post-Kantians, because he set the current agenda for philosophy [Hart,WD] |
| Full Idea: We are all post-Kantians, ...because Kant set an agenda for philosophy that we are still working through. | |
| From: William D. Hart (The Evolution of Logic [2010], 2) | |
| A reaction: Hart says that the main agenda is set by Kant's desire to defend the principle of sufficient reason against Hume's attack on causation. I would take it more generally to be the assessment of metaphysics, and of a priori knowledge. |
| 13477 | The problems are the monuments of philosophy [Hart,WD] |
| Full Idea: The real monuments of philosophy are its problems. | |
| From: William D. Hart (The Evolution of Logic [2010], 2) | |
| A reaction: Presumably he means '....rather than its solutions'. No other subject would be very happy with that sort of claim. Compare Idea 8243. A complaint against analytic philosophy is that it has achieved no consensus at all. |
| 13515 | To study abstract problems, some knowledge of set theory is essential [Hart,WD] |
| Full Idea: By now, no education in abstract pursuits is adequate without some familiarity with sets. | |
| From: William D. Hart (The Evolution of Logic [2010], 10) | |
| A reaction: A heart-sinking observation for those who aspire to study metaphysics and modality. The question is, what will count as 'some' familiarity? Are only professional logicians now allowed to be proper philosophers? |
| 17774 | Definitions make our intuitions mathematically useful [Mayberry] |
| Full Idea: Definition provides us with the means for converting our intuitions into mathematically usable concepts. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-1) |
| 17773 | Proof shows that it is true, but also why it must be true [Mayberry] |
| Full Idea: When you have proved something you know not only that it is true, but why it must be true. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-2) | |
| A reaction: Note the word 'must'. Presumably both the grounding and the necessitation of the truth are revealed. |
| 13469 | Tarski showed how we could have a correspondence theory of truth, without using 'facts' [Hart,WD] |
| Full Idea: It is an ancient and honourable view that truth is correspondence to fact; Tarski showed us how to do without facts here. | |
| From: William D. Hart (The Evolution of Logic [2010], 2) | |
| A reaction: This is a very interesting spin on Tarski, who certainly seems to endorse the correspondence theory, even while apparently inventing a new 'semantic' theory of truth. It is controversial how far Tarski's theory really is a 'correspondence' theory. |
| 13504 | Truth for sentences is satisfaction of formulae; for sentences, either all sequences satisfy it (true) or none do [Hart,WD] |
| Full Idea: We explain truth for sentences in terms of satisfaction of formulae. The crux here is that for a sentence, either all sequences satisfy it or none do (with no middle ground). For formulae, some sequences may satisfy it and others not. | |
| From: William D. Hart (The Evolution of Logic [2010], 4) | |
| A reaction: This is the hardest part of Tarski's theory of truth to grasp. |
| 13503 | A first-order language has an infinity of T-sentences, which cannot add up to a definition of truth [Hart,WD] |
| Full Idea: In any first-order language, there are infinitely many T-sentences. Since definitions should be finite, the agglomeration of all the T-sentences is not a definition of truth. | |
| From: William D. Hart (The Evolution of Logic [2010], 4) | |
| A reaction: This may be a warning shot aimed at Davidson's extensive use of Tarski's formal account in his own views on meaning in natural language. |
| 13500 | Conditional Proof: infer a conditional, if the consequent can be deduced from the antecedent [Hart,WD] |
| Full Idea: A 'conditional proof' licenses inferences to a conditional from a deduction of its consequent from its antecedent. | |
| From: William D. Hart (The Evolution of Logic [2010], 4) | |
| A reaction: That is, a proof can be enshrined in an arrow. |
| 13502 | ∃y... is read as 'There exists an individual, call it y, such that...', and not 'There exists a y such that...' [Hart,WD] |
| Full Idea: When a quantifier is attached to a variable, as in '∃(y)....', then it should be read as 'There exists an individual, call it y, such that....'. One should not read it as 'There exists a y such that...', which would attach predicate to quantifier. | |
| From: William D. Hart (The Evolution of Logic [2010], 4) | |
| A reaction: The point is to make clear that in classical logic the predicates attach to the objects, and not to some formal component like a quantifier. |
| 13456 | Set theory articulates the concept of order (through relations) [Hart,WD] |
| Full Idea: It is set theory, and more specifically the theory of relations, that articulates order. | |
| From: William D. Hart (The Evolution of Logic [2010]) | |
| A reaction: It would seem that we mainly need set theory in order to talk accurately about order, and about infinity. The two come together in the study of the ordinal numbers. |
| 13497 | Nowadays ZFC and NBG are the set theories; types are dead, and NF is only useful for the whole universe [Hart,WD] |
| Full Idea: The theory of types is a thing of the past. There is now nothing to choose between ZFC and NBG (Neumann-Bernays-Gödel). NF (Quine's) is a more specialized taste, but is a place to look if you want the universe. | |
| From: William D. Hart (The Evolution of Logic [2010], 3) |
| 13443 | ∈ relates across layers, while ⊆ relates within layers [Hart,WD] |
| Full Idea: ∈ relates across layers (Plato is a member of his unit set and the set of people), while ⊆ relates within layers (the singleton of Plato is a subset of the set of people). This distinction only became clear in the 19th century. | |
| From: William D. Hart (The Evolution of Logic [2010], 1) | |
| A reaction: Getting these two clear may be the most important distinction needed to understand how set theory works. |
| 13442 | Without the empty set we could not form a∩b without checking that a and b meet [Hart,WD] |
| Full Idea: Without the empty set, disjoint sets would have no intersection, and we could not form a∩b without checking that a and b meet. This is an example of the utility of the empty set. | |
| From: William D. Hart (The Evolution of Logic [2010], 1) | |
| A reaction: A novice might plausibly ask why there should be an intersection for every pair of sets, if they have nothing in common except for containing this little puff of nothingness. But then what do novices know? |
| 17795 | Set theory can't be axiomatic, because it is needed to express the very notion of axiomatisation [Mayberry] |
| Full Idea: Set theory cannot be an axiomatic theory, because the very notion of an axiomatic theory makes no sense without it. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.413-2) | |
| A reaction: This will come as a surprise to Penelope Maddy, who battles with ways to accept the set theory axioms as the foundation of mathematics. Mayberry says that the basic set theory required is much more simple and intuitive. |
| 17796 | There is a semi-categorical axiomatisation of set-theory [Mayberry] |
| Full Idea: We can give a semi-categorical axiomatisation of set-theory (all that remains undetermined is the size of the set of urelements and the length of the sequence of ordinals). The system is second-order in formalisation. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.413-2) | |
| A reaction: I gather this means the models may not be isomorphic to one another (because they differ in size), but can be shown to isomorphic to some third ingredient. I think. Mayberry says this shows there is no such thing as non-Cantorian set theory. |
| 17800 | The misnamed Axiom of Infinity says the natural numbers are finite in size [Mayberry] |
| Full Idea: The (misnamed!) Axiom of Infinity expresses Cantor's fundamental assumption that the species of natural numbers is finite in size. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2) |
| 13493 | In the modern view, foundation is the heart of the way to do set theory [Hart,WD] |
| Full Idea: In the second half of the twentieth century there emerged the opinion that foundation is the heart of the way to do set theory. | |
| From: William D. Hart (The Evolution of Logic [2010], 3) | |
| A reaction: It is foundation which is the central axiom of the iterative conception of sets, where each level of sets is built on previous levels, and they are all 'well-founded'. |
| 13495 | Foundation Axiom: an nonempty set has a member disjoint from it [Hart,WD] |
| Full Idea: The usual statement of Foundation is that any nonempty set has a member disjoint from it. This phrasing is ordinal-free and closer to the primitives of ZFC. | |
| From: William D. Hart (The Evolution of Logic [2010], 3) |
| 13461 | We can choose from finite and evident sets, but not from infinite opaque ones [Hart,WD] |
| Full Idea: When a set is finite, we can prove it has a choice function (∀x x∈A → f(x)∈A), but we need an axiom when A is infinite and the members opaque. From infinite shoes we can pick a left one, but from socks we need the axiom of choice. | |
| From: William D. Hart (The Evolution of Logic [2010], 1) | |
| A reaction: The socks example in from Russell 1919:126. |
| 13462 | With the Axiom of Choice every set can be well-ordered [Hart,WD] |
| Full Idea: It follows from the Axiom of Choice that every set can be well-ordered. | |
| From: William D. Hart (The Evolution of Logic [2010], 1) | |
| A reaction: For 'well-ordered' see Idea 13460. Every set can be ordered with a least member. |
| 13516 | If we accept that V=L, it seems to settle all the open questions of set theory [Hart,WD] |
| Full Idea: It has been said (by Burt Dreben) that the only reason set theorists do not generally buy the view that V = L is that it would put them out of business by settling their open questions. | |
| From: William D. Hart (The Evolution of Logic [2010], 10) | |
| A reaction: Hart says V=L breaks with the interative conception of sets at level ω+1, which is countable is the constructible view, but has continuum many in the cumulative (iterative) hierarch. The constructible V=L view is anti-platonist. |
| 13441 | Naïve set theory has trouble with comprehension, the claim that every predicate has an extension [Hart,WD] |
| Full Idea: 'Comprehension' is the assumption that every predicate has an extension. Naïve set theory is the theory whose axioms are extensionality and comprehension, and comprehension is thought to be its naivety. | |
| From: William D. Hart (The Evolution of Logic [2010], 1) | |
| A reaction: This doesn't, of course, mean that there couldn't be a more modest version of comprehension. The notorious difficulty come with the discovery of self-referring predicates which can't possibly have extensions. |
| 17801 | The set hierarchy doesn't rely on the dubious notion of 'generating' them [Mayberry] |
| Full Idea: The idea of 'generating' sets is only a metaphor - the existence of the hierarchy is established without appealing to such dubious notions. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2) | |
| A reaction: Presumably there can be a 'dependence' or 'determination' relation which does not involve actual generation. |
| 13494 | The iterative conception may not be necessary, and may have fixed points or infinitely descending chains [Hart,WD] |
| Full Idea: That the iterative sets suffice for most of ZFC does not show they are necessary, nor is it evident that the set of operations has no fixed points (as 0 is a fixed point for square-of), and no infinitely descending chains (like negative integers). | |
| From: William D. Hart (The Evolution of Logic [2010], 3) | |
| A reaction: People don't seem to worry that they aren't 'necessary', and further measures are possible to block infinitely descending chains. |
| 17803 | Limitation of size is part of the very conception of a set [Mayberry] |
| Full Idea: Our very notion of a set is that of an extensional plurality limited in size. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.415-2) |
| 13457 | A 'partial ordering' is irreflexive and transitive; the sets are ordered, but not the subsets [Hart,WD] |
| Full Idea: We say that a binary relation R 'partially orders' a field A just in case R is irreflexive (so that nothing bears R to itself) and transitive. When the set is {a,b}, its subsets {a} and {b} are incomparable in a partial ordering. | |
| From: William D. Hart (The Evolution of Logic [2010], 1) |
| 13458 | A partial ordering becomes 'total' if any two members of its field are comparable [Hart,WD] |
| Full Idea: A partial ordering is a 'total ordering' just in case any two members of its field are comparable, that is, either a is R to b, or b is R to a, or a is b. | |
| From: William D. Hart (The Evolution of Logic [2010], 1) | |
| A reaction: See Idea 13457 for 'partial ordering'. The three conditions are known as the 'trichotomy' condition. |
| 13460 | 'Well-ordering' must have a least member, so it does the natural numbers but not the integers [Hart,WD] |
| Full Idea: A total order 'well-orders' its field just in case any nonempty subset B of its field has an R-least member, that is, there is a b in B such that for any a in B different from b, b bears R to a. So less-than well-orders natural numbers, but not integers. | |
| From: William D. Hart (The Evolution of Logic [2010], 1) | |
| A reaction: The natural numbers have a starting point, but the integers are infinite in both directions. In plain English, an order is 'well-ordered' if there is a starting point. |
| 13490 | Von Neumann defines α<β as α∈β [Hart,WD] |
| Full Idea: One of the glories of Von Neumann's theory of numbers is to define α < β to mean that α ∈ β. | |
| From: William D. Hart (The Evolution of Logic [2010], 3) |
| 13481 | Maybe sets should be rethought in terms of the even more basic categories [Hart,WD] |
| Full Idea: Some have claimed that sets should be rethought in terms of still more basic things, categories. | |
| From: William D. Hart (The Evolution of Logic [2010], 2) | |
| A reaction: [He cites F.William Lawvere 1966] It appears to the the context of foundations for mathematics that he has in mind. |
| 17786 | The mainstream of modern logic sees it as a branch of mathematics [Mayberry] |
| Full Idea: In the mainstream tradition of modern logic, beginning with Boole, Peirce and Schröder, descending through Löwenheim and Skolem to reach maturity with Tarski and his school ...saw logic as a branch of mathematics. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.410-1) | |
| A reaction: [The lesser tradition, of Frege and Russell, says mathematics is a branch of logic]. Mayberry says the Fregean tradition 'has almost died out'. |
| 17788 | First-order logic only has its main theorems because it is so weak [Mayberry] |
| Full Idea: First-order logic is very weak, but therein lies its strength. Its principle tools (Compactness, Completeness, Löwenheim-Skolem Theorems) can be established only because it is too weak to axiomatize either arithmetic or analysis. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.411-2) | |
| A reaction: He adds the proviso that this is 'unless we are dealing with structures on whose size we have placed an explicit, finite bound' (p.412-1). |
| 17791 | Only second-order logic can capture mathematical structure up to isomorphism [Mayberry] |
| Full Idea: Second-order logic is a powerful tool of definition: by means of it alone we can capture mathematical structure up to isomorphism using simple axiom systems. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 17787 | Big logic has one fixed domain, but standard logic has a domain for each interpretation [Mayberry] |
| Full Idea: The 'logica magna' [of the Fregean tradition] has quantifiers ranging over a fixed domain, namely everything there is. In the Boolean tradition the domains differ from interpretation to interpretation. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.410-2) | |
| A reaction: Modal logic displays both approaches, with different systems for global and local domains. |
| 13506 | The universal quantifier can't really mean 'all', because there is no universal set [Hart,WD] |
| Full Idea: All the main set theories deny that there is a set of which everything is a member. No interpretation has a domain with everything in it. So the universal quantifier never gets to mean everything all at once; 'all' does not mean all. | |
| From: William D. Hart (The Evolution of Logic [2010], 4) | |
| A reaction: Could you have an 'uncompleted' universal set, in the spirit of uncompleted infinities? In ordinary English we can talk about 'absolutely everything' - we just can't define a set of everything. Must we 'define' our domain? |
| 13512 | Modern model theory begins with the proof of Los's Conjecture in 1962 [Hart,WD] |
| Full Idea: The beginning of modern model theory was when Morley proved Los's Conjecture in 1962 - that a complete theory in a countable language categorical in one uncountable cardinal is categorical in all. | |
| From: William D. Hart (The Evolution of Logic [2010], 9) |
| 13505 | Model theory studies how set theory can model sets of sentences [Hart,WD] |
| Full Idea: Modern model theory investigates which set theoretic structures are models for which collections of sentences. | |
| From: William D. Hart (The Evolution of Logic [2010], 4) | |
| A reaction: So first you must choose your set theory (see Idea 13497). Then you presumably look at how to formalise sentences, and then look at the really tricky ones, many of which will involve various degrees of infinity. |
| 13511 | Model theory is mostly confined to first-order theories [Hart,WD] |
| Full Idea: There is no developed methematics of models for second-order theories, so for the most part, model theory is about models for first-order theories. | |
| From: William D. Hart (The Evolution of Logic [2010], 9) |
| 13513 | Models are ways the world might be from a first-order point of view [Hart,WD] |
| Full Idea: Models are ways the world might be from a first-order point of view. | |
| From: William D. Hart (The Evolution of Logic [2010], 9) |
| 17790 | No Löwenheim-Skolem logic can axiomatise real analysis [Mayberry] |
| Full Idea: No logic which can axiomatize real analysis can have the Löwenheim-Skolem property. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 17779 | 'Classificatory' axioms aim at revealing similarity in morphology of structures [Mayberry] |
| Full Idea: The purpose of a 'classificatory' axiomatic theory is to single out an otherwise disparate species of structures by fixing certain features of morphology. ...The aim is to single out common features. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.406-2) |
| 17778 | Axiomatiation relies on isomorphic structures being essentially the same [Mayberry] |
| Full Idea: The central dogma of the axiomatic method is this: isomorphic structures are mathematically indistinguishable in their essential properties. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.406-2) | |
| A reaction: Hence it is not that we have to settle for the success of a system 'up to isomorphism', since that was the original aim. The structures must differ in their non-essential properties, or they would be the same system. |
| 17780 | 'Eliminatory' axioms get rid of traditional ideal and abstract objects [Mayberry] |
| Full Idea: The purpose of what I am calling 'eliminatory' axiomatic theories is precisely to eliminate from mathematics those peculiar ideal and abstract objects that, on the traditional view, constitute its subject matter. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.407-1) | |
| A reaction: A very interesting idea. I have a natural antipathy to 'abstract objects', because they really mess up what could otherwise be a very tidy ontology. What he describes might be better called 'ignoring' axioms. The objects may 'exist', but who cares? |
| 17789 | No logic which can axiomatise arithmetic can be compact or complete [Mayberry] |
| Full Idea: No logic which can axiomatise arithmetic can be compact or complete. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) | |
| A reaction: I take this to be because there are new truths in the transfinite level (as well as the problem of incompleteness). |
| 13496 | First-order logic is 'compact': consequences of a set are consequences of a finite subset [Hart,WD] |
| Full Idea: First-order logic is 'compact', which means that any logical consequence of a set (finite or infinite) of first-order sentences is a logical consequence of a finite subset of those sentences. | |
| From: William D. Hart (The Evolution of Logic [2010], 3) |
| 13484 | Berry's Paradox: we succeed in referring to a number, with a term which says we can't do that [Hart,WD] |
| Full Idea: Berry's Paradox: by the least number principle 'the least number denoted by no description of fewer than 79 letters' exists, but we just referred to it using a description of 77 letters. | |
| From: William D. Hart (The Evolution of Logic [2010], 3) | |
| A reaction: I struggle with this. If I refer to 'an object to which no human being could possibly refer', have I just referred to something? Graham Priest likes this sort of idea. |
| 13482 | The Burali-Forti paradox is a crisis for Cantor's ordinals [Hart,WD] |
| Full Idea: The Burali-Forti Paradox was a crisis for Cantor's theory of ordinal numbers. | |
| From: William D. Hart (The Evolution of Logic [2010], 3) |
| 13507 | The machinery used to solve the Liar can be rejigged to produce a new Liar [Hart,WD] |
| Full Idea: In effect, the machinery introduced to solve the liar can always be rejigged to yield another version the liar. | |
| From: William D. Hart (The Evolution of Logic [2010], 4) | |
| A reaction: [He cites Hans Herzberger 1980-81] The machinery is Tarski's device of only talking about sentences of a language by using a 'metalanguage'. |
| 13459 | The less-than relation < well-orders, and partially orders, and totally orders the ordinal numbers [Hart,WD] |
| Full Idea: We can show (using the axiom of choice) that the less-than relation, <, well-orders the ordinals, ...and that it partially orders the ordinals, ...and that it totally orders the ordinals. | |
| From: William D. Hart (The Evolution of Logic [2010], 1) |
| 13491 | The axiom of infinity with separation gives a least limit ordinal ω [Hart,WD] |
| Full Idea: The axiom of infinity with separation yields a least limit ordinal, which is called ω. | |
| From: William D. Hart (The Evolution of Logic [2010], 3) |
| 13463 | There are at least as many infinite cardinals as transfinite ordinals (because they will map) [Hart,WD] |
| Full Idea: Since we can map the transfinite ordinals one-one into the infinite cardinals, there are at least as many infinite cardinals as transfinite ordinals. | |
| From: William D. Hart (The Evolution of Logic [2010], 1) |
| 13492 | Von Neumann's ordinals generalise into the transfinite better, because Zermelo's ω is a singleton [Hart,WD] |
| Full Idea: It is easier to generalize von Neumann's finite ordinals into the transfinite. All Zermelo's nonzero finite ordinals are singletons, but if ω were a singleton it is hard to see how if could fail to be the successor of its member and so not a limit. | |
| From: William D. Hart (The Evolution of Logic [2010], 3) |
| 13446 | 19th century arithmetization of analysis isolated the real numbers from geometry [Hart,WD] |
| Full Idea: The real numbers were not isolated from geometry until the arithmetization of analysis during the nineteenth century. | |
| From: William D. Hart (The Evolution of Logic [2010], 1) |
| 17784 | Real numbers can be eliminated, by axiom systems for complete ordered fields [Mayberry] |
| Full Idea: We eliminate the real numbers by giving an axiomatic definition of the species of complete ordered fields. These axioms are categorical (mutually isomorphic), and thus are mathematically indistinguishable. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.408-2) | |
| A reaction: Hence my clever mathematical friend says that it is a terrible misunderstanding to think that mathematics is about numbers. Mayberry says the reals are one ordered field, but mathematics now studies all ordered fields together. |
| 17782 | Greek quantities were concrete, and ratio and proportion were their science [Mayberry] |
| Full Idea: Quantities for Greeks were concrete things - lines, surfaces, solids, times, weights. At the centre of their science of quantity was the beautiful theory of ratio and proportion (...in which the notion of number does not appear!). | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.407-2) | |
| A reaction: [He credits Eudoxus, and cites Book V of Euclid] |
| 17781 | Real numbers were invented, as objects, to simplify and generalise 'quantity' [Mayberry] |
| Full Idea: The abstract objects of modern mathematics, the real numbers, were invented by the mathematicians of the seventeenth century in order to simplify and to generalize the Greek science of quantity. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.407-2) |
| 17799 | Cantor's infinite is an absolute, of all the sets or all the ordinal numbers [Mayberry] |
| Full Idea: In Cantor's new vision, the infinite, the genuine infinite, does not disappear, but presents itself in the guise of the absolute, as manifested in the species of all sets or the species of all ordinal numbers. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2) |
| 17797 | Cantor extended the finite (rather than 'taming the infinite') [Mayberry] |
| Full Idea: We may describe Cantor's achievement by saying, not that he tamed the infinite, but that he extended the finite. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.414-2) |
| 13509 | We can establish truths about infinite numbers by means of induction [Hart,WD] |
| Full Idea: Mathematical induction is a way to establish truths about the infinity of natural numbers by a finite proof. | |
| From: William D. Hart (The Evolution of Logic [2010], 5) | |
| A reaction: If there are truths about infinities, it is very tempting to infer that the infinities must therefore 'exist'. A nice, and large, question in philosophy is whether there can be truths without corresponding implications of existence. |
| 17775 | If proof and definition are central, then mathematics needs and possesses foundations [Mayberry] |
| Full Idea: If we grant, as surely we must, the central importance of proof and definition, then we must also grant that mathematics not only needs, but in fact has, foundations. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-1) |
| 17776 | The ultimate principles and concepts of mathematics are presumed, or grasped directly [Mayberry] |
| Full Idea: The ultimate principles upon which mathematics rests are those to which mathematicians appeal without proof; and the primitive concepts of mathematics ...themselves are grasped directly, if grasped at all, without the mediation of definition. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-1) | |
| A reaction: This begs the question of whether the 'grasping' is purely a priori, or whether it derives from experience. I defend the latter, and Jenkins puts the case well. |
| 17777 | Foundations need concepts, definition rules, premises, and proof rules [Mayberry] |
| Full Idea: An account of the foundations of mathematics must specify four things: the primitive concepts for use in definitions, the rules governing definitions, the ultimate premises of proofs, and rules allowing advance from premises to conclusions. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.405-2) |
| 17804 | Axiom theories can't give foundations for mathematics - that's using axioms to explain axioms [Mayberry] |
| Full Idea: No axiomatic theory, formal or informal, of first or of higher order can logically play a foundational role in mathematics. ...It is obvious that you cannot use the axiomatic method to explain what the axiomatic method is. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.415-2) |
| 13474 | Euclid has a unique parallel, spherical geometry has none, and saddle geometry has several [Hart,WD] |
| Full Idea: There is a familiar comparison between Euclid (unique parallel) and 'spherical' geometry (no parallel) and 'saddle' geometry (several parallels). | |
| From: William D. Hart (The Evolution of Logic [2010], 2) |
| 17792 | 1st-order PA is only interesting because of results which use 2nd-order PA [Mayberry] |
| Full Idea: The sole theoretical interest of first-order Peano arithmetic derives from the fact that it is a first-order reduct of a categorical second-order theory. Its axioms can be proved incomplete only because the second-order theory is categorical. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 17793 | It is only 2nd-order isomorphism which suggested first-order PA completeness [Mayberry] |
| Full Idea: If we did not know that the second-order axioms characterise the natural numbers up to isomorphism, we should have no reason to suppose, a priori, that first-order Peano Arithmetic should be complete. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-1) |
| 17794 | Set theory is not just first-order ZF, because that is inadequate for mathematics [Mayberry] |
| Full Idea: The idea that set theory must simply be identified with first-order Zermelo-Fraenkel is surprisingly widespread. ...The first-order axiomatic theory of sets is clearly inadequate as a foundation of mathematics. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.412-2) | |
| A reaction: [He is agreeing with a quotation from Skolem]. |
| 17802 | We don't translate mathematics into set theory, because it comes embodied in that way [Mayberry] |
| Full Idea: One does not have to translate 'ordinary' mathematics into the Zermelo-Fraenkel system: ordinary mathematics comes embodied in that system. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.415-1) | |
| A reaction: Mayberry seems to be a particular fan of set theory as spelling out the underlying facts of mathematics, though it has to be second-order. |
| 17805 | Set theory is not just another axiomatised part of mathematics [Mayberry] |
| Full Idea: The fons et origo of all confusion is the view that set theory is just another axiomatic theory and the universe of sets just another mathematical structure. ...The universe of sets ...is the world that all mathematical structures inhabit. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.416-1) |
| 13471 | Mathematics makes existence claims, but philosophers usually say those are never analytic [Hart,WD] |
| Full Idea: The thesis that no existence proposition is analytic is one of the few constants in philosophical consciences, but there are many existence claims in mathematics, such as the infinity of primes, five regular solids, and certain undecidable propositions. | |
| From: William D. Hart (The Evolution of Logic [2010], 2) |
| 13488 | Mass words do not have plurals, or numerical adjectives, or use 'fewer' [Hart,WD] |
| Full Idea: Jespersen calls a noun a mass word when it has no plural, does not take numerical adjectives, and does not take 'fewer'. | |
| From: William D. Hart (The Evolution of Logic [2010], 3) | |
| A reaction: Jespersen was a great linguistics expert. |
| 17785 | Real numbers as abstracted objects are now treated as complete ordered fields [Mayberry] |
| Full Idea: The abstractness of the old fashioned real numbers has been replaced by generality in the modern theory of complete ordered fields. | |
| From: John Mayberry (What Required for Foundation for Maths? [1994], p.408-2) | |
| A reaction: In philosophy, I'm increasingly thinking that we should talk much more of 'generality', and a great deal less about 'universals'. (By which I don't mean that redness is just the set of red things). |
| 13480 | Fregean self-evidence is an intrinsic property of basic truths, rules and definitions [Hart,WD] |
| Full Idea: The conception of Frege is that self-evidence is an intrinsic property of the basic truths, rules, and thoughts expressed by definitions. | |
| From: William D. Hart (The Evolution of Logic [2010], p.350) | |
| A reaction: The problem is always that what appears to be self-evident may turn out to be wrong. Presumably the effort of arriving at a definition ought to clarify and support the self-evident ingredient. |
| 13476 | The failure of key assumptions in geometry, mereology and set theory throw doubt on the a priori [Hart,WD] |
| Full Idea: In the case of the parallels postulate, Euclid's fifth axiom (the whole is greater than the part), and comprehension, saying was believing for a while, but what was said was false. This should make a shrewd philosopher sceptical about a priori knowledge. | |
| From: William D. Hart (The Evolution of Logic [2010], 2) | |
| A reaction: Euclid's fifth is challenged by infinite numbers, and comprehension is challenged by Russell's paradox. I can't see a defender of the a priori being greatly worried about these cases. No one ever said we would be right - in doing arithmetic, for example. |
| 1556 | By nature people are close to one another, but culture drives them apart [Hippias] |
| Full Idea: I regard you all as relatives - by nature, not by convention. By nature like is akin to like, but convention is a tyrant over humankind and often constrains people to act contrary to nature. | |
| From: Hippias (fragments/reports [c.430 BCE]), quoted by Plato - Protagoras 337c8 |
| 13475 | The Fregean concept of GREEN is a function assigning true to green things, and false to the rest [Hart,WD] |
| Full Idea: A Fregean concept is a function that assigns to each object a truth value. So instead of the colour green, the concept GREEN assigns truth to each green thing, but falsity to anything else. | |
| From: William D. Hart (The Evolution of Logic [2010], 2) | |
| A reaction: This would seem to immediately hit the renate/cordate problem, if there was a world in which all and only the green things happened to be square. How could Frege then distinguish the green from the square? Compare Idea 8245. |