Lecture_5_09 - Lecture 5 Lecture 5 From previous meeting...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Lecture 5 Lecture 5 From previous meeting From previous meeting Simplify the following from 2.17: A ∧ ∨ ∨¬B (B C) Duality Duality Dual of a connective Dual of a sentential expression The truth­tables of dual expressions are obtained from each other by toggling everywhere T and F. (p.70) If two expressions are equivalent, so are their duals. (p.71) Conditionals Conditionals Semantics → in terms of ¬ and ∨ Can you represent ∨ in terms ¬ and →? Binding strength: ¬ > ∧ ∨ → > > Is → associative? Exercise 2.21 Exercise 2.21 Find “distributive laws” for the following cases: A → (B ∧ C) (A ∨ B) → C Biconditionals Biconditionals Semantics ↔ in terms of → and ∧ Commutative? Associative? Relationship between biconditional and logical equivalence Binding strength: ¬ > ∧ ∨ → > ↔ > > If B ∈ {∧∨→}, then {¬,B} is complete. What ,, if B = ↔? ...
View Full Document

This note was uploaded on 02/27/2011 for the course PHILOSOPHY 101 taught by Professor H during the Spring '11 term at Columbia College.

Ask a homework question - tutors are online