85 ideas
| 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] |
| 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] |
| 9509 | That proposition that both P and Q is their 'conjunction', written P∧Q [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] |
| 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] |
| 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] |
| 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] |
| 9520 | The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q [Lemmon] |
| 15682 | Even fairly simple animals make judgements based on categories [Gelman] |
| 15691 | Children accept real stable categories, with nonobvious potential that gives causal explanations [Gelman] |
| 15700 | In India, upper-castes essentialize caste more than lower-castes do [Gelman] |
| 15685 | Essentialism is either natural to us, or an accident of our culture, or a necessary result of language [Gelman] |
| 15684 | Children's concepts include nonobvious features, like internal parts, functions and causes [Gelman] |
| 15681 | Essentialism: real or representational? sortal, causal or ideal? real particulars, or placeholders? [Gelman] |
| 15678 | Essentialism says categories have a true hidden nature which gives an object its identity [Gelman] |
| 15683 | Sortals are needed for determining essence - the thing must be categorised first [Gelman] |
| 15697 | Kind (unlike individual) essentialism assumes preexisting natural categories [Gelman] |
| 14380 | The distinction between necessary and essential properties can be ignored [Rocca] |
| 15687 | Kinship is essence that comes in degrees, and age groups are essences that change over time [Gelman] |
| 15679 | Essentialism comes from the cognitive need to categorise [Gelman] |
| 15698 | We found no evidence that mothers teach essentialism to their children [Gelman] |
| 15709 | Essentialism is useful for predictions, but it is not the actual structure of reality [Gelman] |
| 15696 | Peope favor historical paths over outward properties when determining what something is [Gelman] |
| 15707 | There is intentional, mechanical, teleological, essentialist, vitalist and deontological understanding [Gelman] |
| 15703 | Memories often conform to a theory, rather than being neutral [Gelman] |
| 15708 | Inductive success is rewarded with more induction [Gelman] |
| 15694 | Children overestimate the power of a single example [Gelman] |
| 15695 | Children make errors in induction by focusing too much on categories [Gelman] |
| 15692 | People tend to be satisfied with shallow explanations [Gelman] |
| 15680 | Folk essentialism rests on belief in natural kinds, in hidden properties, and on words indicating structures [Gelman] |
| 15686 | Labels may indicate categories which embody an essence [Gelman] |
| 15690 | Causal properties are seen as more central to category concepts [Gelman] |
| 15688 | Categories are characterized by distance from a prototype [Gelman] |
| 15689 | Theory-based concepts use rich models to show which similarities really matter [Gelman] |
| 15699 | Prelinguistic infants acquire and use many categories [Gelman] |
| 15693 | One sample of gold is enough, but one tree doesn't give the height of trees [Gelman] |
| 15701 | Nouns seem to invoke stable kinds more than predicates do [Gelman] |
| 15705 | Essentialism encourages us to think about the world scientifically [Gelman] |
| 15702 | Essentialism doesn't mean we know the essences [Gelman] |
| 15704 | Essentialism starts from richly structured categories, leading to a search for underlying properties [Gelman] |
| 15706 | A major objection to real essences is the essentialising of social categories like race, caste and occupation [Gelman] |