Finding $ alpha $ so that you get two tautologies
$begingroup$
I have this task to solve:
Find (if it exists) such a sentence formula α so that the following formulas are simultaneously
tautologies of the propositional calculus:
$$ (q rightarrow alpha) leftrightarrow (q rightarrow (p wedge r))$$
and
$$ (alpha rightarrow q) leftrightarrow (neg(p vee r) rightarrow q) $$
Generally I have idea to solve this task in use of table. So I created a table with 7 columns:
$p$,$q$,$r$,$(p wedge r)$, $(q rightarrow (p wedge r)$ $(q rightarrow alpha)$, $LS leftrightarrow RS $
and 8 rows with each case. In last column I get these values:
$alpha$, $neg alpha$, $1$, $1$, $neg alpha$, $neg alpha$, $1$, $1$
So if we consider tautology, both $alpha$ and $neg alpha$ should be $1$ so it can't be done. So $alpha$ like that does not exists and I don't have to consider second potential tautology. Have I right?
Eventually, there are other ways to solve tasks like that?
logic propositional-calculus
$endgroup$
|
show 2 more comments
$begingroup$
I have this task to solve:
Find (if it exists) such a sentence formula α so that the following formulas are simultaneously
tautologies of the propositional calculus:
$$ (q rightarrow alpha) leftrightarrow (q rightarrow (p wedge r))$$
and
$$ (alpha rightarrow q) leftrightarrow (neg(p vee r) rightarrow q) $$
Generally I have idea to solve this task in use of table. So I created a table with 7 columns:
$p$,$q$,$r$,$(p wedge r)$, $(q rightarrow (p wedge r)$ $(q rightarrow alpha)$, $LS leftrightarrow RS $
and 8 rows with each case. In last column I get these values:
$alpha$, $neg alpha$, $1$, $1$, $neg alpha$, $neg alpha$, $1$, $1$
So if we consider tautology, both $alpha$ and $neg alpha$ should be $1$ so it can't be done. So $alpha$ like that does not exists and I don't have to consider second potential tautology. Have I right?
Eventually, there are other ways to solve tasks like that?
logic propositional-calculus
$endgroup$
$begingroup$
Have you compared the values of alpha with the values of other columns? Remember, you're looking for a statement or formula, not necessarily a truth value
$endgroup$
– David Diaz
Dec 13 '18 at 20:27
$begingroup$
It should be tautology so $LS leftrightarrow RS $ must be true value. If I represent this by $alpha$ it should be true too. The same thing with $neg alpha $
$endgroup$
– VirtualUser
Dec 13 '18 at 20:30
1
$begingroup$
One could use the method of analytic tableaux.
$endgroup$
– Shaun
Dec 13 '18 at 20:30
$begingroup$
Ok, but my solution is good or not? Thanks for interesting link.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:34
$begingroup$
@VirtualUser Your method of creating a truth-table is fine ... but your conclusion that it cannot be done is not. It can be done. Just see what value, if any, is forced on $alpha$ to make the truth-values come out right in each row. And then just generate an expression for that.
$endgroup$
– Bram28
Dec 13 '18 at 20:35
|
show 2 more comments
$begingroup$
I have this task to solve:
Find (if it exists) such a sentence formula α so that the following formulas are simultaneously
tautologies of the propositional calculus:
$$ (q rightarrow alpha) leftrightarrow (q rightarrow (p wedge r))$$
and
$$ (alpha rightarrow q) leftrightarrow (neg(p vee r) rightarrow q) $$
Generally I have idea to solve this task in use of table. So I created a table with 7 columns:
$p$,$q$,$r$,$(p wedge r)$, $(q rightarrow (p wedge r)$ $(q rightarrow alpha)$, $LS leftrightarrow RS $
and 8 rows with each case. In last column I get these values:
$alpha$, $neg alpha$, $1$, $1$, $neg alpha$, $neg alpha$, $1$, $1$
So if we consider tautology, both $alpha$ and $neg alpha$ should be $1$ so it can't be done. So $alpha$ like that does not exists and I don't have to consider second potential tautology. Have I right?
Eventually, there are other ways to solve tasks like that?
logic propositional-calculus
$endgroup$
I have this task to solve:
Find (if it exists) such a sentence formula α so that the following formulas are simultaneously
tautologies of the propositional calculus:
$$ (q rightarrow alpha) leftrightarrow (q rightarrow (p wedge r))$$
and
$$ (alpha rightarrow q) leftrightarrow (neg(p vee r) rightarrow q) $$
Generally I have idea to solve this task in use of table. So I created a table with 7 columns:
$p$,$q$,$r$,$(p wedge r)$, $(q rightarrow (p wedge r)$ $(q rightarrow alpha)$, $LS leftrightarrow RS $
and 8 rows with each case. In last column I get these values:
$alpha$, $neg alpha$, $1$, $1$, $neg alpha$, $neg alpha$, $1$, $1$
So if we consider tautology, both $alpha$ and $neg alpha$ should be $1$ so it can't be done. So $alpha$ like that does not exists and I don't have to consider second potential tautology. Have I right?
Eventually, there are other ways to solve tasks like that?
logic propositional-calculus
logic propositional-calculus
edited Dec 13 '18 at 20:28
Shaun
9,221113684
9,221113684
asked Dec 13 '18 at 20:23
VirtualUserVirtualUser
865114
865114
$begingroup$
Have you compared the values of alpha with the values of other columns? Remember, you're looking for a statement or formula, not necessarily a truth value
$endgroup$
– David Diaz
Dec 13 '18 at 20:27
$begingroup$
It should be tautology so $LS leftrightarrow RS $ must be true value. If I represent this by $alpha$ it should be true too. The same thing with $neg alpha $
$endgroup$
– VirtualUser
Dec 13 '18 at 20:30
1
$begingroup$
One could use the method of analytic tableaux.
$endgroup$
– Shaun
Dec 13 '18 at 20:30
$begingroup$
Ok, but my solution is good or not? Thanks for interesting link.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:34
$begingroup$
@VirtualUser Your method of creating a truth-table is fine ... but your conclusion that it cannot be done is not. It can be done. Just see what value, if any, is forced on $alpha$ to make the truth-values come out right in each row. And then just generate an expression for that.
$endgroup$
– Bram28
Dec 13 '18 at 20:35
|
show 2 more comments
$begingroup$
Have you compared the values of alpha with the values of other columns? Remember, you're looking for a statement or formula, not necessarily a truth value
$endgroup$
– David Diaz
Dec 13 '18 at 20:27
$begingroup$
It should be tautology so $LS leftrightarrow RS $ must be true value. If I represent this by $alpha$ it should be true too. The same thing with $neg alpha $
$endgroup$
– VirtualUser
Dec 13 '18 at 20:30
1
$begingroup$
One could use the method of analytic tableaux.
$endgroup$
– Shaun
Dec 13 '18 at 20:30
$begingroup$
Ok, but my solution is good or not? Thanks for interesting link.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:34
$begingroup$
@VirtualUser Your method of creating a truth-table is fine ... but your conclusion that it cannot be done is not. It can be done. Just see what value, if any, is forced on $alpha$ to make the truth-values come out right in each row. And then just generate an expression for that.
$endgroup$
– Bram28
Dec 13 '18 at 20:35
$begingroup$
Have you compared the values of alpha with the values of other columns? Remember, you're looking for a statement or formula, not necessarily a truth value
$endgroup$
– David Diaz
Dec 13 '18 at 20:27
$begingroup$
Have you compared the values of alpha with the values of other columns? Remember, you're looking for a statement or formula, not necessarily a truth value
$endgroup$
– David Diaz
Dec 13 '18 at 20:27
$begingroup$
It should be tautology so $LS leftrightarrow RS $ must be true value. If I represent this by $alpha$ it should be true too. The same thing with $neg alpha $
$endgroup$
– VirtualUser
Dec 13 '18 at 20:30
$begingroup$
It should be tautology so $LS leftrightarrow RS $ must be true value. If I represent this by $alpha$ it should be true too. The same thing with $neg alpha $
$endgroup$
– VirtualUser
Dec 13 '18 at 20:30
1
1
$begingroup$
One could use the method of analytic tableaux.
$endgroup$
– Shaun
Dec 13 '18 at 20:30
$begingroup$
One could use the method of analytic tableaux.
$endgroup$
– Shaun
Dec 13 '18 at 20:30
$begingroup$
Ok, but my solution is good or not? Thanks for interesting link.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:34
$begingroup$
Ok, but my solution is good or not? Thanks for interesting link.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:34
$begingroup$
@VirtualUser Your method of creating a truth-table is fine ... but your conclusion that it cannot be done is not. It can be done. Just see what value, if any, is forced on $alpha$ to make the truth-values come out right in each row. And then just generate an expression for that.
$endgroup$
– Bram28
Dec 13 '18 at 20:35
$begingroup$
@VirtualUser Your method of creating a truth-table is fine ... but your conclusion that it cannot be done is not. It can be done. Just see what value, if any, is forced on $alpha$ to make the truth-values come out right in each row. And then just generate an expression for that.
$endgroup$
– Bram28
Dec 13 '18 at 20:35
|
show 2 more comments
1 Answer
1
active
oldest
votes
$begingroup$
You'll eventually get to a correct answer by working out a truth-table (and, as a general method, that is to be preferred over what I'm about to do below), but here is a more direct approach by careful inspection of the statements involved.
First, note that the first conditional holds True whenever $q$ is False, so nothing is required of $alpha$ in the case where $q$ is False. So the only interesting case is where $q$ is True. And in that case, $alpha$ needs to have the same truth-value as $p land r$ in order for the biconditional to be True, i.e. just when $p$ and $r$ are both True.
Likewise, you can immediately see that the second biconditional is True whenever $q$ is True, so here the only interesting case is where $q$ is False, and in that case, the biconditional is True just when $alpha$ has the same value as $neg (p lor r)$, i.e. when both $p$ and $r$ are False.
So, the only cases where $alpha$ should be True are where $q$, $p$, and $r$ are all True, or when they are all False:
$$alpha = (q land p land r) lor (neg q land neg p land neg r)$$
$endgroup$
$begingroup$
Thanks for your reply I think that I have understood this problem, it is interesting alternative for table.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:59
1
$begingroup$
@VirtualUser Yes, the statements were 'nice' enough that I was able to derive it this way pretty quickly ... but the Truth-table method will be more general.
$endgroup$
– Bram28
Dec 13 '18 at 21:13
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%2f3038531%2ffinding-alpha-so-that-you-get-two-tautologies%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$
You'll eventually get to a correct answer by working out a truth-table (and, as a general method, that is to be preferred over what I'm about to do below), but here is a more direct approach by careful inspection of the statements involved.
First, note that the first conditional holds True whenever $q$ is False, so nothing is required of $alpha$ in the case where $q$ is False. So the only interesting case is where $q$ is True. And in that case, $alpha$ needs to have the same truth-value as $p land r$ in order for the biconditional to be True, i.e. just when $p$ and $r$ are both True.
Likewise, you can immediately see that the second biconditional is True whenever $q$ is True, so here the only interesting case is where $q$ is False, and in that case, the biconditional is True just when $alpha$ has the same value as $neg (p lor r)$, i.e. when both $p$ and $r$ are False.
So, the only cases where $alpha$ should be True are where $q$, $p$, and $r$ are all True, or when they are all False:
$$alpha = (q land p land r) lor (neg q land neg p land neg r)$$
$endgroup$
$begingroup$
Thanks for your reply I think that I have understood this problem, it is interesting alternative for table.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:59
1
$begingroup$
@VirtualUser Yes, the statements were 'nice' enough that I was able to derive it this way pretty quickly ... but the Truth-table method will be more general.
$endgroup$
– Bram28
Dec 13 '18 at 21:13
add a comment |
$begingroup$
You'll eventually get to a correct answer by working out a truth-table (and, as a general method, that is to be preferred over what I'm about to do below), but here is a more direct approach by careful inspection of the statements involved.
First, note that the first conditional holds True whenever $q$ is False, so nothing is required of $alpha$ in the case where $q$ is False. So the only interesting case is where $q$ is True. And in that case, $alpha$ needs to have the same truth-value as $p land r$ in order for the biconditional to be True, i.e. just when $p$ and $r$ are both True.
Likewise, you can immediately see that the second biconditional is True whenever $q$ is True, so here the only interesting case is where $q$ is False, and in that case, the biconditional is True just when $alpha$ has the same value as $neg (p lor r)$, i.e. when both $p$ and $r$ are False.
So, the only cases where $alpha$ should be True are where $q$, $p$, and $r$ are all True, or when they are all False:
$$alpha = (q land p land r) lor (neg q land neg p land neg r)$$
$endgroup$
$begingroup$
Thanks for your reply I think that I have understood this problem, it is interesting alternative for table.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:59
1
$begingroup$
@VirtualUser Yes, the statements were 'nice' enough that I was able to derive it this way pretty quickly ... but the Truth-table method will be more general.
$endgroup$
– Bram28
Dec 13 '18 at 21:13
add a comment |
$begingroup$
You'll eventually get to a correct answer by working out a truth-table (and, as a general method, that is to be preferred over what I'm about to do below), but here is a more direct approach by careful inspection of the statements involved.
First, note that the first conditional holds True whenever $q$ is False, so nothing is required of $alpha$ in the case where $q$ is False. So the only interesting case is where $q$ is True. And in that case, $alpha$ needs to have the same truth-value as $p land r$ in order for the biconditional to be True, i.e. just when $p$ and $r$ are both True.
Likewise, you can immediately see that the second biconditional is True whenever $q$ is True, so here the only interesting case is where $q$ is False, and in that case, the biconditional is True just when $alpha$ has the same value as $neg (p lor r)$, i.e. when both $p$ and $r$ are False.
So, the only cases where $alpha$ should be True are where $q$, $p$, and $r$ are all True, or when they are all False:
$$alpha = (q land p land r) lor (neg q land neg p land neg r)$$
$endgroup$
You'll eventually get to a correct answer by working out a truth-table (and, as a general method, that is to be preferred over what I'm about to do below), but here is a more direct approach by careful inspection of the statements involved.
First, note that the first conditional holds True whenever $q$ is False, so nothing is required of $alpha$ in the case where $q$ is False. So the only interesting case is where $q$ is True. And in that case, $alpha$ needs to have the same truth-value as $p land r$ in order for the biconditional to be True, i.e. just when $p$ and $r$ are both True.
Likewise, you can immediately see that the second biconditional is True whenever $q$ is True, so here the only interesting case is where $q$ is False, and in that case, the biconditional is True just when $alpha$ has the same value as $neg (p lor r)$, i.e. when both $p$ and $r$ are False.
So, the only cases where $alpha$ should be True are where $q$, $p$, and $r$ are all True, or when they are all False:
$$alpha = (q land p land r) lor (neg q land neg p land neg r)$$
answered Dec 13 '18 at 20:52
Bram28Bram28
62.6k44793
62.6k44793
$begingroup$
Thanks for your reply I think that I have understood this problem, it is interesting alternative for table.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:59
1
$begingroup$
@VirtualUser Yes, the statements were 'nice' enough that I was able to derive it this way pretty quickly ... but the Truth-table method will be more general.
$endgroup$
– Bram28
Dec 13 '18 at 21:13
add a comment |
$begingroup$
Thanks for your reply I think that I have understood this problem, it is interesting alternative for table.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:59
1
$begingroup$
@VirtualUser Yes, the statements were 'nice' enough that I was able to derive it this way pretty quickly ... but the Truth-table method will be more general.
$endgroup$
– Bram28
Dec 13 '18 at 21:13
$begingroup$
Thanks for your reply I think that I have understood this problem, it is interesting alternative for table.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:59
$begingroup$
Thanks for your reply I think that I have understood this problem, it is interesting alternative for table.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:59
1
1
$begingroup$
@VirtualUser Yes, the statements were 'nice' enough that I was able to derive it this way pretty quickly ... but the Truth-table method will be more general.
$endgroup$
– Bram28
Dec 13 '18 at 21:13
$begingroup$
@VirtualUser Yes, the statements were 'nice' enough that I was able to derive it this way pretty quickly ... but the Truth-table method will be more general.
$endgroup$
– Bram28
Dec 13 '18 at 21:13
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%2f3038531%2ffinding-alpha-so-that-you-get-two-tautologies%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$
Have you compared the values of alpha with the values of other columns? Remember, you're looking for a statement or formula, not necessarily a truth value
$endgroup$
– David Diaz
Dec 13 '18 at 20:27
$begingroup$
It should be tautology so $LS leftrightarrow RS $ must be true value. If I represent this by $alpha$ it should be true too. The same thing with $neg alpha $
$endgroup$
– VirtualUser
Dec 13 '18 at 20:30
1
$begingroup$
One could use the method of analytic tableaux.
$endgroup$
– Shaun
Dec 13 '18 at 20:30
$begingroup$
Ok, but my solution is good or not? Thanks for interesting link.
$endgroup$
– VirtualUser
Dec 13 '18 at 20:34
$begingroup$
@VirtualUser Your method of creating a truth-table is fine ... but your conclusion that it cannot be done is not. It can be done. Just see what value, if any, is forced on $alpha$ to make the truth-values come out right in each row. And then just generate an expression for that.
$endgroup$
– Bram28
Dec 13 '18 at 20:35