a. Propositional functions have truth values. - false
b. Standard Predicate Logic is a two-valued logic. - true
c. When starting with a simple sentence, you can add either an individual constant or a quantifier to form a well-formed formula (complete sentence) in predicate logic. - false
d. Predicate logic has one most fundamental, elementary unit, while Sentential logic has two. -
e. Lower case letters x, y, and z, stand for individual constants in predicate logic.
f. The role of quantifiers is to tell us how many things a proposition is true of.
g. Every variable that is not bound is free.
h. Universally quantified statements are true only when the proposition is true of everything it quantifies over and there is at least one such thing.
i. Negated universals logically imply that something exists.
j. The scope of a quantifier is defined as the first complete formula following the quantifier.
k. All of the quantifier negation rules can be understood, informally, to consist in just sliding a negation through the quantifier and changing the quantifier.
l. Compound (multiple) subjects in an existentially quantified proposition are typically treated with a disjunction.
m. A propositional function that has been filled in with an individual constant instead of having a quantifier attached contains an unbound variable.
n. Venn diagrams can be used to diagram sets in propositional logic.
o. Categorical quantifier negation equivalences can be derived formally.