If F satisfiable then ¬F is unsatisfiable.
$begingroup$
If F satisfiable then ¬F is unsatisfiable. I know this is false and to show this I need to show a contradiction, this is my attempted answer, any ideas where I'm going wrong, this is revision for an exam.
[A]α = ¬(¬[A]))
= ¬([A])
= ¬ (0)
= 1
logic propositional-calculus first-order-logic satisfiability
asked Jan 16 at 15:55
OCTAVIANOCTAVIAN
83
$endgroup$
add a comment |
$begingroup$
If F satisfiable then ¬F is unsatisfiable. I know this is false and to show this I need to show a contradiction, this is my attempted answer, any ideas where I'm going wrong, this is revision for an exam.
[A]α = ¬(¬[A]))
= ¬([A])
= ¬ (0)
= 1
logic propositional-calculus first-order-logic satisfiability
asked Jan 16 at 15:55
OCTAVIANOCTAVIAN
83
$endgroup$
add a comment |
$begingroup$
If F satisfiable then ¬F is unsatisfiable. I know this is false and to show this I need to show a contradiction, this is my attempted answer, any ideas where I'm going wrong, this is revision for an exam.
[A]α = ¬(¬[A]))
= ¬([A])
= ¬ (0)
= 1
logic propositional-calculus first-order-logic satisfiability
asked Jan 16 at 15:55
OCTAVIANOCTAVIAN
83
$endgroup$
If F satisfiable then ¬F is unsatisfiable. I know this is false and to show this I need to show a contradiction, this is my attempted answer, any ideas where I'm going wrong, this is revision for an exam.
[A]α = ¬(¬[A]))
= ¬([A])
= ¬ (0)
= 1
logic propositional-calculus first-order-logic satisfiability
logic propositional-calculus first-order-logic satisfiability
asked Jan 16 at 15:55
OCTAVIANOCTAVIAN
83
asked Jan 16 at 15:55
OCTAVIANOCTAVIAN
83
asked Jan 16 at 15:55
OCTAVIANOCTAVIAN
83
asked Jan 16 at 15:55
OCTAVIANOCTAVIAN
83
asked Jan 16 at 15:55
OCTAVIANOCTAVIAN
83
83
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
In propositional logic, a formula $F$ is satisfiable when there is a valuation (or : truth-assignment) $v$ such that $v(F)=$ t (in first-order logic : when there is an interpretation that makes the formula true).
This does not implies that its negation is unsatisfiable.
Consider the simple example of a formula $F := p$, where $p$ is a sentential letter.
Clearly $F$ is sat, and also $lnot F$ is sat.
But there are many more : $p lor q, p to q, p land q, ldots$
The interesting relation is :
if a formula $F$ is unsatisfiable, then $lnot F$ is a tautology (i.e. always true).
answered Jan 16 at 16:14
Mauro ALLEGRANZAMauro ALLEGRANZA
67.7k449117
$endgroup$
$begingroup$
what do you mean by that example p is a sentential letter?
$endgroup$
– OCTAVIAN
Jan 16 at 17:02
$begingroup$
@Octavian - it is the formula $p$ (made of one only symbol).
$endgroup$
– Mauro ALLEGRANZA
Jan 16 at 19:31
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%2f3075900%2fif-f-satisfiable-then-%25c2%25acf-is-unsatisfiable%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 propositional logic, a formula $F$ is satisfiable when there is a valuation (or : truth-assignment) $v$ such that $v(F)=$ t (in first-order logic : when there is an interpretation that makes the formula true).
This does not implies that its negation is unsatisfiable.
Consider the simple example of a formula $F := p$, where $p$ is a sentential letter.
Clearly $F$ is sat, and also $lnot F$ is sat.
But there are many more : $p lor q, p to q, p land q, ldots$
The interesting relation is :
if a formula $F$ is unsatisfiable, then $lnot F$ is a tautology (i.e. always true).
answered Jan 16 at 16:14
Mauro ALLEGRANZAMauro ALLEGRANZA
67.7k449117
$endgroup$
$begingroup$
what do you mean by that example p is a sentential letter?
$endgroup$
– OCTAVIAN
Jan 16 at 17:02
$begingroup$
@Octavian - it is the formula $p$ (made of one only symbol).
$endgroup$
– Mauro ALLEGRANZA
Jan 16 at 19:31
add a comment |
$begingroup$
In propositional logic, a formula $F$ is satisfiable when there is a valuation (or : truth-assignment) $v$ such that $v(F)=$ t (in first-order logic : when there is an interpretation that makes the formula true).
This does not implies that its negation is unsatisfiable.
Consider the simple example of a formula $F := p$, where $p$ is a sentential letter.
Clearly $F$ is sat, and also $lnot F$ is sat.
But there are many more : $p lor q, p to q, p land q, ldots$
The interesting relation is :
if a formula $F$ is unsatisfiable, then $lnot F$ is a tautology (i.e. always true).
answered Jan 16 at 16:14
Mauro ALLEGRANZAMauro ALLEGRANZA
67.7k449117
$endgroup$
$begingroup$
what do you mean by that example p is a sentential letter?
$endgroup$
– OCTAVIAN
Jan 16 at 17:02
$begingroup$
@Octavian - it is the formula $p$ (made of one only symbol).
$endgroup$
– Mauro ALLEGRANZA
Jan 16 at 19:31
add a comment |
$begingroup$
In propositional logic, a formula $F$ is satisfiable when there is a valuation (or : truth-assignment) $v$ such that $v(F)=$ t (in first-order logic : when there is an interpretation that makes the formula true).
This does not implies that its negation is unsatisfiable.
Consider the simple example of a formula $F := p$, where $p$ is a sentential letter.
Clearly $F$ is sat, and also $lnot F$ is sat.
But there are many more : $p lor q, p to q, p land q, ldots$
The interesting relation is :
if a formula $F$ is unsatisfiable, then $lnot F$ is a tautology (i.e. always true).
answered Jan 16 at 16:14
Mauro ALLEGRANZAMauro ALLEGRANZA
67.7k449117
$endgroup$
In propositional logic, a formula $F$ is satisfiable when there is a valuation (or : truth-assignment) $v$ such that $v(F)=$ t (in first-order logic : when there is an interpretation that makes the formula true).
This does not implies that its negation is unsatisfiable.
Consider the simple example of a formula $F := p$, where $p$ is a sentential letter.
Clearly $F$ is sat, and also $lnot F$ is sat.
But there are many more : $p lor q, p to q, p land q, ldots$
The interesting relation is :
if a formula $F$ is unsatisfiable, then $lnot F$ is a tautology (i.e. always true).
answered Jan 16 at 16:14
Mauro ALLEGRANZAMauro ALLEGRANZA
67.7k449117
edited Jan 18 at 19:41
answered Jan 16 at 16:14
Mauro ALLEGRANZAMauro ALLEGRANZA
67.7k449117
answered Jan 16 at 16:14
Mauro ALLEGRANZAMauro ALLEGRANZA
67.7k449117
answered Jan 16 at 16:14
Mauro ALLEGRANZAMauro ALLEGRANZA
67.7k449117
67.7k449117
$begingroup$
what do you mean by that example p is a sentential letter?
$endgroup$
– OCTAVIAN
Jan 16 at 17:02
$begingroup$
@Octavian - it is the formula $p$ (made of one only symbol).
$endgroup$
– Mauro ALLEGRANZA
Jan 16 at 19:31
add a comment |
$begingroup$
what do you mean by that example p is a sentential letter?
$endgroup$
– OCTAVIAN
Jan 16 at 17:02
$begingroup$
@Octavian - it is the formula $p$ (made of one only symbol).
$endgroup$
– Mauro ALLEGRANZA
Jan 16 at 19:31
$begingroup$
what do you mean by that example p is a sentential letter?
$endgroup$
– OCTAVIAN
Jan 16 at 17:02
$begingroup$
what do you mean by that example p is a sentential letter?
$endgroup$
– OCTAVIAN
Jan 16 at 17:02
$begingroup$
@Octavian - it is the formula $p$ (made of one only symbol).
$endgroup$
– Mauro ALLEGRANZA
Jan 16 at 19:31
$begingroup$
@Octavian - it is the formula $p$ (made of one only symbol).
$endgroup$
– Mauro ALLEGRANZA
Jan 16 at 19:31
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%2f3075900%2fif-f-satisfiable-then-%25c2%25acf-is-unsatisfiable%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
