Discrete Math Flashcards
Individually separate and distinct.
discrete
(the
theory of ways things combine; in particular, how to count these ways)
combinatorics
is any declarative sentence which is either true or false.
statement
__________is atomic if it cannot be divided into smaller statements, otherwise it is _________
statement, molecular
You can build more complicated (molecular) statements out of simpler ones using ________
logical connectives.
Logical connectives are called _________ when they connect
two statements while a ____________ applies to a single statement.
binary connectives, unary connective
(sometimes called sentential variables), usually capital letters
in the middle of the alphabet: P, Q, R, S, . . ..
propositional variables
A composite proposition, in which is composed of sub propositions and
various connectives is referred to as a __________
compound proposition.
A proposition is said to be ________ if it cannot be broken down
into simpler propositions, that is, if it is not composite.
primitive
P ∧ Q is read “P and Q,” and called a ____________
conjunction.
P ∨ Q is read “P or Q,” and called a ________
disjunction.
P → Q is read “if P then Q,” and called an ________
implication or conditional.
P ↔ Q is read “P if and only if Q,” and called a ________
biconditional.
¬P is read “not P,” and called a
negation
We say that P is the ________ (or antecedent), and Q is the _________ (or consequent).
hypothesis, conclusion
