Combining Texts

All the ideas for 'Lectures on the History of Philosophy', 'Beginning Logic' and 'On Sense and Reference'

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


86 ideas

1. Philosophy / D. Nature of Philosophy / 3. Philosophy Defined
Philosophy is the conceptual essence of the shape of history [Hegel]
3. Truth / A. Truth Problems / 5. Truth Bearers
Frege was strongly in favour of taking truth to attach to propositions [Frege, by Dummett]
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]
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]
That proposition that both P and Q is their 'conjunction', written P∧Q [Lemmon]
The sign |- may be read as 'therefore' [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]
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]
∨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]
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 / F. Referring in Logic / 1. Naming / a. Names
We can treat designation by a few words as a proper name [Frege]
5. Theory of Logic / F. Referring in Logic / 1. Naming / b. Names as descriptive
Proper name in modal contexts refer obliquely, to their usual sense [Frege, by Gibbard]
A Fregean proper name has a sense determining an object, instead of a concept [Frege, by Sainsbury]
People may have different senses for 'Aristotle', like 'pupil of Plato' or 'teacher of Alexander' [Frege]
5. Theory of Logic / F. Referring in Logic / 1. Naming / c. Names as referential
The meaning of a proper name is the designated object [Frege]
5. Theory of Logic / F. Referring in Logic / 1. Naming / d. Singular terms
Frege ascribes reference to incomplete expressions, as well as to singular terms [Frege, by Hale]
5. Theory of Logic / F. Referring in Logic / 1. Naming / e. Empty names
If sentences have a 'sense', empty name sentences can be understood that way [Frege, by Sawyer]
It is a weakness of natural languages to contain non-denoting names [Frege]
In a logically perfect language every well-formed proper name designates an object [Frege]
5. Theory of Logic / I. Semantics of Logic / 6. Intensionalism
Frege is intensionalist about reference, as it is determined by sense; identity of objects comes first [Frege, by Jacquette]
Frege moved from extensional to intensional semantics when he added the idea of 'sense' [Frege, by Sawyer]
8. Modes of Existence / D. Universals / 1. Universals
We can't get a semantics from nouns and predicates referring to the same thing [Frege, by Dummett]
9. Objects / F. Identity among Objects / 1. Concept of Identity
Frege was asking how identities could be informative [Frege, by Perry]
18. Thought / D. Concepts / 3. Ontology of Concepts / c. Fregean concepts
'The concept "horse"' denotes a concept, yet seems also to denote an object [Frege, by McGee]
19. Language / A. Nature of Meaning / 4. Meaning as Truth-Conditions
Frege failed to show when two sets of truth-conditions are equivalent [Frege, by Potter]
The meaning (reference) of a sentence is its truth value - the circumstance of it being true or false [Frege]
19. Language / A. Nature of Meaning / 7. Meaning Holism / b. Language holism
Holism says all language use is also a change in the rules of language [Frege, by Dummett]
19. Language / B. Reference / 1. Reference theories
The reference of a word should be understood as part of the reference of the sentence [Frege]
19. Language / B. Reference / 4. Descriptive Reference / a. Sense and reference
Frege's Puzzle: from different semantics we infer different reference for two names with the same reference [Frege, by Fine,K]
Frege's 'sense' is ambiguous, between the meaning of a designator, and how it fixes reference [Kripke on Frege]
Every descriptive name has a sense, but may not have a reference [Frege]
Frege started as anti-realist, but the sense/reference distinction led him to realism [Frege, by Benardete,JA]
The meaning (reference) of 'evening star' is the same as that of 'morning star', but not the sense [Frege]
In maths, there are phrases with a clear sense, but no actual reference [Frege]
We are driven from sense to reference by our desire for truth [Frege]
19. Language / B. Reference / 4. Descriptive Reference / b. Reference by description
Expressions always give ways of thinking of referents, rather than the referents themselves [Frege, by Soames]
19. Language / C. Assigning Meanings / 5. Fregean Semantics
'Sense' gives meaning to non-referring names, and to two expressions for one referent [Frege, by Margolis/Laurence]
Frege was the first to construct a plausible theory of meaning [Frege, by Dummett]
Earlier Frege focuses on content itself; later he became interested in understanding content [Frege, by Dummett]
Frege divided the meaning of a sentence into sense, force and tone [Frege, by Dummett]
Frege uses 'sense' to mean both a designator's meaning, and the way its reference is determined [Kripke on Frege]
Frege explained meaning as sense, semantic value, reference, force and tone [Frege, by Miller,A]