Combining Texts

All the ideas for 'Beginning Logic', 'The Trouble with Being Born' and '75: Is 'Live Unknown' a Wise Precept?'

expand these ideas     |    start again     |     specify just one area for these texts


70 ideas

1. Philosophy / A. Wisdom / 3. Wisdom Deflated
So-called wisdom is just pondering things instead of acting [Cioran]
1. Philosophy / E. Nature of Metaphysics / 3. Metaphysical Systems
Systems are the worst despotism, in philosophy and in life [Cioran]
1. Philosophy / H. Continental Philosophy / 3. Hermeneutics
A text explained ceases to be a text [Cioran]
4. Formal Logic / B. Propositional Logic PL / 1. Propositional Logic
'Contradictory' propositions always differ in truth-value [Lemmon]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / a. Symbols of PL
We write the conditional 'if P (antecedent) then Q (consequent)' as P→Q [Lemmon]
That proposition that either P or Q is their 'disjunction', written P∨Q [Lemmon]
That proposition that both P and Q is their 'conjunction', written P∧Q [Lemmon]
The sign |- may be read as 'therefore' [Lemmon]
We write the 'negation' of P (not-P) as ¬ [Lemmon]
We write 'P if and only if Q' as P↔Q; it is also P iff Q, or (P→Q)∧(Q→P) [Lemmon]
If A and B are 'interderivable' from one another we may write A -||- B [Lemmon]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / b. Terminology of PL
A 'well-formed formula' follows the rules for variables, ¬, →, ∧, ∨, and ↔ [Lemmon]
The 'scope' of a connective is the connective, the linked formulae, and the brackets [Lemmon]
A 'substitution-instance' is a wff formed by consistent replacing variables with wffs [Lemmon]
A wff is 'inconsistent' if all assignments to variables result in the value F [Lemmon]
'Contrary' propositions are never both true, so that ¬(A∧B) is a tautology [Lemmon]
Two propositions are 'equivalent' if they mirror one another's truth-value [Lemmon]
A wff is 'contingent' if produces at least one T and at least one F [Lemmon]
'Subcontrary' propositions are never both false, so that A∨B is a tautology [Lemmon]
A 'implies' B if B is true whenever A is true (so that A→B is tautologous) [Lemmon]
A wff is a 'tautology' if all assignments to variables result in the value T [Lemmon]
A 'theorem' is the conclusion of a provable sequent with zero assumptions [Lemmon]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / c. Derivation rules of PL
∧I: Given A and B, we may derive A∧B [Lemmon]
CP: Given a proof of B from A as assumption, we may derive A→B [Lemmon]
MPP: Given A and A→B, we may derive B [Lemmon]
∨E: Derive C from A∨B, if C can be derived both from A and from B [Lemmon]
DN: Given A, we may derive ¬¬A [Lemmon]
A: we may assume any proposition at any stage [Lemmon]
∧E: Given A∧B, we may derive either A or B separately [Lemmon]
RAA: If assuming A will prove B∧¬B, then derive ¬A [Lemmon]
MTT: Given ¬B and A→B, we derive ¬A [Lemmon]
∨I: Given either A or B separately, we may derive A∨B [Lemmon]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
'Modus tollendo ponens' (MTP) says ¬P, P ∨ Q |- Q [Lemmon]
'Modus ponendo tollens' (MPT) says P, ¬(P ∧ Q) |- ¬Q [Lemmon]
We can change conditionals into negated conjunctions with P→Q -||- ¬(P ∧ ¬Q) [Lemmon]
We can change conditionals into disjunctions with P→Q -||- ¬P ∨ Q [Lemmon]
De Morgan's Laws make negated conjunctions/disjunctions into non-negated disjunctions/conjunctions [Lemmon]
The Distributive Laws can rearrange a pair of conjunctions or disjunctions [Lemmon]
We can change conjunctions into negated conditionals with P→Q -||- ¬(P → ¬Q) [Lemmon]
4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
Truth-tables are good for showing invalidity [Lemmon]
A truth-table test is entirely mechanical, but this won't work for more complex logic [Lemmon]
4. Formal Logic / B. Propositional Logic PL / 4. Soundness of PL
If any of the nine rules of propositional logic are applied to tautologies, the result is a tautology [Lemmon]
4. Formal Logic / B. Propositional Logic PL / 5. Completeness of PL
Propositional logic is complete, since all of its tautologous sequents are derivable [Lemmon]
4. Formal Logic / C. Predicate Calculus PC / 2. Tools of Predicate Calculus / a. Symbols of PC
Write '(∀x)(...)' to mean 'take any x: then...', and '(∃x)(...)' to mean 'there is an x such that....' [Lemmon]
'Gm' says m has property G, and 'Pmn' says m has relation P to n [Lemmon]
The 'symbols' are bracket, connective, term, variable, predicate letter, reverse-E [Lemmon]
4. Formal Logic / C. Predicate Calculus PC / 2. Tools of Predicate Calculus / b. Terminology of PC
Our notation uses 'predicate-letters' (for 'properties'), 'variables', 'proper names', 'connectives' and 'quantifiers' [Lemmon]
4. Formal Logic / C. Predicate Calculus PC / 2. Tools of Predicate Calculus / c. Derivations rules of PC
Universal Elimination (UE) lets us infer that an object has F, from all things having F [Lemmon]
With finite named objects, we can generalise with &-Intro, but otherwise we need ∀-Intro [Lemmon]
UE all-to-one; UI one-to-all; EI arbitrary-to-one; EE proof-to-one [Lemmon]
Predicate logic uses propositional connectives and variables, plus new introduction and elimination rules [Lemmon]
Universal elimination if you start with the universal, introduction if you want to end with it [Lemmon]
4. Formal Logic / C. Predicate Calculus PC / 2. Tools of Predicate Calculus / d. Universal quantifier ∀
If there is a finite domain and all objects have names, complex conjunctions can replace universal quantifiers [Lemmon]
4. Formal Logic / C. Predicate Calculus PC / 2. Tools of Predicate Calculus / e. Existential quantifier ∃
'Some Frenchmen are generous' is rendered by (∃x)(Fx→Gx), and not with the conditional → [Lemmon]
5. Theory of Logic / B. Logical Consequence / 8. Material Implication
The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q [Lemmon]
5. Theory of Logic / E. Structures of Logic / 2. Logical Connectives / c. not
Negation doesn't arise from reasoning, but from deep instincts [Cioran]
7. Existence / A. Nature of Existence / 3. Being / i. Deflating being
The word 'being' is very tempting, but in fact means nothing at all [Cioran]
7. Existence / D. Theories of Reality / 4. Anti-realism
People who really believe anti-realism don't bother to prove it [Cioran]
11. Knowledge Aims / B. Certain Knowledge / 1. Certainty
Convictions are failures to study anything thoroughly [Cioran]
Opinions are fine, but having convictions means something has gone wrong [Cioran]
15. Nature of Minds / A. Nature of Mind / 2. Psuche
Some philosophers say the soul is light [Plutarch]
16. Persons / F. Free Will / 5. Against Free Will
If people always acted without words we would take them for robots [Cioran]
18. Thought / D. Concepts / 5. Concepts and Language / a. Concepts and language
If only we could write like a reptile, of endless sensations and no concepts! [Cioran]
20. Action / C. Motives for Action / 4. Responsibility for Actions
We could only be responsible if we had consented before birth to who we are [Cioran]
21. Aesthetics / A. Aesthetic Experience / 6. The Sublime
We morally dissolve if we spend time with excessive beauty [Cioran]
23. Ethics / F. Existentialism / 3. Angst
In anxiety people cling to what reinforces it, because it is a deep need [Cioran]
23. Ethics / F. Existentialism / 4. Boredom
Fear cures boredom, because it is stronger [Cioran]
It is better to watch the hours pass, than trying to fill them [Cioran]
25. Social Practice / F. Life Issues / 4. Suicide
Suicide is pointless, because it always comes too late [Cioran]
29. Religion / D. Religious Issues / 2. Immortality / d. Heaven
The first man obviously found paradise unendurable [Cioran]