### All the ideas for Peter B. Lewis, Friedrich Schiller and E.J. Lemmon

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

56 ideas

###### 4. Formal Logic / B. Propositional Logic PL / 1. Propositional Logic
 9535 'Contradictory' propositions always differ in truth-value [Lemmon]
###### 4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / a. Symbols of PL
 9508 The sign |- may be read as 'therefore' [Lemmon]
 9511 We write the conditional 'if P (antecedent) then Q (consequent)' as 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]
 9510 That proposition that either P or Q is their 'disjunction', written P∨Q [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]
###### 4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / b. Terminology of PL
 9533 A 'implies' B if B is true whenever A is true (so that A→B is tautologous) [Lemmon]
 9532 'Subcontrary' propositions are never both false, so that A∨B is a tautology [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]
 9518 A 'theorem' is the conclusion of a provable sequent with zero assumptions [Lemmon]
 9531 'Contrary' propositions are never both true, so that ¬(A∧B) is a tautology [Lemmon]
 9529 A wff is 'inconsistent' if all assignments to variables result in the value F [Lemmon]
 9519 A 'substitution-instance' is a wff formed by consistent replacing variables with wffs [Lemmon]
 9530 A wff is 'contingent' if produces at least one T and at least one F [Lemmon]
 9534 Two propositions are 'equivalent' if they mirror one another's truth-value [Lemmon]
 9528 A wff is a 'tautology' if all assignments to variables result in the value T [Lemmon]
###### 4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / c. Derivation rules of PL
 9399 ∧E: Given A∧B, we may derive either A or B separately [Lemmon]
 9393 A: we may assume any proposition at any stage [Lemmon]
 9395 MTT: Given ¬B and A→B, we derive ¬A [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]
 9396 DN: Given A, we may derive ¬¬A [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]
 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]
###### 4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
 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]
 9526 We can change conjunctions into negated conditionals 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]
###### 4. Formal Logic / B. Propositional Logic PL / 3. Truth Tables
 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]
###### 4. Formal Logic / B. Propositional Logic PL / 4. Soundness of PL
 9536 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
 9539 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
 13911 The 'symbols' are bracket, connective, term, variable, predicate letter, reverse-E [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]
###### 4. Formal Logic / C. Predicate Calculus PC / 2. Tools of Predicate Calculus / b. Terminology of PC
 13910 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
 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]
 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]
###### 4. Formal Logic / C. Predicate Calculus PC / 2. Tools of Predicate Calculus / d. Universal quantifier ∀
 13905 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 ∃
 13900 '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
 9520 The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q [Lemmon]
###### 11. Knowledge Aims / C. Knowing Reality / 3. Idealism / d. Absolute idealism
 21912 Fichte, Schelling and Hegel rejected transcendental idealism [Lewis,PB]
 21911 Fichte, Hegel and Schelling developed versions of Absolute Idealism [Lewis,PB]
###### 21. Aesthetics / C. Artistic Issues / 7. Art and Morality
 22022 Beauty motivates morality, by harmonising feeling and reason [Schiller, by Pinkard]
###### 25. Society / C. Social Justice / 3. Social Freedom / e. Freedom of lifestyle
 7675 Schiller speaks obsessively of freedom throughout his works [Schiller, by Berlin]