display all the ideas for this combination of philosophers
7 ideas
| 8204 | Lewis's 'strict implication' preserved Russell's confusion of 'if...then' with implication [Quine on Russell/Whitehead] |
| Full Idea: Russell call 'if...then' implication, when the material conditional is a much better account; C.I.Lewis (in founding modern modal logic) preserved Russell's confusion by creating 'strict implication', and called that implication. | |
| From: comment on B Russell/AN Whitehead (Principia Mathematica [1913]) by Willard Quine - Reply to Professor Marcus p.177 | |
| A reaction: [A compession of Quine's paragraph]. All of this assumes that logicians can give an accurate account of what if...then means, when ordinary usage is broad and vague. Strict implication seems to drain all the normal meaning out of 'if...then'. |
| 9359 | Russell's implication means that random sentences imply one another [Lewis,CI on Russell/Whitehead] |
| Full Idea: In Mr Russell's idea of implication, if twenty random sentences from a newspaper were put in a hat, and two of them drawn at random, one will certainly imply the other, and it is an even bet the implication will be mutual. | |
| From: comment on B Russell/AN Whitehead (Principia Mathematica [1913]) by C.I. Lewis - A Pragmatic Conception of the A Priori p.366 | |
| A reaction: This sort of lament leads modern logicians to suggest 'relevance' as an important criterion. It certainly seems odd that so-called 'classical logic' should contain a principle so at variance with everyday reasoning. |
| 21707 | Russell unusually saw logic as 'interpreted' (though very general, and neutral) [Russell/Whitehead, by Linsky,B] |
| Full Idea: Russell did not view logic as an uninterpreted calculus awaiting interpretations [the modern view]. Rather, logic is a single 'interpreted' body of a priori truths, of propositions rather than sentence forms - but maximally general and topic neutral. | |
| From: report of B Russell/AN Whitehead (Principia Mathematica [1913]) by Bernard Linsky - Russell's Metaphysical Logic 1 | |
| A reaction: This is the view which Wittgenstein challenged, saying logic is just conventional. Linsky claims that Russell's logicism is much more plausible, once you understand his view of logic. |
| 10036 | In 'Principia' a new abstract theory of relations appeared, and was applied [Russell/Whitehead, by Gödel] |
| Full Idea: In 'Principia' a young science was enriched with a new abstract theory of relations, ..and not only Cantor's set theory but also ordinary arithmetic and the theory of measurement are treated from this abstract relational standpoint. | |
| From: report of B Russell/AN Whitehead (Principia Mathematica [1913]) by Kurt Gödel - Russell's Mathematical Logic p.448 | |
| A reaction: I presume this is accounting for relations in terms of ordered sets. |
| 4261 | The Lottery Paradox says each ticket is likely to lose, so there probably won't be a winner [Bonjour, by PG] |
| Full Idea: The Lottery Paradox says that for 100 tickets and one winner, each ticket has a .99 likelihood of defeat, so they are all likely to lose, so there is unlikely to be a winner. | |
| From: report of Laurence Bonjour (Externalist Theories of Empirical Knowledge [1980], §5) by PG - Db (ideas) | |
| A reaction: The problem seems to be viewing each ticket in isolation. If I buy two tickets, I increase my chances of winning. |
| 21554 | Sets always exceed terms, so all the sets must exceed all the sets [Lackey] |
| Full Idea: Cantor proved that the number of sets in a collection of terms is larger than the number of terms. Hence Cantor's Paradox says the number of sets in the collection of all sets must be larger than the number of sets in the collection of all sets. | |
| From: Douglas Lackey (Intros to Russell's 'Essays in Analysis' [1973], p.127) | |
| A reaction: The sets must count as terms in the next iteration, but that is a normal application of the Power Set axiom. |
| 21553 | It seems that the ordinal number of all the ordinals must be bigger than itself [Lackey] |
| Full Idea: The ordinal series is well-ordered and thus has an ordinal number, and a series of ordinals to a given ordinal exceeds that ordinal by 1. So the series of all ordinals has an ordinal number that exceeds its own ordinal number by 1. | |
| From: Douglas Lackey (Intros to Russell's 'Essays in Analysis' [1973], p.127) | |
| A reaction: Formulated by Burali-Forti in 1897. |