85 ideas
| 9847 | A contextual definition permits the elimination of the expression by a substitution [Dummett] |
| 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] |
| 9508 | The sign |- may be read as 'therefore' [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] |
| 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] |
| 9820 | In classical logic, logical truths are valid formulas; in higher-order logics they are purely logical [Dummett] |
| 9520 | The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q [Lemmon] |
| 9896 | A prime number is one which is measured by a unit alone [Dummett] |
| 18255 | Addition of quantities is prior to ordering, as shown in cyclic domains like angles [Dummett] |
| 9895 | A number is a multitude composed of units [Dummett] |
| 9852 | We understand 'there are as many nuts as apples' as easily by pairing them as by counting them [Dummett] |
| 9829 | The identity of a number may be fixed by something outside structure - by counting [Dummett] |
| 9828 | Numbers aren't fixed by position in a structure; it won't tell you whether to start with 0 or 1 [Dummett] |
| 9876 | Set theory isn't part of logic, and why reduce to something more complex? [Dummett] |
| 9884 | The distinction of concrete/abstract, or actual/non-actual, is a scale, not a dichotomy [Dummett] |
| 9869 | Realism is just the application of two-valued semantics to sentences [Dummett] |
| 9880 | Nominalism assumes unmediated mental contact with objects [Dummett] |
| 9885 | The existence of abstract objects is a pseudo-problem [Dummett] |
| 9858 | Abstract objects nowadays are those which are objective but not actual [Dummett] |
| 9859 | It is absurd to deny the Equator, on the grounds that it lacks causal powers [Dummett] |
| 9860 | 'We've crossed the Equator' has truth-conditions, so accept the Equator - and it's an object [Dummett] |
| 9872 | Abstract objects need the context principle, since they can't be encountered directly [Dummett] |
| 9848 | Content is replaceable if identical, so replaceability can't define identity [Dummett, by Dummett] |
| 9842 | Frege introduced criteria for identity, but thought defining identity was circular [Dummett] |
| 9849 | Maybe a concept is 'prior' to another if it can be defined without the second concept [Dummett] |
| 9850 | An argument for conceptual priority is greater simplicity in explanation [Dummett] |
| 9873 | Abstract terms are acceptable as long as we know how they function linguistically [Dummett] |
| 9993 | There is no reason why abstraction by equivalence classes should be called 'logical' [Dummett, by Tait] |
| 9857 | We arrive at the concept 'suicide' by comparing 'Cato killed Cato' with 'Brutus killed Brutus' [Dummett] |
| 9833 | To abstract from spoons (to get the same number as the forks), the spoons must be indistinguishable too [Dummett] |
| 9836 | Fregean semantics assumes a domain articulated into individual objects [Dummett] |
| 22687 | Maybe literary assessment is evaluating the artist as a suitable friend [Gaut] |
| 22686 | Formalists say aesthetics concerns types of beauty, or unity, complexity and intensity [Gaut] |
| 22690 | 'Moralism' says all aesthetic merits are moral merits [Gaut] |
| 22684 | Good ethics counts towards aesthetic merit, and bad ethics counts against it [Gaut] |
| 22689 | If we don't respond ethically in the way a work prescribes, that is an aesthetic failure [Gaut] |
| 22685 | Good art does not necessarily improve people (any more than good advice does) [Gaut] |
| 18257 | Why should the limit of measurement be points, not intervals? [Dummett] |