Logic: Negations, Disjunctions, Conjunctions, and Truth Tables

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/7

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering the definitions, symbols, truth conditions, and truth tables for logical negations, disjunctions, and conjunctions.

8 Terms

1
New cards

Negation (∼\sim)

A logical operation symbolized by ∼\sim that makes a true statement false and makes a false statement true.

2
New cards

Disjunction (∨\lor)

A compound statement using "OR" (symbolized by ∨\lor or UU) that is only true when at least one part of the statement is true.

3
New cards

Conjunction (∧\land)

A compound statement using "AND" (symbolized by ∧\land or ∩\cap) that is only true when both parts of the statement are true.

4
New cards

Negation of a Statement

The logical reversal of the truth value of a statement; for example, if PP ("There are 44 quarters in a dollar") is true, then ∼P\sim P ("There are not 44 quarters in a dollar") is false.

5
New cards

Truth Condition for Disjunction

An "OR" statement evaluates to true if at least one component statement is true; it evaluates to false only when both component statements are false (such as when both components are negated to false).

6
New cards

Truth Condition for Conjunction

An "AND" statement evaluates to true strictly when both component statements are true; it evaluates to false if one or both component statements are false.

7
New cards

Truth Table for ∼p∨∼q\sim p \lor \sim q

A truth table evaluating ∼p∨∼q\sim p \lor \sim q, which outputs False when pp is True and qq is True, and outputs True for all other combinations: (T,F)(T, F), (F,T)(F, T), and (F,F)(F, F).

8
New cards

Truth Table for ∼p∧∼q\sim p \land \sim q

A truth table evaluating ∼p∧∼q\sim p \land \sim q, which outputs True only when both pp and qq are False, and outputs False for all other combinations: (T,T)(T, T), (T,F)(T, F), and (F,T)(F, T).