Complexity of n conjuction in basis {v, ¬}











up vote
1
down vote

favorite












Please, tell me how to prove that complexity of x1&x2&...&xn in basis {v,¬} = 2n. It is obvious that complexity <= 2n ¬(¬x1v¬x2v...v¬xn), but how to shom that complexity can not be less?










share|cite|improve this question


















  • 1




    How do you define complexity of a formula?
    – Berci
    Nov 14 at 22:02










  • It is number of operations in formula.
    – Che4ako
    Nov 16 at 6:39















up vote
1
down vote

favorite












Please, tell me how to prove that complexity of x1&x2&...&xn in basis {v,¬} = 2n. It is obvious that complexity <= 2n ¬(¬x1v¬x2v...v¬xn), but how to shom that complexity can not be less?










share|cite|improve this question


















  • 1




    How do you define complexity of a formula?
    – Berci
    Nov 14 at 22:02










  • It is number of operations in formula.
    – Che4ako
    Nov 16 at 6:39













up vote
1
down vote

favorite









up vote
1
down vote

favorite











Please, tell me how to prove that complexity of x1&x2&...&xn in basis {v,¬} = 2n. It is obvious that complexity <= 2n ¬(¬x1v¬x2v...v¬xn), but how to shom that complexity can not be less?










share|cite|improve this question













Please, tell me how to prove that complexity of x1&x2&...&xn in basis {v,¬} = 2n. It is obvious that complexity <= 2n ¬(¬x1v¬x2v...v¬xn), but how to shom that complexity can not be less?







logic computational-complexity






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Nov 14 at 21:51









Che4ako

111




111








  • 1




    How do you define complexity of a formula?
    – Berci
    Nov 14 at 22:02










  • It is number of operations in formula.
    – Che4ako
    Nov 16 at 6:39














  • 1




    How do you define complexity of a formula?
    – Berci
    Nov 14 at 22:02










  • It is number of operations in formula.
    – Che4ako
    Nov 16 at 6:39








1




1




How do you define complexity of a formula?
– Berci
Nov 14 at 22:02




How do you define complexity of a formula?
– Berci
Nov 14 at 22:02












It is number of operations in formula.
– Che4ako
Nov 16 at 6:39




It is number of operations in formula.
– Che4ako
Nov 16 at 6:39















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%2f2998870%2fcomplexity-of-n-conjuction-in-basis-v-%25c2%25ac%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



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2998870%2fcomplexity-of-n-conjuction-in-basis-v-%25c2%25ac%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

Plaza Victoria

Puebla de Zaragoza

Musa