Proving Logical Equivalence With Basic Laws of Logic











up vote
0
down vote

favorite












I have to prove the following equivalence:



$(X rightarrow (Y lor Z)) lor (X leftrightarrow (Y land Z)) equiv neg(X land neg Y land neg Z)$



This is how far I've come:



$equiv (neg X lor (Y lor Z)) lor (X leftrightarrow (Y land Z))$



$equiv (neg X lor (Y lor Z)) lor ((X rightarrow (Y land Z)) land ((Y land Z) rightarrow X) )$
$equiv (neg X lor (Y lor Z)) lor ((neg X lor (Y land Z)) land (neg (Y land Z) lor X) )$
$equiv (neg X lor (Y lor Z)) lor ((neg X lor (Y land Z)) land (X lor neg (Y land Z)))$
$equiv neg [neg(neg X lor (Y lor Z)) land neg((neg X lor (Y land Z)) land (X lor neg (Y land Z)))]$
$equiv neg[( X land (neg Y land neg Z)) land neg((neg X lor (Y land Z)) land (X lor neg (Y land Z)))]$
$equiv neg[(X land (neg Y land neg Z)) land (neg(neg X lor (Y land Z)) lor neg(X lor neg (Y land Z)))]$
$equiv neg[(X land ( neg Y land neg Z)) land ((X land neg(Y land Z)) lor neg(X land neg (Y land Z))]$
$equiv neg[(X land (neg Y land neg Z)) land ((X land neg(Y land Z)) lor (neg X land (Y land Z)))]$










share|cite|improve this question






















  • Do you require a solution using laaws of logic? Because there are only 3 variables here, so you could just draw a truth table.
    – Josh B.
    Nov 17 at 17:33










  • I don't know for sure, because we have always solved it this way. But you are right, a truth table would be way easier.
    – Marina A.
    Nov 18 at 7:06















up vote
0
down vote

favorite












I have to prove the following equivalence:



$(X rightarrow (Y lor Z)) lor (X leftrightarrow (Y land Z)) equiv neg(X land neg Y land neg Z)$



This is how far I've come:



$equiv (neg X lor (Y lor Z)) lor (X leftrightarrow (Y land Z))$



$equiv (neg X lor (Y lor Z)) lor ((X rightarrow (Y land Z)) land ((Y land Z) rightarrow X) )$
$equiv (neg X lor (Y lor Z)) lor ((neg X lor (Y land Z)) land (neg (Y land Z) lor X) )$
$equiv (neg X lor (Y lor Z)) lor ((neg X lor (Y land Z)) land (X lor neg (Y land Z)))$
$equiv neg [neg(neg X lor (Y lor Z)) land neg((neg X lor (Y land Z)) land (X lor neg (Y land Z)))]$
$equiv neg[( X land (neg Y land neg Z)) land neg((neg X lor (Y land Z)) land (X lor neg (Y land Z)))]$
$equiv neg[(X land (neg Y land neg Z)) land (neg(neg X lor (Y land Z)) lor neg(X lor neg (Y land Z)))]$
$equiv neg[(X land ( neg Y land neg Z)) land ((X land neg(Y land Z)) lor neg(X land neg (Y land Z))]$
$equiv neg[(X land (neg Y land neg Z)) land ((X land neg(Y land Z)) lor (neg X land (Y land Z)))]$










share|cite|improve this question






















  • Do you require a solution using laaws of logic? Because there are only 3 variables here, so you could just draw a truth table.
    – Josh B.
    Nov 17 at 17:33










  • I don't know for sure, because we have always solved it this way. But you are right, a truth table would be way easier.
    – Marina A.
    Nov 18 at 7:06













up vote
0
down vote

favorite









up vote
0
down vote

favorite











I have to prove the following equivalence:



$(X rightarrow (Y lor Z)) lor (X leftrightarrow (Y land Z)) equiv neg(X land neg Y land neg Z)$



This is how far I've come:



$equiv (neg X lor (Y lor Z)) lor (X leftrightarrow (Y land Z))$



$equiv (neg X lor (Y lor Z)) lor ((X rightarrow (Y land Z)) land ((Y land Z) rightarrow X) )$
$equiv (neg X lor (Y lor Z)) lor ((neg X lor (Y land Z)) land (neg (Y land Z) lor X) )$
$equiv (neg X lor (Y lor Z)) lor ((neg X lor (Y land Z)) land (X lor neg (Y land Z)))$
$equiv neg [neg(neg X lor (Y lor Z)) land neg((neg X lor (Y land Z)) land (X lor neg (Y land Z)))]$
$equiv neg[( X land (neg Y land neg Z)) land neg((neg X lor (Y land Z)) land (X lor neg (Y land Z)))]$
$equiv neg[(X land (neg Y land neg Z)) land (neg(neg X lor (Y land Z)) lor neg(X lor neg (Y land Z)))]$
$equiv neg[(X land ( neg Y land neg Z)) land ((X land neg(Y land Z)) lor neg(X land neg (Y land Z))]$
$equiv neg[(X land (neg Y land neg Z)) land ((X land neg(Y land Z)) lor (neg X land (Y land Z)))]$










share|cite|improve this question













I have to prove the following equivalence:



$(X rightarrow (Y lor Z)) lor (X leftrightarrow (Y land Z)) equiv neg(X land neg Y land neg Z)$



This is how far I've come:



$equiv (neg X lor (Y lor Z)) lor (X leftrightarrow (Y land Z))$



$equiv (neg X lor (Y lor Z)) lor ((X rightarrow (Y land Z)) land ((Y land Z) rightarrow X) )$
$equiv (neg X lor (Y lor Z)) lor ((neg X lor (Y land Z)) land (neg (Y land Z) lor X) )$
$equiv (neg X lor (Y lor Z)) lor ((neg X lor (Y land Z)) land (X lor neg (Y land Z)))$
$equiv neg [neg(neg X lor (Y lor Z)) land neg((neg X lor (Y land Z)) land (X lor neg (Y land Z)))]$
$equiv neg[( X land (neg Y land neg Z)) land neg((neg X lor (Y land Z)) land (X lor neg (Y land Z)))]$
$equiv neg[(X land (neg Y land neg Z)) land (neg(neg X lor (Y land Z)) lor neg(X lor neg (Y land Z)))]$
$equiv neg[(X land ( neg Y land neg Z)) land ((X land neg(Y land Z)) lor neg(X land neg (Y land Z))]$
$equiv neg[(X land (neg Y land neg Z)) land ((X land neg(Y land Z)) lor (neg X land (Y land Z)))]$







logic






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 17 at 16:51









Marina A.

1




1












  • Do you require a solution using laaws of logic? Because there are only 3 variables here, so you could just draw a truth table.
    – Josh B.
    Nov 17 at 17:33










  • I don't know for sure, because we have always solved it this way. But you are right, a truth table would be way easier.
    – Marina A.
    Nov 18 at 7:06


















  • Do you require a solution using laaws of logic? Because there are only 3 variables here, so you could just draw a truth table.
    – Josh B.
    Nov 17 at 17:33










  • I don't know for sure, because we have always solved it this way. But you are right, a truth table would be way easier.
    – Marina A.
    Nov 18 at 7:06
















Do you require a solution using laaws of logic? Because there are only 3 variables here, so you could just draw a truth table.
– Josh B.
Nov 17 at 17:33




Do you require a solution using laaws of logic? Because there are only 3 variables here, so you could just draw a truth table.
– Josh B.
Nov 17 at 17:33












I don't know for sure, because we have always solved it this way. But you are right, a truth table would be way easier.
– Marina A.
Nov 18 at 7:06




I don't know for sure, because we have always solved it this way. But you are right, a truth table would be way easier.
– Marina A.
Nov 18 at 7:06















active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3002567%2fproving-logical-equivalence-with-basic-laws-of-logic%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown






























active

oldest

votes













active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.





Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


Please pay close attention to the following guidance:


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3002567%2fproving-logical-equivalence-with-basic-laws-of-logic%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

AnyDesk - Fatal Program Failure

How to calibrate 16:9 built-in touch-screen to a 4:3 resolution?

QoS: MAC-Priority for clients behind a repeater