Combining Texts

All the ideas for 'talk', 'Beginning Logic' and 'Science of Logic'

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


80 ideas

1. Philosophy / E. Nature of Metaphysics / 6. Metaphysics as Conceptual
If we start with indeterminate being, we arrive at being and nothing as a united pair [Hegel, by Houlgate]
Thought about being leads to a string of other concepts, like becoming, quantity, specificity, causality... [Hegel, by Houlgate]
We must start with absolute abstraction, with no presuppositions, so we start with pure being [Hegel]
2. Reason / A. Nature of Reason / 5. Objectivity
Objectivity is not by correspondence, but by the historical determined necessity of Geist [Hegel, by Pinkard]
2. Reason / B. Laws of Thought / 3. Non-Contradiction
Being and nothing are the same and not the same, which is the identity of identity and non-identity [Hegel]
The so-called world is filled with contradiction [Hegel]
2. Reason / C. Styles of Reason / 1. Dialectic
Dialectic is the instability of thoughts generating their opposite, and then new more complex thoughts [Hegel, by Houlgate]
Hegel's dialectic is not thesis-antithesis-synthesis, but usually negation of negation of the negation [Hegel, by Moore,AW]
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
That proposition that both P and Q is their 'conjunction', written P∧Q [Lemmon]
The sign |- may be read as 'therefore' [Lemmon]
If A and B are 'interderivable' from one another we may write A -||- B [Lemmon]
We write the conditional 'if P (antecedent) then Q (consequent)' as P→Q [Lemmon]
We write the 'negation' of P (not-P) as ¬ [Lemmon]
That proposition that either P or Q is their 'disjunction', written P∨Q [Lemmon]
We write 'P if and only if Q' as P↔Q; it is also P iff Q, or (P→Q)∧(Q→P) [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]
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]
Two propositions are 'equivalent' if they mirror one another's truth-value [Lemmon]
The 'scope' of a connective is the connective, the linked formulae, and the brackets [Lemmon]
A 'theorem' is the conclusion of a provable sequent with zero assumptions [Lemmon]
A 'implies' B if B is true whenever A is true (so that A→B is tautologous) [Lemmon]
'Subcontrary' propositions are never both false, so that A∨B is a tautology [Lemmon]
'Contrary' propositions are never both true, so that ¬(A∧B) is a tautology [Lemmon]
A wff is a 'tautology' if all assignments to variables result in the value T [Lemmon]
A wff is 'contingent' if produces at least one T and at least one F [Lemmon]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / c. Derivation rules of PL
DN: Given A, we may derive ¬¬A [Lemmon]
∧I: Given A and B, we may derive A∧B [Lemmon]
MPP: Given A and A→B, we may derive B [Lemmon]
∧E: Given A∧B, we may derive either A or B separately [Lemmon]
∨E: Derive C from A∨B, if C can be derived both from A and from B [Lemmon]
MTT: Given ¬B and A→B, we derive ¬A [Lemmon]
A: we may assume any proposition at any stage [Lemmon]
∨I: Given either A or B separately, we may derive A∨B [Lemmon]
RAA: If assuming A will prove B∧¬B, then derive ¬A [Lemmon]
CP: Given a proof of B from A as assumption, we may derive A→B [Lemmon]
4. Formal Logic / B. Propositional Logic PL / 2. Tools of Propositional Logic / d. Basic theorems of PL
'Modus ponendo tollens' (MPT) says P, ¬(P ∧ Q) |- ¬Q [Lemmon]
We can change conjunctions into negated conditionals with P→Q -||- ¬(P → ¬Q) [Lemmon]
The Distributive Laws can rearrange a pair of conjunctions or disjunctions [Lemmon]
De Morgan's Laws make negated conjunctions/disjunctions into non-negated disjunctions/conjunctions [Lemmon]
We can change conditionals into disjunctions with P→Q -||- ¬P ∨ Q [Lemmon]
We can change conditionals into negated conjunctions with P→Q -||- ¬(P ∧ ¬Q) [Lemmon]
'Modus tollendo ponens' (MTP) says ¬P, P ∨ Q |- 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]
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]
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]
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]
7. Existence / A. Nature of Existence / 3. Being / d. Non-being
To grasp an existence, we must consider its non-existence [Hegel, by Houlgate]
Nothing exists, as thinkable and expressible [Hegel]
7. Existence / A. Nature of Existence / 3. Being / e. Being and nothing
Thinking of nothing is not the same as simply not thinking [Hegel, by Houlgate]
7. Existence / C. Structure of Existence / 1. Grounding / a. Nature of grounding
The ground of a thing is not another thing, but the first thing's substance or rational concept [Hegel, by Houlgate]
7. Existence / D. Theories of Reality / 2. Realism
Kant's thing-in-itself is just an abstraction from our knowledge; things only exist for us [Hegel, by Bowie]
Hegel believe that the genuine categories reveal things in themselves [Hegel, by Houlgate]
8. Modes of Existence / A. Relations / 2. Internal Relations
The nature of each category relates itself to another [Hegel]
11. Knowledge Aims / B. Certain Knowledge / 1. Certainty
In absolute knowing, the gap between object and oneself closes, producing certainty [Hegel]
11. Knowledge Aims / C. Knowing Reality / 3. Idealism / d. Absolute idealism
The 'absolute idea' is when all the contradictions are exhausted [Hegel, by Bowie]
Hegel, unlike Kant, said how things appear is the same as how things are [Hegel, by Moore,AW]
Hegel's non-subjective idealism is the unity of subjective and objective viewpoints [Hegel, by Pinkard]
Hegel claimed his system was about the world, but it only mapped conceptual interdependence [Pinkard on Hegel]
Authentic thinking and reality have the same content [Hegel]
The Absolute is the primitive system of concepts which are actualised [Hegel, by Gardner]
The absolute idea is being, imperishable life, self-knowing truth, and all truth [Hegel]
The absolute idea is the great unity of the infinite system of concepts [Hegel, by Moore,AW]
13. Knowledge Criteria / B. Internal Justification / 5. Coherentism / a. Coherence as justification
Hegel's 'absolute idea' is the interdependence of all truths to justify any of them [Hegel, by Bowie]
15. Nature of Minds / B. Features of Minds / 5. Qualia / b. Qualia and intentionality
Maybe lots of qualia lead to intentionality, rather than intentionality being basic [Gildersleve]
18. Thought / D. Concepts / 1. Concepts / a. Nature of concepts
Every concept depends on the counter-concepts of what it is not [Hegel, by Bowie]
19. Language / E. Analyticity / 4. Analytic/Synthetic Critique
When we explicate the category of being, we watch a new category emerge [Hegel, by Houlgate]