7 ideas
| 9540 | A 'value-assignment' (V) is when to each variable in the set V assigns either the value 1 or the value 0 [Hughes/Cresswell] |
| Full Idea: A 'value-assignment' (V) is when to each variable in the set V assigns either the value 1 or the value 0. | |
| From: GE Hughes/M Cresswell (An Introduction to Modal Logic [1968], Ch.1) | |
| A reaction: In the interpreted version of the logic, 1 and 0 would become T (true) and F (false). The procedure seems to be called nowadays a 'valuation'. |
| 9541 | The Law of Transposition says (P→Q) → (¬Q→¬P) [Hughes/Cresswell] |
| Full Idea: The Law of Transposition says that (P→Q) → (¬Q→¬P). | |
| From: GE Hughes/M Cresswell (An Introduction to Modal Logic [1968], Ch.1) | |
| A reaction: That is, if the consequent (Q) of a conditional is false, then the antecedent (P) must have been false. |
| 9543 | The rules preserve validity from the axioms, so no thesis negates any other thesis [Hughes/Cresswell] |
| Full Idea: An axiomatic system is most naturally consistent iff no thesis is the negation of another thesis. It can be shown that every axiom is valid, that the transformation rules are validity-preserving, and if a wff α is valid, then ¬α is not valid. | |
| From: GE Hughes/M Cresswell (An Introduction to Modal Logic [1968], Ch.1) | |
| A reaction: [The labels 'soundness' and 'consistency' seem interchangeable here, with the former nowadays preferred] |
| 12221 | 'Corner quotes' (quasi-quotation) designate 'whatever these terms designate' [Quine] |
| Full Idea: A 'quasi-quotation' [corner quotes, Quine quotes] designates that (unspecified) expression which is obtained from the contents of the corners by replacing the Greek letters by the (unspecified) expressions which they designate. | |
| From: Willard Quine (Mathematical Logic (revised) [1940], 1.6) | |
| A reaction: Filed under 'variables', as they seem to be variables that can refer to actual expressions, like algebra. Quine was determined to distinguish clearly between 'mention' and 'use'. 'Half-hearted substitutional quantification', says Fine. |
| 19321 | We might do without names, by converting them into predicates [Quine, by Kirkham] |
| Full Idea: Quine suggests that we can have a language with just predicates and no names. Thus for 'Ralph is red' we say 'x Ralphises and x is red'. | |
| From: report of Willard Quine (Mathematical Logic (revised) [1940]) by Richard L. Kirkham - Theories of Truth: a Critical Introduction 5.6 | |
| A reaction: Kirkham discusses this as a way of getting round the lack of names in Tarski's theory of truth (which just uses objects, predicates and quantifiers). Otherwise you must supplement Tarski with an account of what the names refer to. |
| 9544 | A system is 'weakly' complete if all wffs are derivable, and 'strongly' if theses are maximised [Hughes/Cresswell] |
| Full Idea: To say that an axiom system is 'weakly complete' is to say that every valid wff of the system is derivable as a thesis. ..The system is 'strongly complete' if it cannot have any more theses than it has without falling into inconsistency. | |
| From: GE Hughes/M Cresswell (An Introduction to Modal Logic [1968], Ch.1) | |
| A reaction: [They go on to say that Propositional Logic is strongly complete, but Modal Logic is not] |
| 7903 | The six perfections are giving, morality, patience, vigour, meditation, and wisdom [Nagarjuna] |
| Full Idea: The six perfections are of giving, morality, patience, vigour, meditation, and wisdom. | |
| From: Nagarjuna (Mahaprajnaparamitashastra [c.120], 88) | |
| A reaction: What is 'morality', if giving is not part of it? I like patience and vigour being two of the virtues, which immediately implies an Aristotelian mean (which is always what is 'appropriate'). |