94 ideas
21616 | Truth and falsity apply to suppositions as well as to assertions [Williamson] |
21623 | True and false are not symmetrical; false is more complex, involving negation [Williamson] |
9535 | 'Contradictory' propositions always differ in truth-value [Lemmon] |
9511 | We write the conditional 'if P (antecedent) then Q (consequent)' as P→Q [Lemmon] |
9510 | That proposition that either P or Q is their 'disjunction', written 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] |
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] |
9508 | The sign |- may be read as 'therefore' [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] |
9519 | A 'substitution-instance' is a wff formed by consistent replacing variables with wffs [Lemmon] |
9529 | A wff is 'inconsistent' if all assignments to variables result in the value F [Lemmon] |
9531 | 'Contrary' propositions are never both true, so that ¬(A∧B) is a tautology [Lemmon] |
9534 | Two propositions are 'equivalent' if they mirror one another's truth-value [Lemmon] |
9530 | A wff is 'contingent' if produces at least one T and at least one F [Lemmon] |
9532 | 'Subcontrary' propositions are never both false, so that A∨B is a tautology [Lemmon] |
9533 | A 'implies' B if B is true whenever A is true (so that A→B is tautologous) [Lemmon] |
9528 | A wff is a 'tautology' if all assignments to variables result in the value T [Lemmon] |
9518 | A 'theorem' is the conclusion of a provable sequent with zero assumptions [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] |
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] |
9395 | MTT: Given ¬B and A→B, we 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] |
9396 | DN: Given A, we may derive ¬¬A [Lemmon] |
9393 | A: we may assume any proposition at any stage [Lemmon] |
9399 | ∧E: Given A∧B, we may derive either A or B separately [Lemmon] |
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] |
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] |
9526 | We can change conjunctions into negated conditionals with P→Q -||- ¬(P → ¬Q) [Lemmon] |
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] |
9536 | If any of the nine rules of propositional logic are applied to tautologies, the result is a tautology [Lemmon] |
9539 | Propositional logic is complete, since all of its tautologous sequents are derivable [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] |
13911 | The 'symbols' are bracket, connective, term, variable, predicate letter, reverse-E [Lemmon] |
13910 | Our notation uses 'predicate-letters' (for 'properties'), 'variables', 'proper names', 'connectives' and 'quantifiers' [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] |
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] |
13905 | If there is a finite domain and all objects have names, complex conjunctions can replace universal quantifiers [Lemmon] |
13900 | 'Some Frenchmen are generous' is rendered by (∃x)(Fx→Gx), and not with the conditional → [Lemmon] |
21602 | Many-valued logics don't solve vagueness; its presence at the meta-level is ignored [Williamson] |
21611 | Formal semantics defines validity as truth preserved in every model [Williamson] |
9520 | The paradoxes of material implication are P |- Q → P, and ¬P |- P → Q [Lemmon] |
21606 | 'Bivalence' is the meta-linguistic principle that 'A' in the object language is true or false [Williamson] |
21605 | Excluded Middle is 'A or not A' in the object language [Williamson] |
21612 | Or-elimination is 'Argument by Cases'; it shows how to derive C from 'A or B' [Williamson] |
21599 | A sorites stops when it collides with an opposite sorites [Williamson] |
21589 | When bivalence is rejected because of vagueness, we lose classical logic [Williamson] |
21596 | Vagueness undermines the stable references needed by logic [Williamson] |
21601 | A vague term can refer to very precise elements [Williamson] |
21629 | Equally fuzzy objects can be identical, so fuzziness doesn't entail vagueness [Williamson] |
21591 | Vagueness is epistemic. Statements are true or false, but we often don't know which [Williamson] |
21619 | If a heap has a real boundary, omniscient speakers would agree where it is [Williamson] |
21620 | The epistemic view says that the essence of vagueness is ignorance [Williamson] |
21622 | If there is a true borderline of which we are ignorant, this drives a wedge between meaning and use [Williamson] |
9120 | Vagueness in a concept is its indiscriminability from other possible concepts [Williamson] |
21625 | The vagueness of 'heap' can remain even when the context is fixed [Williamson] |
21614 | The 'nihilist' view of vagueness says that 'heap' is not a legitimate concept [Williamson] |
21617 | We can say propositions are bivalent, but vague utterances don't express a proposition [Williamson] |
21618 | If the vague 'TW is thin' says nothing, what does 'TW is thin if his perfect twin is thin' say? [Williamson] |
21590 | Asking when someone is 'clearly' old is higher-order vagueness [Williamson] |
21592 | Supervaluation keeps classical logic, but changes the truth in classical semantics [Williamson] |
21603 | You can't give a precise description of a language which is intrinsically vague [Williamson] |
21604 | Supervaluation assigns truth when all the facts are respected [Williamson] |
21607 | Supervaluation has excluded middle but not bivalence; 'A or not-A' is true, even when A is undecided [Williamson] |
21608 | Truth-functionality for compound statements fails in supervaluation [Williamson] |
21609 | Supervaluationism defines 'supertruth', but neglects it when defining 'valid' [Williamson] |
21610 | Supervaluation adds a 'definitely' operator to classical logic [Williamson] |
21613 | Supervaluationism cannot eliminate higher-order vagueness [Williamson] |
21633 | Nominalists suspect that properties etc are our projections, and could have been different [Williamson] |
21630 | If fuzzy edges are fine, then why not fuzzy temporal, modal or mereological boundaries? [Williamson] |
21632 | A river is not just event; it needs actual and counterfactual boundaries [Williamson] |
21621 | We can't infer metaphysical necessities to be a priori knowable - or indeed knowable in any way [Williamson] |
21627 | We have inexact knowledge when we include margins of error [Williamson] |
21626 | Knowing you know (KK) is usually denied if the knowledge concept is missing, or not considered [Williamson] |
21631 | To know, believe, hope or fear, one must grasp the thought, but not when you fail to do them [Williamson] |
21600 | 'Blue' is not a family resemblance, because all the blues resemble in some respect [Williamson] |
21615 | References to the 'greatest prime number' have no reference, but are meaningful [Williamson] |
18038 | The 't' and 'f' of formal semantics has no philosophical interest, and may not refer to true and false [Williamson] |
21624 | It is known that there is a cognitive loss in identifying propositions with possible worlds [Williamson] |
467 | A virtue is a combination of intelligence, strength and luck [Ion] |