Prove falsity of argument schemas in predicate logic
$begingroup$
I have to give a counterexample for the following argument schema:
∃x (Px ∧ Qx) ⊨ ∀x (Px ∨ Qx)
by definig its domain and the interpretation function, which is where I have some slight problems. On a technical level, I think I understood, what's the problem with the schema, namely, that the conclusion is false because of the universal quantifier.
But I don't really understand how to express this in an interpretational function, that proves that the first statement is true, where as the second is false.
examples-counterexamples predicate-logic
asked Dec 9 '18 at 23:15
K. MeyerK. Meyer
62
$endgroup$
add a comment |
$begingroup$
I have to give a counterexample for the following argument schema:
∃x (Px ∧ Qx) ⊨ ∀x (Px ∨ Qx)
by definig its domain and the interpretation function, which is where I have some slight problems. On a technical level, I think I understood, what's the problem with the schema, namely, that the conclusion is false because of the universal quantifier.
But I don't really understand how to express this in an interpretational function, that proves that the first statement is true, where as the second is false.
examples-counterexamples predicate-logic
asked Dec 9 '18 at 23:15
K. MeyerK. Meyer
62
$endgroup$
add a comment |
$begingroup$
I have to give a counterexample for the following argument schema:
∃x (Px ∧ Qx) ⊨ ∀x (Px ∨ Qx)
by definig its domain and the interpretation function, which is where I have some slight problems. On a technical level, I think I understood, what's the problem with the schema, namely, that the conclusion is false because of the universal quantifier.
But I don't really understand how to express this in an interpretational function, that proves that the first statement is true, where as the second is false.
examples-counterexamples predicate-logic
asked Dec 9 '18 at 23:15
K. MeyerK. Meyer
62
$endgroup$
I have to give a counterexample for the following argument schema:
∃x (Px ∧ Qx) ⊨ ∀x (Px ∨ Qx)
by definig its domain and the interpretation function, which is where I have some slight problems. On a technical level, I think I understood, what's the problem with the schema, namely, that the conclusion is false because of the universal quantifier.
But I don't really understand how to express this in an interpretational function, that proves that the first statement is true, where as the second is false.
examples-counterexamples predicate-logic
examples-counterexamples predicate-logic
asked Dec 9 '18 at 23:15
K. MeyerK. Meyer
62
asked Dec 9 '18 at 23:15
K. MeyerK. Meyer
62
asked Dec 9 '18 at 23:15
K. MeyerK. Meyer
62
asked Dec 9 '18 at 23:15
K. MeyerK. Meyer
62
asked Dec 9 '18 at 23:15
K. MeyerK. Meyer
62
62
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You can set the domain to be $mathbb{R}$, so your quantifiers range over that set. And you can define the interpretation $mathcal{I}$ such that,
begin{align*}
mathcal{I}(P)(x)& triangleq x^2 = 4\
mathcal{I}(Q)(x)& triangleq x+2=4
end{align*}
Then your schema becomes,
$$exists xinmathbb{R}. (x^2=4) land (x+2=4)vDash forall xinmathbb{R}. (x^2=4) lor (x+2=4)$$
And it is trivial to show that the first is true taking $x=2$, and that the second is false choosing any $xneq 2$.
answered Dec 9 '18 at 23:54
Jorge AdrianoJorge Adriano
59146
$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%2f3033168%2fprove-falsity-of-argument-schemas-in-predicate-logic%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 can set the domain to be $mathbb{R}$, so your quantifiers range over that set. And you can define the interpretation $mathcal{I}$ such that,
begin{align*}
mathcal{I}(P)(x)& triangleq x^2 = 4\
mathcal{I}(Q)(x)& triangleq x+2=4
end{align*}
Then your schema becomes,
$$exists xinmathbb{R}. (x^2=4) land (x+2=4)vDash forall xinmathbb{R}. (x^2=4) lor (x+2=4)$$
And it is trivial to show that the first is true taking $x=2$, and that the second is false choosing any $xneq 2$.
answered Dec 9 '18 at 23:54
Jorge AdrianoJorge Adriano
59146
$endgroup$
add a comment |
$begingroup$
You can set the domain to be $mathbb{R}$, so your quantifiers range over that set. And you can define the interpretation $mathcal{I}$ such that,
begin{align*}
mathcal{I}(P)(x)& triangleq x^2 = 4\
mathcal{I}(Q)(x)& triangleq x+2=4
end{align*}
Then your schema becomes,
$$exists xinmathbb{R}. (x^2=4) land (x+2=4)vDash forall xinmathbb{R}. (x^2=4) lor (x+2=4)$$
And it is trivial to show that the first is true taking $x=2$, and that the second is false choosing any $xneq 2$.
answered Dec 9 '18 at 23:54
Jorge AdrianoJorge Adriano
59146
$endgroup$
add a comment |
$begingroup$
You can set the domain to be $mathbb{R}$, so your quantifiers range over that set. And you can define the interpretation $mathcal{I}$ such that,
begin{align*}
mathcal{I}(P)(x)& triangleq x^2 = 4\
mathcal{I}(Q)(x)& triangleq x+2=4
end{align*}
Then your schema becomes,
$$exists xinmathbb{R}. (x^2=4) land (x+2=4)vDash forall xinmathbb{R}. (x^2=4) lor (x+2=4)$$
And it is trivial to show that the first is true taking $x=2$, and that the second is false choosing any $xneq 2$.
answered Dec 9 '18 at 23:54
Jorge AdrianoJorge Adriano
59146
$endgroup$
You can set the domain to be $mathbb{R}$, so your quantifiers range over that set. And you can define the interpretation $mathcal{I}$ such that,
begin{align*}
mathcal{I}(P)(x)& triangleq x^2 = 4\
mathcal{I}(Q)(x)& triangleq x+2=4
end{align*}
Then your schema becomes,
$$exists xinmathbb{R}. (x^2=4) land (x+2=4)vDash forall xinmathbb{R}. (x^2=4) lor (x+2=4)$$
And it is trivial to show that the first is true taking $x=2$, and that the second is false choosing any $xneq 2$.
answered Dec 9 '18 at 23:54
Jorge AdrianoJorge Adriano
59146
edited Dec 19 '18 at 15:09
answered Dec 9 '18 at 23:54
Jorge AdrianoJorge Adriano
59146
answered Dec 9 '18 at 23:54
Jorge AdrianoJorge Adriano
59146
answered Dec 9 '18 at 23:54
Jorge AdrianoJorge Adriano
59146
59146
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%2f3033168%2fprove-falsity-of-argument-schemas-in-predicate-logic%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
