Validity of $(lozengephiwedgelozengepsi) rightarrow...
$begingroup$
I'm trying to answer a question, one part of which asks me to provide either an informal semantic argument or a counterexample to determine whether $(lozengephiwedgelozengepsi) rightarrow (lozenge(phiwedgelozengepsi)veelozenge(psiwedgelozengephi))$ is a valid formula in system K.
It then asks me, for those parts of the question I've found to be false, to determine what conditions I can impose on the accessibility relation in order to make it valid.
I haven't been able to come up with either a proof or a counterexample, so I'd really appreciate any help you could offer. If it turns out that it isn't valid, then some sort of hint for what conditions are necessary would be really helpful too. Thanks!
logic propositional-calculus first-order-logic modal-logic
$endgroup$
add a comment |
$begingroup$
I'm trying to answer a question, one part of which asks me to provide either an informal semantic argument or a counterexample to determine whether $(lozengephiwedgelozengepsi) rightarrow (lozenge(phiwedgelozengepsi)veelozenge(psiwedgelozengephi))$ is a valid formula in system K.
It then asks me, for those parts of the question I've found to be false, to determine what conditions I can impose on the accessibility relation in order to make it valid.
I haven't been able to come up with either a proof or a counterexample, so I'd really appreciate any help you could offer. If it turns out that it isn't valid, then some sort of hint for what conditions are necessary would be really helpful too. Thanks!
logic propositional-calculus first-order-logic modal-logic
$endgroup$
add a comment |
$begingroup$
I'm trying to answer a question, one part of which asks me to provide either an informal semantic argument or a counterexample to determine whether $(lozengephiwedgelozengepsi) rightarrow (lozenge(phiwedgelozengepsi)veelozenge(psiwedgelozengephi))$ is a valid formula in system K.
It then asks me, for those parts of the question I've found to be false, to determine what conditions I can impose on the accessibility relation in order to make it valid.
I haven't been able to come up with either a proof or a counterexample, so I'd really appreciate any help you could offer. If it turns out that it isn't valid, then some sort of hint for what conditions are necessary would be really helpful too. Thanks!
logic propositional-calculus first-order-logic modal-logic
$endgroup$
I'm trying to answer a question, one part of which asks me to provide either an informal semantic argument or a counterexample to determine whether $(lozengephiwedgelozengepsi) rightarrow (lozenge(phiwedgelozengepsi)veelozenge(psiwedgelozengephi))$ is a valid formula in system K.
It then asks me, for those parts of the question I've found to be false, to determine what conditions I can impose on the accessibility relation in order to make it valid.
I haven't been able to come up with either a proof or a counterexample, so I'd really appreciate any help you could offer. If it turns out that it isn't valid, then some sort of hint for what conditions are necessary would be really helpful too. Thanks!
logic propositional-calculus first-order-logic modal-logic
logic propositional-calculus first-order-logic modal-logic
asked Jan 20 at 22:35
jblogjblog
182
182
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Consider a frame with three nodes ${a,b,c}.$ Node $a$ has $b$ and $c$ accessible from it (and $a$ is not accessible from $a).$ No nodes are accessible from $b$ and $c.$ At node $b,$ $phi$ is true and $psi$ is false, whereas at node $c,$ $phi$ is false and $psi$ is true. The statement in question is not true at node $a,$ so it is not valid.
One well-known (but strong) frame condition that guarantees the statement is valid is that the accessibility relation is an equivalence relation, i.e. system S5. In this case, if $lozengephi$ and $lozenge psi$ hold at some node $a$, then the accessible worlds $b$ and $c$ at which $phi$ and $psi$ hold respectively are accessible to each other, so $lozengephi$ and $lozenge psi$ hold at both $b$ and $c.$ Thus, even $lozenge(philand lozenge psi)land lozenge(psiland lozengephi)$ (with a $land,$ not a $lor$) holds at $a.$
A weaker condition that will get us only what we need is that if $aRb$ and $aRc$ then $bRc$ or $cRb.$ (On Wikipedia, they call this $H$ and note that it is given by the axiom $square (square Ato B)lor square(square Bto A).$)
$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%2f3081214%2fvalidity-of-lozenge-phi-wedge-lozenge-psi-rightarrow-lozenge-phi-wedge-l%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$
Consider a frame with three nodes ${a,b,c}.$ Node $a$ has $b$ and $c$ accessible from it (and $a$ is not accessible from $a).$ No nodes are accessible from $b$ and $c.$ At node $b,$ $phi$ is true and $psi$ is false, whereas at node $c,$ $phi$ is false and $psi$ is true. The statement in question is not true at node $a,$ so it is not valid.
One well-known (but strong) frame condition that guarantees the statement is valid is that the accessibility relation is an equivalence relation, i.e. system S5. In this case, if $lozengephi$ and $lozenge psi$ hold at some node $a$, then the accessible worlds $b$ and $c$ at which $phi$ and $psi$ hold respectively are accessible to each other, so $lozengephi$ and $lozenge psi$ hold at both $b$ and $c.$ Thus, even $lozenge(philand lozenge psi)land lozenge(psiland lozengephi)$ (with a $land,$ not a $lor$) holds at $a.$
A weaker condition that will get us only what we need is that if $aRb$ and $aRc$ then $bRc$ or $cRb.$ (On Wikipedia, they call this $H$ and note that it is given by the axiom $square (square Ato B)lor square(square Bto A).$)
$endgroup$
add a comment |
$begingroup$
Consider a frame with three nodes ${a,b,c}.$ Node $a$ has $b$ and $c$ accessible from it (and $a$ is not accessible from $a).$ No nodes are accessible from $b$ and $c.$ At node $b,$ $phi$ is true and $psi$ is false, whereas at node $c,$ $phi$ is false and $psi$ is true. The statement in question is not true at node $a,$ so it is not valid.
One well-known (but strong) frame condition that guarantees the statement is valid is that the accessibility relation is an equivalence relation, i.e. system S5. In this case, if $lozengephi$ and $lozenge psi$ hold at some node $a$, then the accessible worlds $b$ and $c$ at which $phi$ and $psi$ hold respectively are accessible to each other, so $lozengephi$ and $lozenge psi$ hold at both $b$ and $c.$ Thus, even $lozenge(philand lozenge psi)land lozenge(psiland lozengephi)$ (with a $land,$ not a $lor$) holds at $a.$
A weaker condition that will get us only what we need is that if $aRb$ and $aRc$ then $bRc$ or $cRb.$ (On Wikipedia, they call this $H$ and note that it is given by the axiom $square (square Ato B)lor square(square Bto A).$)
$endgroup$
add a comment |
$begingroup$
Consider a frame with three nodes ${a,b,c}.$ Node $a$ has $b$ and $c$ accessible from it (and $a$ is not accessible from $a).$ No nodes are accessible from $b$ and $c.$ At node $b,$ $phi$ is true and $psi$ is false, whereas at node $c,$ $phi$ is false and $psi$ is true. The statement in question is not true at node $a,$ so it is not valid.
One well-known (but strong) frame condition that guarantees the statement is valid is that the accessibility relation is an equivalence relation, i.e. system S5. In this case, if $lozengephi$ and $lozenge psi$ hold at some node $a$, then the accessible worlds $b$ and $c$ at which $phi$ and $psi$ hold respectively are accessible to each other, so $lozengephi$ and $lozenge psi$ hold at both $b$ and $c.$ Thus, even $lozenge(philand lozenge psi)land lozenge(psiland lozengephi)$ (with a $land,$ not a $lor$) holds at $a.$
A weaker condition that will get us only what we need is that if $aRb$ and $aRc$ then $bRc$ or $cRb.$ (On Wikipedia, they call this $H$ and note that it is given by the axiom $square (square Ato B)lor square(square Bto A).$)
$endgroup$
Consider a frame with three nodes ${a,b,c}.$ Node $a$ has $b$ and $c$ accessible from it (and $a$ is not accessible from $a).$ No nodes are accessible from $b$ and $c.$ At node $b,$ $phi$ is true and $psi$ is false, whereas at node $c,$ $phi$ is false and $psi$ is true. The statement in question is not true at node $a,$ so it is not valid.
One well-known (but strong) frame condition that guarantees the statement is valid is that the accessibility relation is an equivalence relation, i.e. system S5. In this case, if $lozengephi$ and $lozenge psi$ hold at some node $a$, then the accessible worlds $b$ and $c$ at which $phi$ and $psi$ hold respectively are accessible to each other, so $lozengephi$ and $lozenge psi$ hold at both $b$ and $c.$ Thus, even $lozenge(philand lozenge psi)land lozenge(psiland lozengephi)$ (with a $land,$ not a $lor$) holds at $a.$
A weaker condition that will get us only what we need is that if $aRb$ and $aRc$ then $bRc$ or $cRb.$ (On Wikipedia, they call this $H$ and note that it is given by the axiom $square (square Ato B)lor square(square Bto A).$)
edited Jan 21 at 1:37
answered Jan 21 at 1:31
spaceisdarkgreenspaceisdarkgreen
33.4k21753
33.4k21753
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%2f3081214%2fvalidity-of-lozenge-phi-wedge-lozenge-psi-rightarrow-lozenge-phi-wedge-l%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