Name that Logical Operator
This Logical Operator denies or contradicts a proposition
Negation, ~
Modus Ponens, Simplification, and Absorption are examples of Rules of Replacement in Formal Logic
False, Rules of Inference
This logical operator joins two propositions and is true if and only if one or both of the propositions are true
Disjunction,v
when trying to find the validity of an argument, you are trying to prove that if the premises are true, and conclusion must be true.
true
This logical operator asserts that one component implies the other. It is false if and only if the antecedent is true and the consequent is false
Conditional, >
Consistent-- when trying to prove consistency, you are simply trying to prove that the propositions can be true at the same time
True
This logical operator joins two propositions and is true if and only if both the propositions are true
Conjunction, .
Self contradiction in truth trees will yield at minimum half the results as closed branches when decomposed
False, all branches will yield as closed branches
This logical operator is true when both component propositions have the same truth value, and is false when their truth values differ
Biconditional =
Equivalence-- goal is to see if the propositions and the conclusion are equivalent
false. Equivalence-- goal is to see if the propositions are equivalent