Propositional Logic Is the following formula in Conjunctive Normal Form? Why? Why not? (¬A) n (A...

Propositional Logic

Is the following formula in Conjunctive Normal Form? Why? Why not?

(¬A) n (A u B) n ¬(A u B)

where A and B are propositional variables.

Solutions

Expert Solution

Given (¬A) (A B) ¬(A B)

The above Formula is Not in Conjunctive Normal Form

Because in Conjunctive Normal Form the the Formula must have Conjunction of clauses Here in above Formula Negation must be applied inside the braces it should be Conjunction of clauses

In order to convert the above formula in Conjunctive Normal Form Negation must be applied inside the braces it should be Conjunction of clauses.

(¬A) (A B) ¬(A B)

(¬A) (A B) (¬A ¬B)

(¬A) (A B) (¬A) (¬B) {By De Morgan's law ¬ (P Q) = ¬P ¬Q }

(¬A) (A B) (¬A) (¬B)

Which is Required Conjunctive Normal Form for given Formula

venereology answered 1 year ago

Next > < Previous

Related Solutions

Consider a formula of propositional logic consisting of a conjunction of clauses of the form (±p⊕±q),...

Consider a formula of propositional logic consisting of a conjunction of clauses of the form (±p⊕±q), where p and q are propositional variables (not necessarily distinct) and ±p stands for either p or ¬p. Consider the graph in which the vertices include p and ¬p for all propositional variables p appearing in the formula, and in which there is an edge (1) connecting p and ¬p for each variable p, and (2) connecting two literals if their exclusive-or is a...

Represent the following argument in the symbolic notation of Propositional Logic: If this argument is sound,...

Represent the following argument in the symbolic notation of Propositional Logic: If this argument is sound, it’s valid, but it’s not sound, so it’s invalid. (Remember how to use slashes in propositional logic)

Use the laws of propositional logic to prove that the following compound propositions are tautologies. ((?...

Use the laws of propositional logic to prove that the following compound propositions are tautologies. ((? → ?) ∧ (? → ?)) → (? → ?)

Use the laws of propositional logic to prove that the following compound propositions are tautologies. ((?...

Use the laws of propositional logic to prove that the following compound propositions are tautologies. ((? → ?) ∧ (? → ?)) → (? → ?)

Use the laws of propositional logic to prove that the following compound proposition is a tautologies...

Use the laws of propositional logic to prove that the following compound proposition is a tautologies (¬? ∧ (? ∨ ?)) → ?

How is Logics such as (Predicate Logic, Propositional Logic, and Logical Reasoning) used in Computer Science?...

How is Logics such as (Predicate Logic, Propositional Logic, and Logical Reasoning) used in Computer Science? Examples of how it implies to computer science would be great.

Conceptually the two most common logics are propositional logic and Predicate Logic. An undergraduate student who...

Conceptually the two most common logics are propositional logic and Predicate Logic. An undergraduate student who took a course of discrete mathematics is inquiring as to how propositional and predicate logics can be used in software testing. How are ask to guide this student in this quest. One pointer may consist in presenting the characteristics and limitations of both logic as well as their use as a mean for software testing. Which Logic is most adequate for formal verification of...

Represent the following in propositional logic. Label the component propositions. Note you may have to reword...

Represent the following in propositional logic. Label the component propositions. Note you may have to reword some propositions. Bread contains carbs and so does rice. Either John or Chris was the first student in class this morning. I have a bad shoulder and whenever it is raining, my shoulder aches. If the weather is nice, then if Dr Marlowe is lecturing, we will sleep in and then go for a hike. Henry will stay in his job only if he...

Two compound propositions p and q in propositional logic are logically equivalent if . . ..

Complete the following statements.Two compound propositions p and q in propositional logic are logically equivalent if . . ..An argument form in propositional logic is valid if . . ..A theorem is a statement that . . ..A statement that is assumed to be true is called a(n) . . ..A proof is a valid argument that . . ..

Use the laws of propositional logic to prove that the followingcompound propositions are logically equivalent....

Use the laws of propositional logic to prove that the following compound propositions are logically equivalent.A. ? ↔ (? ∧ ?) and ? → ?B. ¬(? ∨ (? ∧ (? → ?))) and ¬? ∧ (? → ?)

Subjects