Is there a term for a boolean expression that only consists of atoms, negations of atoms, and a single unique...
$begingroup$
For example:
$a vee b vee c vee neg d$
$a land neg b land neg c land d$
these could be described using the term I'm looking for. The following, however, could not be:
$(a vee b) land (c vee neg d)$
$a vee (neg b land neg c) vee d$
as each contains two distinct operators (other than negation)
logic boolean-algebra
asked Dec 7 '18 at 0:09
ubadububadub
1306
$endgroup$
add a comment |
$begingroup$
For example:
$a vee b vee c vee neg d$
$a land neg b land neg c land d$
these could be described using the term I'm looking for. The following, however, could not be:
$(a vee b) land (c vee neg d)$
$a vee (neg b land neg c) vee d$
as each contains two distinct operators (other than negation)
logic boolean-algebra
asked Dec 7 '18 at 0:09
ubadububadub
1306
$endgroup$
$begingroup$
Your third and fourth are ambiguous anyways. $(avee b)wedge cneq avee(bwedge c)$.
$endgroup$
– JMoravitz
Dec 7 '18 at 0:11
$begingroup$
@JMoravitz I'll edit in parentheses, but that's largely extraneous to the point at hand.
$endgroup$
– ubadub
Dec 7 '18 at 0:36
3
$begingroup$
Clause.
$endgroup$
– Mauro ALLEGRANZA
Dec 7 '18 at 12:16
1
$begingroup$
@MauroALLEGRANZA If you write that as an answer, I'll accept it. Thank you.
$endgroup$
– ubadub
Dec 7 '18 at 15:55
add a comment |
$begingroup$
For example:
$a vee b vee c vee neg d$
$a land neg b land neg c land d$
these could be described using the term I'm looking for. The following, however, could not be:
$(a vee b) land (c vee neg d)$
$a vee (neg b land neg c) vee d$
as each contains two distinct operators (other than negation)
logic boolean-algebra
asked Dec 7 '18 at 0:09
ubadububadub
1306
$endgroup$
For example:
$a vee b vee c vee neg d$
$a land neg b land neg c land d$
these could be described using the term I'm looking for. The following, however, could not be:
$(a vee b) land (c vee neg d)$
$a vee (neg b land neg c) vee d$
as each contains two distinct operators (other than negation)
logic boolean-algebra
logic boolean-algebra
asked Dec 7 '18 at 0:09
ubadububadub
1306
asked Dec 7 '18 at 0:09
ubadububadub
1306
edited Dec 7 '18 at 0:32
ubadub
asked Dec 7 '18 at 0:09
ubadububadub
1306
asked Dec 7 '18 at 0:09
ubadububadub
1306
asked Dec 7 '18 at 0:09
ubadububadub
1306
1306
$begingroup$
Your third and fourth are ambiguous anyways. $(avee b)wedge cneq avee(bwedge c)$.
$endgroup$
– JMoravitz
Dec 7 '18 at 0:11
$begingroup$
@JMoravitz I'll edit in parentheses, but that's largely extraneous to the point at hand.
$endgroup$
– ubadub
Dec 7 '18 at 0:36
3
$begingroup$
Clause.
$endgroup$
– Mauro ALLEGRANZA
Dec 7 '18 at 12:16
1
$begingroup$
@MauroALLEGRANZA If you write that as an answer, I'll accept it. Thank you.
$endgroup$
– ubadub
Dec 7 '18 at 15:55
add a comment |
$begingroup$
Your third and fourth are ambiguous anyways. $(avee b)wedge cneq avee(bwedge c)$.
$endgroup$
– JMoravitz
Dec 7 '18 at 0:11
$begingroup$
@JMoravitz I'll edit in parentheses, but that's largely extraneous to the point at hand.
$endgroup$
– ubadub
Dec 7 '18 at 0:36
3
$begingroup$
Clause.
$endgroup$
– Mauro ALLEGRANZA
Dec 7 '18 at 12:16
1
$begingroup$
@MauroALLEGRANZA If you write that as an answer, I'll accept it. Thank you.
$endgroup$
– ubadub
Dec 7 '18 at 15:55
$begingroup$
Your third and fourth are ambiguous anyways. $(avee b)wedge cneq avee(bwedge c)$.
$endgroup$
– JMoravitz
Dec 7 '18 at 0:11
$begingroup$
Your third and fourth are ambiguous anyways. $(avee b)wedge cneq avee(bwedge c)$.
$endgroup$
– JMoravitz
Dec 7 '18 at 0:11
$begingroup$
@JMoravitz I'll edit in parentheses, but that's largely extraneous to the point at hand.
$endgroup$
– ubadub
Dec 7 '18 at 0:36
$begingroup$
@JMoravitz I'll edit in parentheses, but that's largely extraneous to the point at hand.
$endgroup$
– ubadub
Dec 7 '18 at 0:36
3
3
$begingroup$
Clause.
$endgroup$
– Mauro ALLEGRANZA
Dec 7 '18 at 12:16
$begingroup$
Clause.
$endgroup$
– Mauro ALLEGRANZA
Dec 7 '18 at 12:16
1
1
$begingroup$
@MauroALLEGRANZA If you write that as an answer, I'll accept it. Thank you.
$endgroup$
– ubadub
Dec 7 '18 at 15:55
$begingroup$
@MauroALLEGRANZA If you write that as an answer, I'll accept it. Thank you.
$endgroup$
– ubadub
Dec 7 '18 at 15:55
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
In logic, a clause is an expression formed from a finite collection of literals (atoms or their negations) that is true either whenever at least one of the literals that form it is true (a disjunctive clause), or when all of the literals that form it are true (a conjunctive clause).
answered Dec 8 '18 at 9:58
Mauro ALLEGRANZAMauro ALLEGRANZA
65.4k448112
$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%2f3029257%2fis-there-a-term-for-a-boolean-expression-that-only-consists-of-atoms-negations%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$
In logic, a clause is an expression formed from a finite collection of literals (atoms or their negations) that is true either whenever at least one of the literals that form it is true (a disjunctive clause), or when all of the literals that form it are true (a conjunctive clause).
answered Dec 8 '18 at 9:58
Mauro ALLEGRANZAMauro ALLEGRANZA
65.4k448112
$endgroup$
add a comment |
$begingroup$
In logic, a clause is an expression formed from a finite collection of literals (atoms or their negations) that is true either whenever at least one of the literals that form it is true (a disjunctive clause), or when all of the literals that form it are true (a conjunctive clause).
answered Dec 8 '18 at 9:58
Mauro ALLEGRANZAMauro ALLEGRANZA
65.4k448112
$endgroup$
add a comment |
$begingroup$
In logic, a clause is an expression formed from a finite collection of literals (atoms or their negations) that is true either whenever at least one of the literals that form it is true (a disjunctive clause), or when all of the literals that form it are true (a conjunctive clause).
answered Dec 8 '18 at 9:58
Mauro ALLEGRANZAMauro ALLEGRANZA
65.4k448112
$endgroup$
In logic, a clause is an expression formed from a finite collection of literals (atoms or their negations) that is true either whenever at least one of the literals that form it is true (a disjunctive clause), or when all of the literals that form it are true (a conjunctive clause).
answered Dec 8 '18 at 9:58
Mauro ALLEGRANZAMauro ALLEGRANZA
65.4k448112
answered Dec 8 '18 at 9:58
Mauro ALLEGRANZAMauro ALLEGRANZA
65.4k448112
answered Dec 8 '18 at 9:58
Mauro ALLEGRANZAMauro ALLEGRANZA
65.4k448112
answered Dec 8 '18 at 9:58
Mauro ALLEGRANZAMauro ALLEGRANZA
65.4k448112
65.4k448112
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%2f3029257%2fis-there-a-term-for-a-boolean-expression-that-only-consists-of-atoms-negations%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
$begingroup$
Your third and fourth are ambiguous anyways. $(avee b)wedge cneq avee(bwedge c)$.
$endgroup$
– JMoravitz
Dec 7 '18 at 0:11
$begingroup$
@JMoravitz I'll edit in parentheses, but that's largely extraneous to the point at hand.
$endgroup$
– ubadub
Dec 7 '18 at 0:36
3
$begingroup$
Clause.
$endgroup$
– Mauro ALLEGRANZA
Dec 7 '18 at 12:16
1
$begingroup$
@MauroALLEGRANZA If you write that as an answer, I'll accept it. Thank you.
$endgroup$
– ubadub
Dec 7 '18 at 15:55