81 ideas
| 22289 | Dedekind proved definition by recursion, and thus proved the basic laws of arithmetic [Dedekind, by Potter] |
| 9535 | 'Contradictory' propositions always differ in truth-value [Lemmon] |
| 9511 | We write the conditional 'if P (antecedent) then Q (consequent)' as P→Q [Lemmon] |
| 9510 | That proposition that either P or Q is their 'disjunction', written P∨Q [Lemmon] |
| 9509 | That proposition that both P and Q is their 'conjunction', 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] |
| 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] |
| 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] |
| 9519 | A 'substitution-instance' is a wff formed by consistent replacing variables with wffs [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] |
| 9530 | A wff is 'contingent' if produces at least one T and at least one F [Lemmon] |
| 9532 | 'Subcontrary' propositions are never both false, so that A∨B is a tautology [Lemmon] |
| 9533 | A 'implies' B if B is true whenever A is true (so that A→B is tautologous) [Lemmon] |
| 9528 | A wff is a 'tautology' if all assignments to variables result in the value T [Lemmon] |
| 9518 | A 'theorem' is the conclusion of a provable sequent with zero assumptions [Lemmon] |
| 9398 | ∧I: Given A and B, we may derive A∧B [Lemmon] |
| 9397 | CP: Given a proof of B from A as assumption, we may derive A→B [Lemmon] |
| 9394 | MPP: Given A and A→B, we may derive B [Lemmon] |
| 9401 | ∨E: Derive C from A∨B, if C can be derived both from A and from B [Lemmon] |
| 9396 | DN: Given A, we may derive ¬¬A [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] |
| 9402 | RAA: If assuming A will prove B∧¬B, then derive ¬A [Lemmon] |
| 9395 | MTT: Given ¬B and A→B, we derive ¬A [Lemmon] |
| 9400 | ∨I: Given either A or B separately, we may derive A∨B [Lemmon] |
| 9521 | 'Modus tollendo ponens' (MTP) says ¬P, P ∨ Q |- Q [Lemmon] |
| 9522 | 'Modus ponendo tollens' (MPT) says P, ¬(P ∧ Q) |- ¬Q [Lemmon] |
| 9525 | We can change conditionals into negated conjunctions with P→Q -||- ¬(P ∧ ¬Q) [Lemmon] |
| 9524 | We can change conditionals into disjunctions with P→Q -||- ¬P ∨ Q [Lemmon] |
| 9523 | De Morgan's Laws make negated conjunctions/disjunctions into non-negated disjunctions/conjunctions [Lemmon] |
| 9527 | The Distributive Laws can rearrange a pair of conjunctions or disjunctions [Lemmon] |
| 9526 | We can change conjunctions into negated conditionals 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] |
| 13909 | Write '(∀x)(...)' to mean 'take any x: then...', and '(∃x)(...)' to mean 'there is an x such that....' [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] |
| 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] |
| 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] |
| 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] |
| 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] |
| 10183 | An infinite set maps into its own proper subset [Dedekind, by Reck/Price] |
| 22288 | We have the idea of self, and an idea of that idea, and so on, so infinite ideas are available [Dedekind, by Potter] |
| 10706 | Dedekind originally thought more in terms of mereology than of sets [Dedekind, by Potter] |
| 9520 | The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q [Lemmon] |
| 9823 | Numbers are free creations of the human mind, to understand differences [Dedekind] |
| 10090 | Dedekind defined the integers, rationals and reals in terms of just the natural numbers [Dedekind, by George/Velleman] |
| 17452 | Ordinals can define cardinals, as the smallest ordinal that maps the set [Dedekind, by Heck] |
| 7524 | Order, not quantity, is central to defining numbers [Dedekind, by Monk] |
| 14131 | Dedekind's ordinals are just members of any progression whatever [Dedekind, by Russell] |
| 17611 | We want the essence of continuity, by showing its origin in arithmetic [Dedekind] |
| 10572 | A cut between rational numbers creates and defines an irrational number [Dedekind] |
| 14437 | Dedekind's axiom that his Cut must be filled has the advantages of theft over honest toil [Dedekind, by Russell] |
| 18094 | Dedekind says each cut matches a real; logicists say the cuts are the reals [Dedekind, by Bostock] |
| 18244 | I say the irrational is not the cut itself, but a new creation which corresponds to the cut [Dedekind] |
| 9824 | In counting we see the human ability to relate, correspond and represent [Dedekind] |
| 17612 | Arithmetic is just the consequence of counting, which is the successor operation [Dedekind] |
| 9826 | A system S is said to be infinite when it is similar to a proper part of itself [Dedekind] |
| 18087 | If x changes by less and less, it must approach a limit [Dedekind] |
| 13508 | Dedekind gives a base number which isn't a successor, then adds successors and induction [Dedekind, by Hart,WD] |
| 18096 | Zero is a member, and all successors; numbers are the intersection of sets satisfying this [Dedekind, by Bostock] |
| 18841 | Categoricity implies that Dedekind has characterised the numbers, because it has one domain [Rumfitt on Dedekind] |
| 14130 | Induction is proved in Dedekind, an axiom in Peano; the latter seems simpler and clearer [Dedekind, by Russell] |
| 8924 | Dedekind originated the structuralist conception of mathematics [Dedekind, by MacBride] |
| 9153 | Dedekindian abstraction talks of 'positions', where Cantorian abstraction talks of similar objects [Dedekind, by Fine,K] |
| 9825 | A thing is completely determined by all that can be thought concerning it [Dedekind] |
| 9189 | Dedekind said numbers were abstracted from systems of objects, leaving only their position [Dedekind, by Dummett] |
| 9827 | We derive the natural numbers, by neglecting everything of a system except distinctness and order [Dedekind] |
| 9979 | Dedekind has a conception of abstraction which is not psychologistic [Dedekind, by Tait] |
| 20239 | Unlike us, the early Greeks thought envy was a good thing, and hope a bad thing [Hesiod, by Nietzsche] |