FlashKeepers

Computer Science · College · College and University

Discrete Math for Computer Science, Unit 1: Logic and Propositions

Discrete Math for Computer Science, unit: Logic and Propositions. Core concepts, terminology, and worked-example cues a college student meets for this unit, building on prior units without repeating them. Front: a term, concept, or short problem cue. Back: the definition, explanation, or answer.

About this set

38 basic cards for College Computer Science. Set 1 of 8 in Discrete Math for Computer Science. It opens with "What is a proposition, in logic?" and "What is a logical connective?". Study it alongside the other College sets below.

38 cards · basic cards · AI-written, checked twice. Edit anything.

Study this set free Look inside first Get FlashKeepers for iPhone

Opens in your browser, no account. Get the iPhone and iPad app · Android app

What is a proposition, in logic?
Show answerA declarative statement that is either true or false, but not both
What is a logical connective?
Show answerA symbol combining propositions, such as AND, OR, NOT, or IMPLIES
What does the AND (conjunction) connective require for a true result?
Show answerBoth propositions must be true
What does the OR (disjunction) connective require for a true result?
Show answerAt least one of the propositions must be true
What does the NOT (negation) connective do?
Show answerReverses the truth value of a proposition
What is a conditional statement (implication)?
Show answerA statement of the form 'if p then q', false only when p is true and q is false
What is a biconditional statement?
Show answerA statement of the form 'p if and only if q', true when p and q have the same truth value
What is the converse of a conditional statement?
Show answerThe statement formed by swapping the hypothesis and conclusion (if q then p)
What is the contrapositive of a conditional statement?
Show answerThe statement formed by negating and swapping both parts (if not q then not p)
Why is the contrapositive logically equivalent to the original conditional?
Show answerThey share the same truth table for all possible values of p and q
What is a truth table?
Show answerA table listing the truth value of a compound proposition for every combination of inputs
What is a tautology?
Show answerA compound proposition that is always true, regardless of the truth values of its parts
What is a contradiction, in logic?
Show answerA compound proposition that is always false, regardless of its parts' truth values
What is logical equivalence?
Show answerTwo propositions that have identical truth values in every possible case
What are De Morgan's laws?
Show answerRules stating not(p and q) equals (not p) or (not q), and not(p or q) equals (not p) and (not q)

23 more cards in the app

Study this set free