97 ideas
13860 | We can only learn from philosophers of the past if we accept the risk of major misrepresentation [Wright,C] |
13883 | The best way to understand a philosophical idea is to defend it [Wright,C] |
10142 | The attempt to define numbers by contextual definition has been revived [Wright,C, by Fine,K] |
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] |
9520 | The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q [Lemmon] |
9868 | An expression refers if it is a singular term in some true sentences [Wright,C, by Dummett] |
13861 | Number theory aims at the essence of natural numbers, giving their nature, and the epistemology [Wright,C] |
13892 | One could grasp numbers, and name sizes with them, without grasping ordering [Wright,C] |
13867 | Instances of a non-sortal concept can only be counted relative to a sortal concept [Wright,C] |
17441 | Wright thinks Hume's Principle is more fundamental to cardinals than the Peano Axioms are [Wright,C, by Heck] |
13862 | There are five Peano axioms, which can be expressed informally [Wright,C] |
17853 | Number truths are said to be the consequence of PA - but it needs semantic consequence [Wright,C] |
17854 | What facts underpin the truths of the Peano axioms? [Wright,C] |
13894 | Sameness of number is fundamental, not counting, despite children learning that first [Wright,C] |
10140 | We derive Hume's Law from Law V, then discard the latter in deriving arithmetic [Wright,C, by Fine,K] |
8692 | Frege has a good system if his 'number principle' replaces his basic law V [Wright,C, by Friend] |
17440 | Wright says Hume's Principle is analytic of cardinal numbers, like a definition [Wright,C, by Heck] |
13893 | It is 1-1 correlation of concepts, and not progression, which distinguishes natural number [Wright,C] |
13888 | If numbers are extensions, Frege must first solve the Caesar problem for extensions [Wright,C] |
13869 | Number platonism says that natural number is a sortal concept [Wright,C] |
13870 | We can't use empiricism to dismiss numbers, if numbers are our main evidence against empiricism [Wright,C] |
13873 | Treating numbers adjectivally is treating them as quantifiers [Wright,C] |
13899 | The Peano Axioms, and infinity of cardinal numbers, are logical consequences of how we explain cardinals [Wright,C] |
13896 | The aim is to follow Frege's strategy to derive the Peano Axioms, but without invoking classes [Wright,C] |
7804 | Wright has revived Frege's discredited logicism [Wright,C, by Benardete,JA] |
13863 | Logicism seemed to fail by Russell's paradox, Gödel's theorems, and non-logical axioms [Wright,C] |
13895 | The standard objections are Russell's Paradox, non-logical axioms, and Gödel's theorems [Wright,C] |
13884 | The idea that 'exist' has multiple senses is not coherent [Wright,C] |
13877 | Singular terms in true sentences must refer to objects; there is no further question about their existence [Wright,C] |
9878 | Contextually defined abstract terms genuinely refer to objects [Wright,C, by Dummett] |
13868 | Sortal concepts cannot require that things don't survive their loss, because of phase sortals [Wright,C] |
13866 | A concept is only a sortal if it gives genuine identity [Wright,C] |
13865 | 'Sortal' concepts show kinds, use indefinite articles, and require grasping identities [Wright,C] |
13890 | Entities fall under a sortal concept if they can be used to explain identity statements concerning them [Wright,C] |
13898 | If we can establish directions from lines and parallelism, we were already committed to directions [Wright,C] |
13882 | A milder claim is that understanding requires some evidence of that understanding [Wright,C] |
13885 | If apparent reference can mislead, then so can apparent lack of reference [Wright,C] |
17857 | We can accept Frege's idea of object without assuming that predicates have a reference [Wright,C] |
8388 | Causation is either direct realism, Humean reduction, non-Humean reduction or theoretical realism [Tooley] |
8389 | Causation distinctions: reductionism/realism; Humean/non-Humean states; observable/non-observable [Tooley] |
8393 | We can only reduce the direction of causation to the direction of time if we are realist about the latter [Tooley] |
8390 | Causation is directly observable in pressure on one's body, and in willed action [Tooley] |
8392 | Probabilist laws are compatible with effects always or never happening [Tooley] |
8399 | The actual cause may not be the most efficacious one [Tooley] |
8391 | In counterfactual worlds there are laws with no instances, so laws aren't supervenient on actuality [Tooley] |
8394 | Explaining causation in terms of laws can't explain the direction of causation [Tooley] |
8398 | Causation is a concept of a relation the same in all worlds, so it can't be a physical process [Tooley] |