Exact requirements for the redundancy theorem
$begingroup$
I've encounter a few formats which the redundancy theorem could be applied to. Such as,
$B$$C$$A$$+$$overline{A}$$+$$overline{C}$$+$$overline{B}$
$C$$B$$+$$B$$A$$C$$+$$overline{A}$
$B$$C$$+$$overline{A}$$C$$+$$A$$B$
$B$$C$$+$$overline{A}$$overline{C}$$+$$A$$B$
I can't find an exact definition on what to search for and modify it by. Such as,
"Search the line for 3 variables duplicated twice within 3+ terms then delete the terms which contains a not."
which is incorrect but an answer in that type of format is what I am looking for if possible.
boolean-algebra
asked Dec 8 '18 at 2:14
John SmithJohn Smith
64
$endgroup$
add a comment |
$begingroup$
I've encounter a few formats which the redundancy theorem could be applied to. Such as,
$B$$C$$A$$+$$overline{A}$$+$$overline{C}$$+$$overline{B}$
$C$$B$$+$$B$$A$$C$$+$$overline{A}$
$B$$C$$+$$overline{A}$$C$$+$$A$$B$
$B$$C$$+$$overline{A}$$overline{C}$$+$$A$$B$
I can't find an exact definition on what to search for and modify it by. Such as,
"Search the line for 3 variables duplicated twice within 3+ terms then delete the terms which contains a not."
which is incorrect but an answer in that type of format is what I am looking for if possible.
boolean-algebra
asked Dec 8 '18 at 2:14
John SmithJohn Smith
64
$endgroup$
add a comment |
$begingroup$
I've encounter a few formats which the redundancy theorem could be applied to. Such as,
$B$$C$$A$$+$$overline{A}$$+$$overline{C}$$+$$overline{B}$
$C$$B$$+$$B$$A$$C$$+$$overline{A}$
$B$$C$$+$$overline{A}$$C$$+$$A$$B$
$B$$C$$+$$overline{A}$$overline{C}$$+$$A$$B$
I can't find an exact definition on what to search for and modify it by. Such as,
"Search the line for 3 variables duplicated twice within 3+ terms then delete the terms which contains a not."
which is incorrect but an answer in that type of format is what I am looking for if possible.
boolean-algebra
asked Dec 8 '18 at 2:14
John SmithJohn Smith
64
$endgroup$
I've encounter a few formats which the redundancy theorem could be applied to. Such as,
$B$$C$$A$$+$$overline{A}$$+$$overline{C}$$+$$overline{B}$
$C$$B$$+$$B$$A$$C$$+$$overline{A}$
$B$$C$$+$$overline{A}$$C$$+$$A$$B$
$B$$C$$+$$overline{A}$$overline{C}$$+$$A$$B$
I can't find an exact definition on what to search for and modify it by. Such as,
"Search the line for 3 variables duplicated twice within 3+ terms then delete the terms which contains a not."
which is incorrect but an answer in that type of format is what I am looking for if possible.
boolean-algebra
boolean-algebra
asked Dec 8 '18 at 2:14
John SmithJohn Smith
64
asked Dec 8 '18 at 2:14
John SmithJohn Smith
64
edited Dec 8 '18 at 17:02
John Smith
asked Dec 8 '18 at 2:14
John SmithJohn Smith
64
asked Dec 8 '18 at 2:14
John SmithJohn Smith
64
asked Dec 8 '18 at 2:14
John SmithJohn Smith
64
64
add a comment |
add a comment |
0
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',
autoActivateHeartbeat: false,
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
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3030625%2fexact-requirements-for-the-redundancy-theorem%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
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.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3030625%2fexact-requirements-for-the-redundancy-theorem%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
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
