The symbol V is sometimes called the inclusive or because p V q is true when p is true or when q is true, or when both are true. That is, we include the case when both statements are true. On the other hand, the exclusive or operator © is defined so that p ℗ q is true exactly when one (but not both) of p and q are true. That is, we exclude the case when both p and q are true. In natural conversation you might hear the phrase "either p or q" for p q. (a) Write down the truth table for . (b) It turns out that the set of connectives {^, V,¬} is what we can call a basis. This means that every truth table in two variables can be generated by these (and no other) connectives. A statement written using only these connectives is said to be in disjunctive normal form, as long as the symbol is only used directly before a propositional variable. 7 Write down a logically equivalent statement to p q which is in disjunctive normal form. Prove your statement is equivalent by writing out its truth table in an organized manner. (c) For each sub-task, determine whether the given set B of operations forms a basis. If it does, give a brief justification. If it does not, give at least one truth table in variables x, y for which there is no compound proposition using the operations from B that has exactly that truth table. i) B = {^,¬} ii) B = {V,¬} iii) B = {V, ^} iv) B = {→,¬}
The symbol V is sometimes called the inclusive or because p V q is true when p is true or when q is true, or when both are true. That is, we include the case when both statements are true. On the other hand, the exclusive or operator © is defined so that p ℗ q is true exactly when one (but not both) of p and q are true. That is, we exclude the case when both p and q are true. In natural conversation you might hear the phrase "either p or q" for p q. (a) Write down the truth table for . (b) It turns out that the set of connectives {^, V,¬} is what we can call a basis. This means that every truth table in two variables can be generated by these (and no other) connectives. A statement written using only these connectives is said to be in disjunctive normal form, as long as the symbol is only used directly before a propositional variable. 7 Write down a logically equivalent statement to p q which is in disjunctive normal form. Prove your statement is equivalent by writing out its truth table in an organized manner. (c) For each sub-task, determine whether the given set B of operations forms a basis. If it does, give a brief justification. If it does not, give at least one truth table in variables x, y for which there is no compound proposition using the operations from B that has exactly that truth table. i) B = {^,¬} ii) B = {V,¬} iii) B = {V, ^} iv) B = {→,¬}
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
please only answer part c

Transcribed Image Text:The symbol V is sometimes called the inclusive or because p V q is true when p is true or
when q is true, or when both are true. That is, we include the case when both statements
are true. On the other hand, the exclusive or operatoris defined so that p q is true
exactly when one (but not both) of p and q are true. That is, we exclude the case when both
and q are true. In natural conversation you might hear the phrase "either p or q" for pq.
р
(a) Write down the truth table for .
(b) It turns out that the set of connectives {^, V,¬} is what we can call a basis. This
means that every truth table in two variables can be generated by these (and no other)
connectives. A statement written using only these connectives is said to be in disjunctive
normal form, as long as the symbol is only used directly before a propositional
variable.
Write down a logically equivalent statement to p q which is in disjunctive normal
form. Prove your statement is equivalent by writing out its truth table in an organized
manner.
(c) For each sub-task, determine whether the given set B of operations forms a basis. If it
does, give a brief justification. If it does not, give at least one truth table in variables
x, y for which there is no compound proposition using the operations from B that has
exactly that truth table.
i) B = {^, ¬}
ii) B = {V,¬}
iii) B = {V, ^}
iv) B = {→→}
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 5 steps

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education