Quiz
Test Prep 1
Create a free account to finish this quiz
Save your progress and see your final score.
Already have an account? Sign in
Questions in this quiz (26)
1Which of the following is NOT a logical connective in propositional logic?
- AAND
- BOR
- CIF
- DNOT
2How many rows are required in a truth table for a compound proposition involving two variables?
- A2
- B3
- C4
- D8
3What is the value of the proposition "NOT P" when p is true?
- ATrue
- BFalse
4What is the converse of the statement "if a number is even, then it is divisible by 2"
- AIf a number is divisible by 2, then it is even
- BIf a number is odd, then it is not divisible by 2
- CIf a number is not divisible by 2, then it is odd
- DIf a number is not even, then it is not divisible by 2
5Which of the following statements is true regarding the relationship between the inverse and contrapositive of a conditional statement?
- AThe inverse and contrapositive are always equivalent
- BThe inverse is the contrapositive with the negation removed
- CThe inverse is the contrapositive with the antecedent and consequent switched
- DThe inverse and contrapositive may have no relationship
6Which of the following is the contrapositive of the statement "if a ship is square, then it has four equal sides?"
- AIf a shape does not have four equal sides, then it is not a square
- BIf a shape has four equal sides, then it is a square
- CIf a shape has four equal sides, then it is not a square
- DIf a shape is not a square, then it does not have four equal sides
7Which logical connective represents "if and only if" in propositional logic?
- A∧
- B∨
- C→
- D↔
8Which of the following is a tautology?
- Ap∧¬p
- Bp∨¬p
- Cp→¬p
- D¬p
9A compound proposition that is always false is called a:
- ATautology
- BContradiction
- CContingency
- DLogical equivalence
10What is the truth value of a contradiction in a truth table?
- ATrue for all rows
- BFalse for all rows
- CTrue for some rows and false for others
- DCannot be determined from the given information
11Which of the following is an example of De Morgan's Laws?
- A¬(p∧q)≡¬p∨¬q
- Bp→q≡¬q→¬p
- Cp∨q≡¬p∨¬q
- Dp↔q≡(p→q)∧(q→p)
12Which of the following is an example of the commutative law in propositional logic?
- Ap∧(q∨r)≡(p∨q)∧(p∨r)
- Bp∧q≡q∧p
- C¬(p∧q)≡¬p∨¬q
- Dp↔q≡(p→q)∧(q→p)
13Which of the following is true about a Disjunctive Normal Form (DNF) formula?
- AIt contains only conjunctions (∧) of literals.
- BIt contains only disjunctions (∨) of literals.
- CIt contains only negations (¬) of literals.
- DIt contains only implications (→) of literals.
14What is the rule for negating a formula in constructing a semantic tableau?
- ARemove the negation symbol.
- BApply De Morgan's laws to the negated formula.
- CReplace the negation symbol with the opposite logical connective.
- DKeep the negation symbol and proceed with the tableau construction.
15 What is the purpose of the termination condition in constructing a semantic tableau?
- ATo ensure the tableau construction is computationally efficient.
- BTo determine the number of truth values assigned to the atomic propositions.
- CTo verify the soundness of the inference rules applied in the tableau.
- DTo indicate that a complete formula analysis has been performed.
16Which of the following statements is true about complete deductive systems?
- ACompleteness guarantees soundness.
- BA complete system can prove false statements.
- CCompleteness depends on the number of axioms.
- DCompleteness ensures that all possible valid statements are provable.
17In a Hilbert system, what is the purpose of axioms?
- ATo define the logical connectives.
- BTo represent basic truths or assumptions.
- CTo evaluate truth values in truth tables.
- DTo apply inference rules to derive new statements.
18What is the purpose of the modus ponens rule in a Hilbert deduction system?
- ATo introduce new axioms into the deduction.
- BTo perform substitution of logical connectives in formulas.
- CTo apply logical equivalences to simplify formulas.
- DTo infer new formulas from previously derived formulas and their implications.
19Truth tables provide a systematic way to determine the truth values of compound propositions based on the truth values of their atomic components.
- ATrue
- BFalse
20The converse of a conditional statement is logically equivalent to the original statement.
- ATrue
- BFalse
21A tautology is a compound proposition that is true for all possible truth value assignments to its atomic components.
- ATrue
- BFalse
22A contingency is a compound proposition that can be true or false depending on the truth values assigned to its atomic components.
- ATrue
- BFalse
23Soundness in deductive systems guarantees that every valid statement is provable.
- ATrue
- BFalse
24Hilbert systems are based on axioms and inference rules, focusing on constructing formal proofs.
- ATrue
- BFalse
25Soundness entails that: In logic or formal systems, soundness refers to the property of an argument or system of inference whereby all conclusions drawn from validly derived premises are true.
- ATrue
- BFalse
26Completeness entails that: In logic or formal systems, completeness refers to the property of a logical calculus whereby every valid formula or statement within the system can be derived or proven.
- ATrue
- BFalse
Information
- Description
- Quiz on Test Prep 1, created by Mia Neri on 12/03/2024.
- Author
- Mia Neri
- Language
- English
- Views
- 3
- Tags
- Rating
- No ratings yet Rate this quiz