145 ideas
| 14122 | Analysis gives us nothing but the truth - but never the whole truth [Russell] |
| 14109 | The study of grammar is underestimated in philosophy [Russell] |
| 14165 | Analysis falsifies, if when the parts are broken down they are not equivalent to their sum [Russell] |
| 14115 | Definition by analysis into constituents is useless, because it neglects the whole [Russell] |
| 14159 | In mathematics definitions are superfluous, as they name classes, and it all reduces to primitives [Russell] |
| 14148 | Infinite regresses have propositions made of propositions etc, with the key term reappearing [Russell] |
| 18002 | As well as a truth value, propositions have a range of significance for their variables [Russell] |
| 14102 | What is true or false is not mental, and is best called 'propositions' [Russell] |
| 14176 | "The death of Caesar is true" is not the same proposition as "Caesar died" [Russell] |
| 9535 | 'Contradictory' propositions always differ in truth-value [Lemmon] |
| 9511 | We write the conditional 'if P (antecedent) then Q (consequent)' as P→Q [Lemmon] |
| 9509 | That proposition that both P and Q is their 'conjunction', written P∧Q [Lemmon] |
| 9514 | If A and B are 'interderivable' from one another we may write A -||- B [Lemmon] |
| 9508 | The sign |- may be read as 'therefore' [Lemmon] |
| 9510 | That proposition that either P or Q is their 'disjunction', written P∨Q [Lemmon] |
| 9512 | We write the 'negation' of P (not-P) as ¬ [Lemmon] |
| 9513 | We write 'P if and only if Q' as P↔Q; it is also P iff Q, or (P→Q)∧(Q→P) [Lemmon] |
| 9516 | A 'well-formed formula' follows the rules for variables, ¬, →, ∧, ∨, and ↔ [Lemmon] |
| 9517 | The 'scope' of a connective is the connective, the linked formulae, and the brackets [Lemmon] |
| 9518 | A 'theorem' is the conclusion of a provable sequent with zero assumptions [Lemmon] |
| 9528 | A wff is a 'tautology' if all assignments to variables result in the value T [Lemmon] |
| 9529 | A wff is 'inconsistent' if all assignments to variables result in the value F [Lemmon] |
| 9531 | 'Contrary' propositions are never both true, so that ¬(A∧B) is a tautology [Lemmon] |
| 9534 | Two propositions are 'equivalent' if they mirror one another's truth-value [Lemmon] |
| 9519 | A 'substitution-instance' is a wff formed by consistent replacing variables with wffs [Lemmon] |
| 9530 | A wff is 'contingent' if produces at least one T and at least one F [Lemmon] |
| 9533 | A 'implies' B if B is true whenever A is true (so that A→B is tautologous) [Lemmon] |
| 9532 | 'Subcontrary' propositions are never both false, so that A∨B is a tautology [Lemmon] |
| 9395 | MTT: Given ¬B and A→B, we derive ¬A [Lemmon] |
| 9396 | DN: Given A, we may derive ¬¬A [Lemmon] |
| 9397 | CP: Given a proof of B from A as assumption, we may derive A→B [Lemmon] |
| 9398 | ∧I: Given A and B, we may derive A∧B [Lemmon] |
| 9394 | MPP: Given A and A→B, we may derive B [Lemmon] |
| 9393 | A: we may assume any proposition at any stage [Lemmon] |
| 9399 | ∧E: Given A∧B, we may derive either A or B separately [Lemmon] |
| 9400 | ∨I: Given either A or B separately, we may derive A∨B [Lemmon] |
| 9402 | RAA: If assuming A will prove B∧¬B, then derive ¬A [Lemmon] |
| 9401 | ∨E: Derive C from A∨B, if C can be derived both from A and from B [Lemmon] |
| 9521 | 'Modus tollendo ponens' (MTP) says ¬P, P ∨ Q |- Q [Lemmon] |
| 9522 | 'Modus ponendo tollens' (MPT) says P, ¬(P ∧ Q) |- ¬Q [Lemmon] |
| 9526 | We can change conjunctions into negated conditionals with P→Q -||- ¬(P → ¬Q) [Lemmon] |
| 9527 | The Distributive Laws can rearrange a pair of conjunctions or disjunctions [Lemmon] |
| 9523 | De Morgan's Laws make negated conjunctions/disjunctions into non-negated disjunctions/conjunctions [Lemmon] |
| 9524 | We can change conditionals into disjunctions with P→Q -||- ¬P ∨ Q [Lemmon] |
| 9525 | We can change conditionals into negated conjunctions with P→Q -||- ¬(P ∧ ¬Q) [Lemmon] |
| 9537 | Truth-tables are good for showing invalidity [Lemmon] |
| 9538 | A truth-table test is entirely mechanical, but this won't work for more complex logic [Lemmon] |
| 9536 | If any of the nine rules of propositional logic are applied to tautologies, the result is a tautology [Lemmon] |
| 9539 | Propositional logic is complete, since all of its tautologous sequents are derivable [Lemmon] |
| 13902 | 'Gm' says m has property G, and 'Pmn' says m has relation P to n [Lemmon] |
| 13911 | The 'symbols' are bracket, connective, term, variable, predicate letter, reverse-E [Lemmon] |
| 13909 | Write '(∀x)(...)' to mean 'take any x: then...', and '(∃x)(...)' to mean 'there is an x such that....' [Lemmon] |
| 13910 | Our notation uses 'predicate-letters' (for 'properties'), 'variables', 'proper names', 'connectives' and 'quantifiers' [Lemmon] |
| 13904 | Universal Elimination (UE) lets us infer that an object has F, from all things having F [Lemmon] |
| 13901 | Predicate logic uses propositional connectives and variables, plus new introduction and elimination rules [Lemmon] |
| 13903 | Universal elimination if you start with the universal, introduction if you want to end with it [Lemmon] |
| 13906 | With finite named objects, we can generalise with &-Intro, but otherwise we need ∀-Intro [Lemmon] |
| 13908 | UE all-to-one; UI one-to-all; EI arbitrary-to-one; EE proof-to-one [Lemmon] |
| 13905 | If there is a finite domain and all objects have names, complex conjunctions can replace universal quantifiers [Lemmon] |
| 13900 | 'Some Frenchmen are generous' is rendered by (∃x)(Fx→Gx), and not with the conditional → [Lemmon] |
| 14113 | The null class is a fiction [Russell] |
| 15894 | Russell invented the naïve set theory usually attributed to Cantor [Russell, by Lavine] |
| 14126 | Order rests on 'between' and 'separation' [Russell] |
| 14127 | Order depends on transitive asymmetrical relations [Russell] |
| 14121 | The part-whole relation is ultimate and indefinable [Russell] |
| 14108 | It would be circular to use 'if' and 'then' to define material implication [Russell] |
| 14106 | Implication cannot be defined [Russell] |
| 9520 | The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q [Lemmon] |
| 14167 | The only classes are things, predicates and relations [Russell] |
| 14105 | There seem to be eight or nine logical constants [Russell] |
| 18722 | Negations are not just reversals of truth-value, since that can happen without negation [Wittgenstein on Russell] |
| 14104 | Constants are absolutely definite and unambiguous [Russell] |
| 14114 | Variables don't stand alone, but exist as parts of propositional functions [Russell] |
| 14137 | 'Any' is better than 'all' where infinite classes are concerned [Russell] |
| 14149 | The Achilles Paradox concerns the one-one correlation of infinite classes [Russell] |
| 15895 | Russell discovered the paradox suggested by Burali-Forti's work [Russell, by Lavine] |
| 14151 | Pure geometry is deductive, and neutral over what exists [Russell] |
| 14152 | In geometry, Kant and idealists aimed at the certainty of the premisses [Russell] |
| 14153 | In geometry, empiricists aimed at premisses consistent with experience [Russell] |
| 14154 | Geometry throws no light on the nature of actual space [Russell] |
| 14155 | Two points have a line joining them (descriptive), a distance (metrical), and a whole line (projective) [Russell, by PG] |
| 18254 | Russell's approach had to treat real 5/8 as different from rational 5/8 [Russell, by Dummett] |
| 14144 | Ordinals result from likeness among relations, as cardinals from similarity among classes [Russell] |
| 14128 | Some claim priority for the ordinals over cardinals, but there is no logical priority between them [Russell] |
| 14129 | Ordinals presuppose two relations, where cardinals only presuppose one [Russell] |
| 14132 | Properties of numbers don't rely on progressions, so cardinals may be more basic [Russell] |
| 14139 | Transfinite ordinals don't obey commutativity, so their arithmetic is quite different from basic arithmetic [Russell] |
| 14142 | Ordinals are types of series of terms in a row, rather than the 'nth' instance [Russell] |
| 14141 | Ordinals are defined through mathematical induction [Russell] |
| 14145 | For Cantor ordinals are types of order, not numbers [Russell] |
| 14146 | We aren't sure if one cardinal number is always bigger than another [Russell] |
| 14135 | Real numbers are a class of rational numbers (and so not really numbers at all) [Russell] |
| 14123 | Some quantities can't be measured, and some non-quantities are measurable [Russell] |
| 14158 | Quantity is not part of mathematics, where it is replaced by order [Russell] |
| 14120 | Counting explains none of the real problems about the foundations of arithmetic [Russell] |
| 14118 | We can define one-to-one without mentioning unity [Russell] |
| 14119 | We do not currently know whether, of two infinite numbers, one must be greater than the other [Russell] |
| 14133 | There are cardinal and ordinal theories of infinity (while continuity is entirely ordinal) [Russell] |
| 14134 | Infinite numbers are distinguished by disobeying induction, and the part equalling the whole [Russell] |
| 14143 | ω names the whole series, or the generating relation of the series of ordinal numbers [Russell] |
| 14138 | You can't get a new transfinite cardinal from an old one just by adding finite numbers to it [Russell] |
| 14140 | For every transfinite cardinal there is an infinite collection of transfinite ordinals [Russell] |
| 14124 | Axiom of Archimedes: a finite multiple of a lesser magnitude can always exceed a greater [Russell] |
| 7530 | Russell tried to replace Peano's Postulates with the simple idea of 'class' [Russell, by Monk] |
| 18246 | Dedekind failed to distinguish the numbers from other progressions [Shapiro on Russell] |
| 14147 | Denying mathematical induction gave us the transfinite [Russell] |
| 14125 | Finite numbers, unlike infinite numbers, obey mathematical induction [Russell] |
| 14116 | Numbers were once defined on the basis of 1, but neglected infinities and + [Russell] |
| 14117 | Numbers are properties of classes [Russell] |
| 9977 | Ordinals can't be defined just by progression; they have intrinsic qualities [Russell] |
| 14162 | Mathematics doesn't care whether its entities exist [Russell] |
| 14103 | Pure mathematics is the class of propositions of the form 'p implies q' [Russell] |
| 21555 | For 'x is a u' to be meaningful, u must be one range of individuals (or 'type') higher than x [Russell] |
| 18003 | In 'x is a u', x and u must be of different types, so 'x is an x' is generally meaningless [Russell, by Magidor] |
| 11010 | Being is what belongs to every possible object of thought [Russell] |
| 14161 | Many things have being (as topics of propositions), but may not have actual existence [Russell] |
| 14173 | What exists has causal relations, but non-existent things may also have them [Russell] |
| 14163 | Four classes of terms: instants, points, terms at instants only, and terms at instants and points [Russell] |
| 21341 | Philosophers of logic and maths insisted that a vocabulary of relations was essential [Russell, by Heil] |
| 10586 | 'Reflexiveness' holds between a term and itself, and cannot be inferred from symmetry and transitiveness [Russell] |
| 10585 | Symmetrical and transitive relations are formally like equality [Russell] |
| 14296 | Dispositions are physical states of mechanism; when known, these replace the old disposition term [Quine] |
| 7781 | I call an object of thought a 'term'. This is a wide concept implying unity and existence. [Russell] |
| 14166 | Unities are only in propositions or concepts, and nothing that exists has unity [Russell] |
| 14164 | The only unities are simples, or wholes composed of parts [Russell] |
| 14112 | A set has some sort of unity, but not enough to be a 'whole' [Russell] |
| 14170 | Change is obscured by substance, a thing's nature, subject-predicate form, and by essences [Russell] |
| 14107 | Terms are identical if they belong to all the same classes [Russell] |
| 11849 | It at least makes sense to say two objects have all their properties in common [Wittgenstein on Russell] |
| 22303 | It makes no sense to say that a true proposition could have been false [Russell] |
| 10583 | Abstraction principles identify a common property, which is some third term with the right relation [Russell] |
| 10582 | The principle of Abstraction says a symmetrical, transitive relation analyses into an identity [Russell] |
| 10584 | A certain type of property occurs if and only if there is an equivalence relation [Russell] |
| 14110 | Proposition contain entities indicated by words, rather than the words themselves [Russell] |
| 19164 | If propositions are facts, then false and true propositions are indistinguishable [Davidson on Russell] |
| 14111 | A proposition is a unity, and analysis destroys it [Russell] |
| 19157 | Russell said the proposition must explain its own unity - or else objective truth is impossible [Russell, by Davidson] |
| 14172 | Moments and points seem to imply other moments and points, but don't cause them [Russell] |
| 14175 | We can drop 'cause', and just make inferences between facts [Russell] |
| 14174 | The laws of motion and gravitation are just parts of the definition of a kind of matter [Russell] |
| 14168 | Occupying a place and change are prior to motion, so motion is just occupying places at continuous times [Russell] |
| 14171 | Force is supposed to cause acceleration, but acceleration is a mathematical fiction [Russell] |
| 14160 | Space is the extension of 'point', and aggregates of points seem necessary for geometry [Russell] |
| 14156 | Mathematicians don't distinguish between instants of time and points on a line [Russell] |
| 14169 | The 'universe' can mean what exists now, what always has or will exist [Russell] |