“nothing” in boolean algebra
$begingroup$
Is there formal notation for saying "there is no x for which P(x)" or is it simply something like $( neg exists x) P(x)$?
notation boolean-algebra
$endgroup$
add a comment |
$begingroup$
Is there formal notation for saying "there is no x for which P(x)" or is it simply something like $( neg exists x) P(x)$?
notation boolean-algebra
$endgroup$
4
$begingroup$
There's nothing informal about using words. Words are great.
$endgroup$
– Misha Lavrov
Jan 8 at 20:48
$begingroup$
@MishaLavrov Sorry, I meant formal notation. I will revise my wording.
$endgroup$
– NetherGranite
Jan 8 at 20:50
3
$begingroup$
I would use parentheses a little differently but you have the basic idea: $lnot (exists x P(x))$
$endgroup$
– hardmath
Jan 8 at 20:52
3
$begingroup$
$not exists x mid P(x)$
$endgroup$
– Kuifje
Jan 8 at 20:55
$begingroup$
In boolean algebra, wouldn't this just be "For all $x$, $P(x)=0$"? (I mean if it were a logic circuit, you'd just take the $P(x)$ signal directly from the OV supply raill . . .)
$endgroup$
– timtfj
Jan 8 at 22:02
add a comment |
$begingroup$
Is there formal notation for saying "there is no x for which P(x)" or is it simply something like $( neg exists x) P(x)$?
notation boolean-algebra
$endgroup$
Is there formal notation for saying "there is no x for which P(x)" or is it simply something like $( neg exists x) P(x)$?
notation boolean-algebra
notation boolean-algebra
edited Jan 8 at 20:51
NetherGranite
asked Jan 8 at 20:45
NetherGraniteNetherGranite
1417
1417
4
$begingroup$
There's nothing informal about using words. Words are great.
$endgroup$
– Misha Lavrov
Jan 8 at 20:48
$begingroup$
@MishaLavrov Sorry, I meant formal notation. I will revise my wording.
$endgroup$
– NetherGranite
Jan 8 at 20:50
3
$begingroup$
I would use parentheses a little differently but you have the basic idea: $lnot (exists x P(x))$
$endgroup$
– hardmath
Jan 8 at 20:52
3
$begingroup$
$not exists x mid P(x)$
$endgroup$
– Kuifje
Jan 8 at 20:55
$begingroup$
In boolean algebra, wouldn't this just be "For all $x$, $P(x)=0$"? (I mean if it were a logic circuit, you'd just take the $P(x)$ signal directly from the OV supply raill . . .)
$endgroup$
– timtfj
Jan 8 at 22:02
add a comment |
4
$begingroup$
There's nothing informal about using words. Words are great.
$endgroup$
– Misha Lavrov
Jan 8 at 20:48
$begingroup$
@MishaLavrov Sorry, I meant formal notation. I will revise my wording.
$endgroup$
– NetherGranite
Jan 8 at 20:50
3
$begingroup$
I would use parentheses a little differently but you have the basic idea: $lnot (exists x P(x))$
$endgroup$
– hardmath
Jan 8 at 20:52
3
$begingroup$
$not exists x mid P(x)$
$endgroup$
– Kuifje
Jan 8 at 20:55
$begingroup$
In boolean algebra, wouldn't this just be "For all $x$, $P(x)=0$"? (I mean if it were a logic circuit, you'd just take the $P(x)$ signal directly from the OV supply raill . . .)
$endgroup$
– timtfj
Jan 8 at 22:02
4
4
$begingroup$
There's nothing informal about using words. Words are great.
$endgroup$
– Misha Lavrov
Jan 8 at 20:48
$begingroup$
There's nothing informal about using words. Words are great.
$endgroup$
– Misha Lavrov
Jan 8 at 20:48
$begingroup$
@MishaLavrov Sorry, I meant formal notation. I will revise my wording.
$endgroup$
– NetherGranite
Jan 8 at 20:50
$begingroup$
@MishaLavrov Sorry, I meant formal notation. I will revise my wording.
$endgroup$
– NetherGranite
Jan 8 at 20:50
3
3
$begingroup$
I would use parentheses a little differently but you have the basic idea: $lnot (exists x P(x))$
$endgroup$
– hardmath
Jan 8 at 20:52
$begingroup$
I would use parentheses a little differently but you have the basic idea: $lnot (exists x P(x))$
$endgroup$
– hardmath
Jan 8 at 20:52
3
3
$begingroup$
$not exists x mid P(x)$
$endgroup$
– Kuifje
Jan 8 at 20:55
$begingroup$
$not exists x mid P(x)$
$endgroup$
– Kuifje
Jan 8 at 20:55
$begingroup$
In boolean algebra, wouldn't this just be "For all $x$, $P(x)=0$"? (I mean if it were a logic circuit, you'd just take the $P(x)$ signal directly from the OV supply raill . . .)
$endgroup$
– timtfj
Jan 8 at 22:02
$begingroup$
In boolean algebra, wouldn't this just be "For all $x$, $P(x)=0$"? (I mean if it were a logic circuit, you'd just take the $P(x)$ signal directly from the OV supply raill . . .)
$endgroup$
– timtfj
Jan 8 at 22:02
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
There's no established symbol analogous to $forall$ or $exists$, no. You can write either $neg exists x. P(x)$ or $forall x. neg P(x)$.
$endgroup$
add a comment |
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%2f3066689%2fnothing-in-boolean-algebra%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
There's no established symbol analogous to $forall$ or $exists$, no. You can write either $neg exists x. P(x)$ or $forall x. neg P(x)$.
$endgroup$
add a comment |
$begingroup$
There's no established symbol analogous to $forall$ or $exists$, no. You can write either $neg exists x. P(x)$ or $forall x. neg P(x)$.
$endgroup$
add a comment |
$begingroup$
There's no established symbol analogous to $forall$ or $exists$, no. You can write either $neg exists x. P(x)$ or $forall x. neg P(x)$.
$endgroup$
There's no established symbol analogous to $forall$ or $exists$, no. You can write either $neg exists x. P(x)$ or $forall x. neg P(x)$.
answered Jan 8 at 20:51
Daniel McLauryDaniel McLaury
15.6k32977
15.6k32977
add a comment |
add a comment |
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%2f3066689%2fnothing-in-boolean-algebra%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
4
$begingroup$
There's nothing informal about using words. Words are great.
$endgroup$
– Misha Lavrov
Jan 8 at 20:48
$begingroup$
@MishaLavrov Sorry, I meant formal notation. I will revise my wording.
$endgroup$
– NetherGranite
Jan 8 at 20:50
3
$begingroup$
I would use parentheses a little differently but you have the basic idea: $lnot (exists x P(x))$
$endgroup$
– hardmath
Jan 8 at 20:52
3
$begingroup$
$not exists x mid P(x)$
$endgroup$
– Kuifje
Jan 8 at 20:55
$begingroup$
In boolean algebra, wouldn't this just be "For all $x$, $P(x)=0$"? (I mean if it were a logic circuit, you'd just take the $P(x)$ signal directly from the OV supply raill . . .)
$endgroup$
– timtfj
Jan 8 at 22:02