display all the ideas for this combination of texts
4 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'. |
13500 | Conditional Proof: infer a conditional, if the consequent can be deduced from the antecedent [Hart,WD] |
Full Idea: A 'conditional proof' licenses inferences to a conditional from a deduction of its consequent from its antecedent. | |
From: William D. Hart (The Evolution of Logic [2010], 4) | |
A reaction: That is, a proof can be enshrined in an arrow. |
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] |