78 ideas
| 9247 | Life will be lived better if it has no meaning [Camus] |
| Full Idea: Life will be lived all the better if it has no meaning. | |
| From: Albert Camus (The Myth of Sisyphus [1942], 'Abs free') | |
| A reaction: One image of the good life is that of a successful wild animal, for which existence is not a problem, merely a constant activity and pursuit. Maybe life begins to acquire meaning once we realise that meaning should not be sought directly. |
| 6707 | Suicide - whether life is worth living - is the one serious philosophical problem [Camus] |
| Full Idea: There is but one truly serious philosophical problem and that is suicide. Judgine whether life is or is not worth living amounts to answering the fundamental question of philosophy. | |
| From: Albert Camus (The Myth of Sisyphus [1942], p.11) | |
| A reaction: What a wonderful thesis for a book. In Idea 2682 there is the possibility of life being worth living, but not worth a huge amount of effort. It is better to call Camus' question the first question, rather than the only question. |
| 9245 | To an absurd mind reason is useless, and there is nothing beyond reason [Camus] |
| Full Idea: To an absurd mind reason is useless, and there is nothing beyond reason. | |
| From: Albert Camus (The Myth of Sisyphus [1942], 'Phil Suic') | |
| A reaction: But there is, surely, intuition and instinct? Read Keats's Letters. There is good living through upbringing and habit. Read Aristotle. If you like Camus' thought, you will love Chuang Tzu. Personally I am a child of the Enlightenment. |
| 12619 | We have no successful definitions, because they all use indefinable words [Fodor] |
| Full Idea: There are practically no defensible examples of definitions; for all the examples we've got, practically all the words (/concepts) are undefinable. | |
| From: Jerry A. Fodor (Concepts:where cogn.science went wrong [1998], Ch.3) | |
| A reaction: I don't think a definition has to be defined all the way down. Aristotle is perfectly happy if you can get a concept you don't understand down to concepts you do. Understanding is the test, not further definitions. |
| 9535 | 'Contradictory' propositions always differ in truth-value [Lemmon] |
| Full Idea: Two propositions are 'contradictory' if they are never both true and never both false either, which means that ¬(A↔B) is a tautology. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.3) |
| 9511 | We write the conditional 'if P (antecedent) then Q (consequent)' as P→Q [Lemmon] |
| Full Idea: We write 'if P then Q' as P→Q. This is called a 'conditional', with P as its 'antecedent', and Q as its 'consequent'. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.2) | |
| A reaction: P→Q can also be written as ¬P∨Q. |
| 9510 | That proposition that either P or Q is their 'disjunction', written P∨Q [Lemmon] |
| Full Idea: If P and Q are any two propositions, the proposition that either P or Q is called the 'disjunction' of P and Q, and is written P∨Q. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.3) | |
| A reaction: This is inclusive-or (meaning 'P, or Q, or both'), and not exlusive-or (Boolean XOR), which means 'P, or Q, but not both'. The ∨ sign is sometimes called 'vel' (Latin). |
| 9509 | That proposition that both P and Q is their 'conjunction', written P∧Q [Lemmon] |
| Full Idea: If P and Q are any two propositions, the proposition that both P and Q is called the 'conjunction' of P and Q, and is written P∧Q. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.3) | |
| A reaction: [I use the more fashionable inverted-v '∧', rather than Lemmon's '&', which no longer seems to be used] P∧Q can also be defined as ¬(¬P∨¬Q) |
| 9508 | The sign |- may be read as 'therefore' [Lemmon] |
| Full Idea: I introduce the sign |- to mean 'we may validly conclude'. To call it the 'assertion sign' is misleading. It may conveniently be read as 'therefore'. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.2) | |
| A reaction: [Actually no gap between the vertical and horizontal strokes of the sign] As well as meaning 'assertion', it may also mean 'it is a theorem that' (with no proof shown). |
| 9512 | We write the 'negation' of P (not-P) as ¬ [Lemmon] |
| Full Idea: We write 'not-P' as ¬P. This is called the 'negation' of P. The 'double negation' of P (not not-P) would be written as ¬¬P. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.2) | |
| A reaction: Lemmons use of -P is no longer in use for 'not'. A tilde sign (squiggle) is also used for 'not', but some interpreters give that a subtly different meaning (involving vagueness). The sign ¬ is sometimes called 'hook' or 'corner'. |
| 9513 | We write 'P if and only if Q' as P↔Q; it is also P iff Q, or (P→Q)∧(Q→P) [Lemmon] |
| Full Idea: We write 'P if and only if Q' as P↔Q. It is called the 'biconditional', often abbreviate in writing as 'iff'. It also says that P is both sufficient and necessary for Q, and may be written out in full as (P→Q)∧(Q→P). | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.4) | |
| A reaction: If this symbol is found in a sequence, the first move in a proof is to expand it to the full version. |
| 9514 | If A and B are 'interderivable' from one another we may write A -||- B [Lemmon] |
| Full Idea: If we say that A and B are 'interderivable' from one another (that is, A |- B and B |- A), then we may write A -||- B. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.5) |
| 9516 | A 'well-formed formula' follows the rules for variables, ¬, →, ∧, ∨, and ↔ [Lemmon] |
| Full Idea: A 'well-formed formula' of the propositional calculus is a sequence of symbols which follows the rules for variables, ¬, →, ∧, ∨, and ↔. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.1) |
| 9517 | The 'scope' of a connective is the connective, the linked formulae, and the brackets [Lemmon] |
| Full Idea: The 'scope' of a connective in a certain formula is the formulae linked by the connective, together with the connective itself and the (theoretically) encircling brackets | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.1) |
| 9519 | A 'substitution-instance' is a wff formed by consistent replacing variables with wffs [Lemmon] |
| Full Idea: A 'substitution-instance' is a wff which results by replacing one or more variables throughout with the same wffs (the same wff replacing each variable). | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.2) |
| 9529 | A wff is 'inconsistent' if all assignments to variables result in the value F [Lemmon] |
| Full Idea: If a well-formed formula of propositional calculus takes the value F for all possible assignments of truth-values to its variables, it is said to be 'inconsistent'. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.3) |
| 9531 | 'Contrary' propositions are never both true, so that ¬(A∧B) is a tautology [Lemmon] |
| Full Idea: If A and B are expressible in propositional calculus notation, they are 'contrary' if they are never both true, which may be tested by the truth-table for ¬(A∧B), which is a tautology if they are contrary. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.3) |
| 9534 | Two propositions are 'equivalent' if they mirror one another's truth-value [Lemmon] |
| Full Idea: Two propositions are 'equivalent' if whenever A is true B is true, and whenever B is true A is true, in which case A↔B is a tautology. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.3) |
| 9530 | A wff is 'contingent' if produces at least one T and at least one F [Lemmon] |
| Full Idea: If a well-formed formula of propositional calculus takes at least one T and at least one F for all the assignments of truth-values to its variables, it is said to be 'contingent'. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.3) |
| 9532 | 'Subcontrary' propositions are never both false, so that A∨B is a tautology [Lemmon] |
| Full Idea: If A and B are expressible in propositional calculus notation, they are 'subcontrary' if they are never both false, which may be tested by the truth-table for A∨B, which is a tautology if they are subcontrary. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.3) |
| 9533 | A 'implies' B if B is true whenever A is true (so that A→B is tautologous) [Lemmon] |
| Full Idea: One proposition A 'implies' a proposition B if whenever A is true B is true (but not necessarily conversely), which is only the case if A→B is tautologous. Hence B 'is implied' by A. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.3) |
| 9528 | A wff is a 'tautology' if all assignments to variables result in the value T [Lemmon] |
| Full Idea: If a well-formed formula of propositional calculus takes the value T for all possible assignments of truth-values to its variables, it is said to be a 'tautology'. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.3) |
| 9518 | A 'theorem' is the conclusion of a provable sequent with zero assumptions [Lemmon] |
| Full Idea: A 'theorem' of logic is the conclusion of a provable sequent in which the number of assumptions is zero. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.2) | |
| A reaction: This is what Quine and others call a 'logical truth'. |
| 9398 | ∧I: Given A and B, we may derive A∧B [Lemmon] |
| Full Idea: And-Introduction (&I): Given A and B, we may derive A∧B as conclusion. This depends on their previous assumptions. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.5) |
| 9397 | CP: Given a proof of B from A as assumption, we may derive A→B [Lemmon] |
| Full Idea: Conditional Proof (CP): Given a proof of B from A as assumption, we may derive A→B as conclusion, on the remaining assumptions (if any). | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.5) |
| 9394 | MPP: Given A and A→B, we may derive B [Lemmon] |
| Full Idea: Modus Ponendo Ponens (MPP): Given A and A→B, we may derive B as a conclusion. B will rest on any assumptions that have been made. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.5) |
| 9401 | ∨E: Derive C from A∨B, if C can be derived both from A and from B [Lemmon] |
| Full Idea: Or-Elimination (∨E): Given A∨B, we may derive C if it is proved from A as assumption and from B as assumption. This will also depend on prior assumptions. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.5) |
| 9396 | DN: Given A, we may derive ¬¬A [Lemmon] |
| Full Idea: Double Negation (DN): Given A, we may derive ¬¬A as a conclusion, and vice versa. The conclusion depends on the assumptions of the premiss. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.5) |
| 9393 | A: we may assume any proposition at any stage [Lemmon] |
| Full Idea: Assumptions (A): any proposition may be introduced at any stage of a proof. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.5) |
| 9399 | ∧E: Given A∧B, we may derive either A or B separately [Lemmon] |
| Full Idea: And-Elimination (∧E): Given A∧B, we may derive either A or B separately. The conclusions will depend on the assumptions of the premiss. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.5) |
| 9402 | RAA: If assuming A will prove B∧¬B, then derive ¬A [Lemmon] |
| Full Idea: Reduction ad Absurdum (RAA): Given a proof of B∧¬B from A as assumption, we may derive ¬A as conclusion, depending on the remaining assumptions (if any). | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.5) |
| 9395 | MTT: Given ¬B and A→B, we derive ¬A [Lemmon] |
| Full Idea: Modus Tollendo Tollens (MTT): Given ¬B and A→B, we derive ¬A as a conclusion. ¬A depends on any assumptions that have been made | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.5) |
| 9400 | ∨I: Given either A or B separately, we may derive A∨B [Lemmon] |
| Full Idea: Or-Introduction (∨I): Given either A or B separately, we may derive A∨B as conclusion. This depends on the assumption of the premisses. | |
| From: E.J. Lemmon (Beginning Logic [1965], 1.5) |
| 9521 | 'Modus tollendo ponens' (MTP) says ¬P, P ∨ Q |- Q [Lemmon] |
| Full Idea: 'Modus tollendo ponens' (MTP) says that if a disjunction holds and also the negation of one of its disjuncts, then the other disjunct holds. Thus ¬P, P ∨ Q |- Q may be introduced as a theorem. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.2) | |
| A reaction: Unlike Modus Ponens and Modus Tollens, this is a derived rule. |
| 9522 | 'Modus ponendo tollens' (MPT) says P, ¬(P ∧ Q) |- ¬Q [Lemmon] |
| Full Idea: 'Modus ponendo tollens' (MPT) says that if the negation of a conjunction holds and also one of its conjuncts, then the negation of the other conjunct holds. Thus P, ¬(P ∧ Q) |- ¬Q may be introduced as a theorem. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.2) | |
| A reaction: Unlike Modus Ponens and Modus Tollens, this is a derived rule. |
| 9525 | We can change conditionals into negated conjunctions with P→Q -||- ¬(P ∧ ¬Q) [Lemmon] |
| Full Idea: The proof that P→Q -||- ¬(P ∧ ¬Q) is useful for enabling us to change conditionals into negated conjunctions | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.2) |
| 9524 | We can change conditionals into disjunctions with P→Q -||- ¬P ∨ Q [Lemmon] |
| Full Idea: The proof that P→Q -||- ¬P ∨ Q is useful for enabling us to change conditionals into disjunctions. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.2) |
| 9523 | De Morgan's Laws make negated conjunctions/disjunctions into non-negated disjunctions/conjunctions [Lemmon] |
| Full Idea: The forms of De Morgan's Laws [P∨Q -||- ¬(¬P ∧ ¬Q); ¬(P∨Q) -||- ¬P ∧ ¬Q; ¬(P∧Q) -||- ¬P ∨ ¬Q); P∧Q -||- ¬(¬P∨¬Q)] transform negated conjunctions and disjunctions into non-negated disjunctions and conjunctions respectively. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.2) |
| 9527 | The Distributive Laws can rearrange a pair of conjunctions or disjunctions [Lemmon] |
| Full Idea: The Distributive Laws say that P ∧ (Q∨R) -||- (P∧Q) ∨ (P∧R), and that P ∨ (Q∨R) -||- (P∨Q) ∧ (P∨R) | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.2) |
| 9526 | We can change conjunctions into negated conditionals with P→Q -||- ¬(P → ¬Q) [Lemmon] |
| Full Idea: The proof that P∧Q -||- ¬(P → ¬Q) is useful for enabling us to change conjunctions into negated conditionals. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.2) |
| 9537 | Truth-tables are good for showing invalidity [Lemmon] |
| Full Idea: The truth-table approach enables us to show the invalidity of argument-patterns, as well as their validity. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.4) |
| 9538 | A truth-table test is entirely mechanical, but this won't work for more complex logic [Lemmon] |
| Full Idea: A truth-table test is entirely mechanical, ..and in propositional logic we can even generate proofs mechanically for tautological sequences, ..but this mechanical approach breaks down with predicate calculus, and proof-discovery is an imaginative process. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.5) |
| 9536 | If any of the nine rules of propositional logic are applied to tautologies, the result is a tautology [Lemmon] |
| Full Idea: If any application of the nine derivation rules of propositional logic is made on tautologous sequents, we have demonstrated that the result is always a tautologous sequent. Thus the system is consistent. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.4) | |
| A reaction: The term 'sound' tends to be used now, rather than 'consistent'. See Lemmon for the proofs of each of the nine rules. |
| 9539 | Propositional logic is complete, since all of its tautologous sequents are derivable [Lemmon] |
| Full Idea: A logical system is complete is all expressions of a specified kind are derivable in it. If we specify tautologous sequent-expressions, then propositional logic is complete, because we can show that all tautologous sequents are derivable. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.5) | |
| A reaction: [See Lemmon 2.5 for details of the proofs] |
| 13909 | Write '(∀x)(...)' to mean 'take any x: then...', and '(∃x)(...)' to mean 'there is an x such that....' [Lemmon] |
| Full Idea: Just as '(∀x)(...)' is to mean 'take any x: then....', so we write '(∃x)(...)' to mean 'there is an x such that....' | |
| From: E.J. Lemmon (Beginning Logic [1965], 3.1) | |
| A reaction: [Actually Lemmon gives the universal quantifier symbol as '(x)', but the inverted A ('∀') seems to have replaced it these days] |
| 13902 | 'Gm' says m has property G, and 'Pmn' says m has relation P to n [Lemmon] |
| Full Idea: A predicate letter followed by one name expresses a property ('Gm'), and a predicate-letter followed by two names expresses a relation ('Pmn'). We could write 'Pmno' for a complex relation like betweenness. | |
| From: E.J. Lemmon (Beginning Logic [1965], 3.1) |
| 13911 | The 'symbols' are bracket, connective, term, variable, predicate letter, reverse-E [Lemmon] |
| Full Idea: I define a 'symbol' (of the predicate calculus) as either a bracket or a logical connective or a term or an individual variable or a predicate-letter or reverse-E (∃). | |
| From: E.J. Lemmon (Beginning Logic [1965], 4.1) |
| 13910 | Our notation uses 'predicate-letters' (for 'properties'), 'variables', 'proper names', 'connectives' and 'quantifiers' [Lemmon] |
| Full Idea: Quantifier-notation might be thus: first, render into sentences about 'properties', and use 'predicate-letters' for them; second, introduce 'variables'; third, introduce propositional logic 'connectives' and 'quantifiers'. Plus letters for 'proper names'. | |
| From: E.J. Lemmon (Beginning Logic [1965], 3.1) |
| 13904 | Universal Elimination (UE) lets us infer that an object has F, from all things having F [Lemmon] |
| Full Idea: Our rule of universal quantifier elimination (UE) lets us infer that any particular object has F from the premiss that all things have F. It is a natural extension of &E (and-elimination), as universal propositions generally affirm a complex conjunction. | |
| From: E.J. Lemmon (Beginning Logic [1965], 3.2) |
| 13906 | With finite named objects, we can generalise with &-Intro, but otherwise we need ∀-Intro [Lemmon] |
| Full Idea: If there are just three objects and each has F, then by an extension of &I we are sure everything has F. This is of no avail, however, if our universe is infinitely large or if not all objects have names. We need a new device, Universal Introduction, UI. | |
| From: E.J. Lemmon (Beginning Logic [1965], 3.2) |
| 13908 | UE all-to-one; UI one-to-all; EI arbitrary-to-one; EE proof-to-one [Lemmon] |
| Full Idea: Univ Elim UE - if everything is F, then something is F; Univ Intro UI - if an arbitrary thing is F, everything is F; Exist Intro EI - if an arbitrary thing is F, something is F; Exist Elim EE - if a proof needed an object, there is one. | |
| From: E.J. Lemmon (Beginning Logic [1965], 3.3) | |
| A reaction: [My summary of Lemmon's four main rules for predicate calculus] This is the natural deduction approach, of trying to present the logic entirely in terms of introduction and elimination rules. See Bostock on that. |
| 13901 | Predicate logic uses propositional connectives and variables, plus new introduction and elimination rules [Lemmon] |
| Full Idea: In predicate calculus we take over the propositional connectives and propositional variables - but we need additional rules for handling quantifiers: four rules, an introduction and elimination rule for the universal and existential quantifiers. | |
| From: E.J. Lemmon (Beginning Logic [1965]) | |
| A reaction: This is Lemmon's natural deduction approach (invented by Gentzen), which is largely built on introduction and elimination rules. |
| 13903 | Universal elimination if you start with the universal, introduction if you want to end with it [Lemmon] |
| Full Idea: The elimination rule for the universal quantifier concerns the use of a universal proposition as a premiss to establish some conclusion, whilst the introduction rule concerns what is required by way of a premiss for a universal proposition as conclusion. | |
| From: E.J. Lemmon (Beginning Logic [1965], 3.2) | |
| A reaction: So if you start with the universal, you need to eliminate it, and if you start without it you need to introduce it. |
| 13905 | If there is a finite domain and all objects have names, complex conjunctions can replace universal quantifiers [Lemmon] |
| Full Idea: If all objects in a given universe had names which we knew and there were only finitely many of them, then we could always replace a universal proposition about that universe by a complex conjunction. | |
| From: E.J. Lemmon (Beginning Logic [1965], 3.2) |
| 13900 | 'Some Frenchmen are generous' is rendered by (∃x)(Fx→Gx), and not with the conditional → [Lemmon] |
| Full Idea: It is a common mistake to render 'some Frenchmen are generous' by (∃x)(Fx→Gx) rather than the correct (∃x)(Fx&Gx). 'All Frenchmen are generous' is properly rendered by a conditional, and true if there are no Frenchmen. | |
| From: E.J. Lemmon (Beginning Logic [1965], 3.1) | |
| A reaction: The existential quantifier implies the existence of an x, but the universal quantifier does not. |
| 9244 | Logic is easy, but what about logic to the point of death? [Camus] |
| Full Idea: It is always easy to be logical. It is almost impossible to be logical to the bitter end. The only problem that interests me is: is there a logic to the point of death? | |
| From: Albert Camus (The Myth of Sisyphus [1942], 'Abs and Suic') | |
| A reaction: This is a lovely hand grenade to lob into an analytical logic class! It is very hard to get logicians to actually ascribe a clear value to their activity. They tend to present it as a marginal private game, and yet it has high status. |
| 9520 | The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q [Lemmon] |
| Full Idea: The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q. That is, since Napoleon was French, then if the moon is blue then Napoleon was French; and since Napoleon was not Chinese, then if Napoleon was Chinese, the moon is blue. | |
| From: E.J. Lemmon (Beginning Logic [1965], 2.2) | |
| A reaction: This is why the symbol → does not really mean the 'if...then' of ordinary English. Russell named it 'material implication' to show that it was a distinctively logical operator. |
| 12620 | If 'exist' is ambiguous in 'chairs and numbers exist', that mirrors the difference between chairs and numbers [Fodor] |
| Full Idea: People say 'exist' is ambiguous, because of the difference between 'chairs exist' and 'numbers exist'. A reply goes: the difference between the existence of chairs and the existence of numbers is strikingly like the difference between chairs and numbers. | |
| From: Jerry A. Fodor (Concepts:where cogn.science went wrong [1998], Ch.3) | |
| A reaction: To say 'numbers are objects which exist' is, to me, either a funny use of 'exist' or a funny use of 'object'. I think I will now vote for the latter. Just as 'real number' was a funny use of 'number', but we seem to have got used to it. |
| 12613 | Empiricists use dispositions reductively, as 'possibility of sensation' or 'possibility of experimental result' [Fodor] |
| Full Idea: Using dispositional analyses in aid of ontological reductions is what empiricism taught us. If you are down on cats, reduce them to permanent possibilities of sensation; if you are down on electrons, reduce them to possibilities of experimental outcome. | |
| From: Jerry A. Fodor (Concepts:where cogn.science went wrong [1998], Ch.1) | |
| A reaction: The cats line is phenomenalism; the electrons line is instrumentalism. I like this as a serious warning about dispositions, even where they seem most plausible, as in the disposition of glass to break when struck. Why is it thus disposed? |
| 12617 | Associationism can't explain how truth is preserved [Fodor] |
| Full Idea: The essential problem is to explain how thinking manages reliably to preserve truth; and Associationism, as Kant rightly pointed out to Hume, hasn't the resources to do so. | |
| From: Jerry A. Fodor (Concepts:where cogn.science went wrong [1998], Ch.1) | |
| A reaction: One might be able to give an associationist account of truth-preservation if one became a bit more externalist about it, so that the normal association patterns track their connections with the external world. |
| 9249 | Whether we are free is uninteresting; we can only experience our freedom [Camus] |
| Full Idea: Knowing whether or not a man is free doesn't interest me. I can only experience my own freedom. | |
| From: Albert Camus (The Myth of Sisyphus [1942], 'Abs free') | |
| A reaction: Camus has the right idea. Personally I think you could drop the word 'freedom', and just say that I am confronted by the need to make decisions. |
| 9253 | The human heart has a tiresome tendency to label as fate only what crushes it [Camus] |
| Full Idea: The human heart has a tiresome tendency to label as fate only what crushes it. | |
| From: Albert Camus (The Myth of Sisyphus [1942], 'Appendix') | |
| A reaction: Nice. It might just as much be fate that you live a happy bourgeois life, as that you inadvertently murder your own father at a crossroads. But you can't avoid the powerful awareness of fate when a road accident occurs. |
| 12615 | Mental representations are the old 'Ideas', but without images [Fodor] |
| Full Idea: The idea that there are mental representations is the idea that there are Ideas minus the idea that Ideas are images. | |
| From: Jerry A. Fodor (Concepts:where cogn.science went wrong [1998], Ch.1) | |
| A reaction: Good for you, Fodor. I've always thought that the vociferous contempt with which modern philosphers refer to the old notion of 'Ideas' was grossly exaggerated. At last someone puts a clear finger on what seems to be the difficulty. |
| 6650 | Fodor is now less keen on the innateness of concepts [Fodor, by Lowe] |
| Full Idea: Fodor has recently changed his mind about the innateness of concepts, which he formerly championed. | |
| From: report of Jerry A. Fodor (Concepts:where cogn.science went wrong [1998]) by E.J. Lowe - Introduction to the Philosophy of Mind Ch.7 n25 | |
| A reaction: There is some sensible middle road to be charted here. We presumably do not have an innate idea of a screwdriver, but there are plenty of basic concepts in logic and perception that are plausibly thought of as innate. |
| 12618 | It is essential to the concept CAT that it be satisfied by cats [Fodor] |
| Full Idea: Nothing in any mental life could be the concept CAT unless it is satisfied by cats. If you haven't got a concept that applies to cats, that entails that you haven't got the CAT concept. | |
| From: Jerry A. Fodor (Concepts:where cogn.science went wrong [1998], Ch.2) | |
| A reaction: Of course, having a concept that applies to cats doesn't entail that you have the CAT concept. Quine's 'gavagai', for example. I think Fodor is right in this idea. |
| 12614 | I prefer psychological atomism - that concepts are independent of epistemic capacities [Fodor] |
| Full Idea: I argue for a very strong version of psychological atomism; one according to which what concepts you have is conceptually and metaphysically independent of what epistemic capacities you have. | |
| From: Jerry A. Fodor (Concepts:where cogn.science went wrong [1998], Ch.1) | |
| A reaction: This is a frontal assault on the tradition of Frege, Dummett and Peacocke. I immediately find Fodor's approach more congenial, because he wants to say what a concept IS, rather than just place it within some larger scheme of things. |
| 12621 | Definable concepts have constituents, which are necessary, individuate them, and demonstrate possession [Fodor] |
| Full Idea: The definition theory says that concepts are complex structures which entail their constituents. By saying this, it guarantees both the connection between content and necessity, and the connection between concept individuation and concept possession. | |
| From: Jerry A. Fodor (Concepts:where cogn.science went wrong [1998], Ch.5) | |
| A reaction: He cites Pinker as a spokesman for the definitional view. This is the view Fodor attacks, in favour of his atomistic account. He adds in a note that his view also offered to reduce conceptual truth to logical truth. |
| 12622 | Many concepts lack prototypes, and complex prototypes aren't built from simple ones [Fodor] |
| Full Idea: Many concepts have no prototypes; and there are many complex concepts whose prototypes aren't related to the prototypes of their constituents in the way compositional explanation of productivity and systematicity requires. | |
| From: Jerry A. Fodor (Concepts:where cogn.science went wrong [1998], Ch.5) | |
| A reaction: His favourite example of the latter is 'pet fish', where the prototype of 'pet' is hardly ever a fish, and the prototype of 'fish' is usually much bigger than goldfish. Fodor is arguing that concepts are atomic. |
| 12623 | The theory theory can't actually tell us what concepts are [Fodor] |
| Full Idea: If the theory theory has a distinctive and coherent answer to the 'What's a concept?' question on offer, it's a well-kept secret. | |
| From: Jerry A. Fodor (Concepts:where cogn.science went wrong [1998], Ch.5) | |
| A reaction: Not an argument, but worth recording as an attitude. I certainly agree that accounts which offer some sort of answer to 'What is a concept?' have an immediate head's start on those which don't. |
| 12616 | English has no semantic theory, just associations between sentences and thoughts [Fodor] |
| Full Idea: English has no semantics. Learning English isn't learning a theory about what its sentences mean, it's learning how to associate its sentences with the corresponding thoughts. | |
| From: Jerry A. Fodor (Concepts:where cogn.science went wrong [1998], Ch.1) | |
| A reaction: This sounds remarkably close to John Locke's account of language (which I always thought was seriously underrated). Presumably we can then say that the 'thought' (or Locke's 'idea') is the meaning, which is old-fashioned real meanings. |
| 9250 | Discussing ethics is pointless; moral people behave badly, and integrity doesn't need rules [Camus] |
| Full Idea: There can be no question of holding forth on ethics. I have seen people behave badly with great morality and I note every day that integrity has no need of rules. | |
| From: Albert Camus (The Myth of Sisyphus [1942], 'Abs Man') | |
| A reaction: I don't agree. If someone 'behaves badly with great morality' there is something wrong with their morality, and I want to know what it is. The last part is more plausible, and could be a motto for Particularism. Rules dangerously over-simplify life. |
| 9252 | The more one loves the stronger the absurd grows [Camus] |
| Full Idea: The more one loves the stronger the absurd grows. | |
| From: Albert Camus (The Myth of Sisyphus [1942], 'Don Juan') | |
| A reaction: A penetrating remark, to be placed as a contrary to the remarks of Harry Frankfurt on love. But if the absurd increases the intensity of life, as Camus thinks, then they both make love the great life-affirmation, but in different ways. |
| 9251 | One can be virtuous through a whim [Camus] |
| Full Idea: One can be virtuous through a whim. | |
| From: Albert Camus (The Myth of Sisyphus [1942], 'Abs Man') | |
| A reaction: A nice remark. Obviously neither Aristotle nor Kant would be too impressed by someone who did this, and Aristotle would certainly say that it is not really virtue, but merely right behaviour. I agree with Aristotle. |
| 9243 | If we believe existence is absurd, this should dictate our conduct [Camus] |
| Full Idea: What a man believes to be true must determine his action. Belief in the absurdity of existence must then dictate his conduct. | |
| From: Albert Camus (The Myth of Sisyphus [1942], 'Abs and Suic') | |
| A reaction: It is intriguing to speculate what the appropriate conduct is. Presumably it is wild existential gestures, like sticking a knife through your hand. Suicide will be an obvious temptation. But bourgeois life might be equally appropriate. |
| 6708 | Happiness and the absurd go together, each leading to the other [Camus] |
| Full Idea: Happiness and the absurd are two sons of the same earth; they are inseparable; it would be a mistake to say that happiness necessarily springs from the absurd discovery; it happens as well that the feeling of the absurd springs from happiness. | |
| From: Albert Camus (The Myth of Sisyphus [1942], p.110) | |
| A reaction: I'm not sure that I understand this, but I understand the experience of absurdity, and I can see that somehow one feels a bit more alive when one acknowledges the absurdity of it all. Meta-meta-thought is the highest form of human life, I say. |
| 9242 | Essential problems either risk death, or intensify the passion of life [Camus] |
| Full Idea: The essential problems are those that run the risk of leading to death, or those that intensify the passion of living. | |
| From: Albert Camus (The Myth of Sisyphus [1942], 'Abs and Suic') | |
| A reaction: This seems to be distinctively existentialist, in a way that a cool concern for great truths are not ranked as so important. Ranking dangerous problems as crucial seems somehow trivial for a philosopher. Intensity of life is more impressive. |
| 9246 | Danger and integrity are not in the leap of faith, but in remaining poised just before the leap [Camus] |
| Full Idea: The leap of faith does not represent an extreme danger as Kierkegaard would like it to do. The danger, on the contrary, lies in the subtle instant that precedes the leap. Being able to remain on the dizzying crest - that is integrity. | |
| From: Albert Camus (The Myth of Sisyphus [1942], 'Phil Suic') | |
| A reaction: I have always found that a thrilling thought. It perfectly distinguishes atheist existentialism from religious existentialism. It is Camus' best image for how the Absurd can be a life affirming idea, rather than a sort of nihilism. Life gains intensity. |
| 9248 | It is essential to die unreconciled and not of one's own free will [Camus] |
| Full Idea: It is essential to die unreconciled and not of one's own free will. Suicide is a repudiation. | |
| From: Albert Camus (The Myth of Sisyphus [1942], 'Abs free') | |
| A reaction: Camus' whole book addresses the question of suicide. He suggests that life can be redeemed and become livable if you squarely face up to the absurdity of it, and the gap between what we hope for and what we get. |