Answered: Use the program truth.m and a modified…

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

See similar textbooks

Related questions

Concept explainers

Question

Use the program truth.m and a modified version of propos.m to prove or disprove the following.

[(p ∧ q) ⊕ (r → s)] ⇔ [(p ∧ r) ∨ (q → s)]

If it is not valid, give a counterexample; otherwise, explain why it is valid.

propos.m

function prop=propos(p)

global num

if p<0

num=3

else

prop(1)=~p(1) | p(3);

prop(2)=~(~p(1) | p(3));

prop(3)=p(2)&~(~p(1) | p(3));

end

%Program truth.m
% Construct the truth table for proposition(s) in propos.m
clear
format compact
global num
propos(-1);
tot=2^num;
separt=888;
disp(' Basic variables 888 Proposition value(s)')
for i=1:tot
q=i-1;
for j=1:num
r=rem(q,2);
p(num+1-j)=r;
q=(q-r)/2;
end
prop=propos(p);
disp([p separt prop])
end

Expert Solution

Step by step

Solved in 2 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions