prove that a frame is symmetric in modal logic












0












$begingroup$


Im trying to prove or refute that ⋄□A→A characterizes symmetry. I can construct a counterexample, where [W,R, V] would be an interpretation W = {w1,w2}, and the accessibility Relations w1 Rw2, w2 Rw3, Hence the Kripke Frame [W,R] is symmetric. Now Im trying to define a variable assignment that would show that symmetry doesnt hold










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Welcome to MSE. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
    $endgroup$
    – José Carlos Santos
    Dec 9 '18 at 12:42










  • $begingroup$
    Let $A$ be true only in $w_3$. Then $w_1Vdash diamondBox A$.
    $endgroup$
    – Berci
    Dec 9 '18 at 22:26
















0












$begingroup$


Im trying to prove or refute that ⋄□A→A characterizes symmetry. I can construct a counterexample, where [W,R, V] would be an interpretation W = {w1,w2}, and the accessibility Relations w1 Rw2, w2 Rw3, Hence the Kripke Frame [W,R] is symmetric. Now Im trying to define a variable assignment that would show that symmetry doesnt hold










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    Welcome to MSE. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
    $endgroup$
    – José Carlos Santos
    Dec 9 '18 at 12:42










  • $begingroup$
    Let $A$ be true only in $w_3$. Then $w_1Vdash diamondBox A$.
    $endgroup$
    – Berci
    Dec 9 '18 at 22:26














0












0








0





$begingroup$


Im trying to prove or refute that ⋄□A→A characterizes symmetry. I can construct a counterexample, where [W,R, V] would be an interpretation W = {w1,w2}, and the accessibility Relations w1 Rw2, w2 Rw3, Hence the Kripke Frame [W,R] is symmetric. Now Im trying to define a variable assignment that would show that symmetry doesnt hold










share|cite|improve this question











$endgroup$




Im trying to prove or refute that ⋄□A→A characterizes symmetry. I can construct a counterexample, where [W,R, V] would be an interpretation W = {w1,w2}, and the accessibility Relations w1 Rw2, w2 Rw3, Hence the Kripke Frame [W,R] is symmetric. Now Im trying to define a variable assignment that would show that symmetry doesnt hold







logic modal-logic






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 9 '18 at 14:02









David C. Ullrich

60k43994




60k43994










asked Dec 9 '18 at 12:37









Martin LMartin L

61




61








  • 1




    $begingroup$
    Welcome to MSE. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
    $endgroup$
    – José Carlos Santos
    Dec 9 '18 at 12:42










  • $begingroup$
    Let $A$ be true only in $w_3$. Then $w_1Vdash diamondBox A$.
    $endgroup$
    – Berci
    Dec 9 '18 at 22:26














  • 1




    $begingroup$
    Welcome to MSE. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
    $endgroup$
    – José Carlos Santos
    Dec 9 '18 at 12:42










  • $begingroup$
    Let $A$ be true only in $w_3$. Then $w_1Vdash diamondBox A$.
    $endgroup$
    – Berci
    Dec 9 '18 at 22:26








1




1




$begingroup$
Welcome to MSE. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
$endgroup$
– José Carlos Santos
Dec 9 '18 at 12:42




$begingroup$
Welcome to MSE. For some basic information about writing mathematics at this site see, e.g., basic help on mathjax notation, mathjax tutorial and quick reference, main meta site math tutorial and equation editing how-to.
$endgroup$
– José Carlos Santos
Dec 9 '18 at 12:42












$begingroup$
Let $A$ be true only in $w_3$. Then $w_1Vdash diamondBox A$.
$endgroup$
– Berci
Dec 9 '18 at 22:26




$begingroup$
Let $A$ be true only in $w_3$. Then $w_1Vdash diamondBox A$.
$endgroup$
– Berci
Dec 9 '18 at 22:26










1 Answer
1






active

oldest

votes


















0












$begingroup$

I think you need to show that it indeed characterizes symmetry.



Since looking at your start formula:



$diamond square A rightarrow A$



the contra positive must hold:



$neg diamond square A leftarrow neg A$



Applying the definitions of $square A leftrightarrow neg diamond neg A$ and $diamond A leftrightarrow neg square neg A$ you can derive:



$neg neg square neg neg diamond neg A leftarrow neg A$



which then can be simplefied to:



$neg A rightarrow square diamond neg A$



which looks very similar to the definiton of symmetry in modal logic:



$P rightarrow square diamond P$



Also you have a little typo in $w_2 R w_3$, which probably should be $w_2 R w_1$.
I think you can find the rest you need here https://plato.stanford.edu/entries/logic-modal/.



To show that it characterizes symmetry you have to show that $(F models diamond square A rightarrow A) Leftrightarrow (F$ is symmetric). You can do this by proving each implication direction separately. Remember that for a frame $F=<W,R>$ with $F models diamond square A rightarrow A$, it must hold that forall models of the frame $M=<W,R,V>$, $M models diamond square A rightarrow A$






share|cite|improve this answer











$endgroup$













    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
    });


    }
    });














    draft saved

    draft discarded


















    StackExchange.ready(
    function () {
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3032351%2fprove-that-a-frame-is-symmetric-in-modal-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









    0












    $begingroup$

    I think you need to show that it indeed characterizes symmetry.



    Since looking at your start formula:



    $diamond square A rightarrow A$



    the contra positive must hold:



    $neg diamond square A leftarrow neg A$



    Applying the definitions of $square A leftrightarrow neg diamond neg A$ and $diamond A leftrightarrow neg square neg A$ you can derive:



    $neg neg square neg neg diamond neg A leftarrow neg A$



    which then can be simplefied to:



    $neg A rightarrow square diamond neg A$



    which looks very similar to the definiton of symmetry in modal logic:



    $P rightarrow square diamond P$



    Also you have a little typo in $w_2 R w_3$, which probably should be $w_2 R w_1$.
    I think you can find the rest you need here https://plato.stanford.edu/entries/logic-modal/.



    To show that it characterizes symmetry you have to show that $(F models diamond square A rightarrow A) Leftrightarrow (F$ is symmetric). You can do this by proving each implication direction separately. Remember that for a frame $F=<W,R>$ with $F models diamond square A rightarrow A$, it must hold that forall models of the frame $M=<W,R,V>$, $M models diamond square A rightarrow A$






    share|cite|improve this answer











    $endgroup$


















      0












      $begingroup$

      I think you need to show that it indeed characterizes symmetry.



      Since looking at your start formula:



      $diamond square A rightarrow A$



      the contra positive must hold:



      $neg diamond square A leftarrow neg A$



      Applying the definitions of $square A leftrightarrow neg diamond neg A$ and $diamond A leftrightarrow neg square neg A$ you can derive:



      $neg neg square neg neg diamond neg A leftarrow neg A$



      which then can be simplefied to:



      $neg A rightarrow square diamond neg A$



      which looks very similar to the definiton of symmetry in modal logic:



      $P rightarrow square diamond P$



      Also you have a little typo in $w_2 R w_3$, which probably should be $w_2 R w_1$.
      I think you can find the rest you need here https://plato.stanford.edu/entries/logic-modal/.



      To show that it characterizes symmetry you have to show that $(F models diamond square A rightarrow A) Leftrightarrow (F$ is symmetric). You can do this by proving each implication direction separately. Remember that for a frame $F=<W,R>$ with $F models diamond square A rightarrow A$, it must hold that forall models of the frame $M=<W,R,V>$, $M models diamond square A rightarrow A$






      share|cite|improve this answer











      $endgroup$
















        0












        0








        0





        $begingroup$

        I think you need to show that it indeed characterizes symmetry.



        Since looking at your start formula:



        $diamond square A rightarrow A$



        the contra positive must hold:



        $neg diamond square A leftarrow neg A$



        Applying the definitions of $square A leftrightarrow neg diamond neg A$ and $diamond A leftrightarrow neg square neg A$ you can derive:



        $neg neg square neg neg diamond neg A leftarrow neg A$



        which then can be simplefied to:



        $neg A rightarrow square diamond neg A$



        which looks very similar to the definiton of symmetry in modal logic:



        $P rightarrow square diamond P$



        Also you have a little typo in $w_2 R w_3$, which probably should be $w_2 R w_1$.
        I think you can find the rest you need here https://plato.stanford.edu/entries/logic-modal/.



        To show that it characterizes symmetry you have to show that $(F models diamond square A rightarrow A) Leftrightarrow (F$ is symmetric). You can do this by proving each implication direction separately. Remember that for a frame $F=<W,R>$ with $F models diamond square A rightarrow A$, it must hold that forall models of the frame $M=<W,R,V>$, $M models diamond square A rightarrow A$






        share|cite|improve this answer











        $endgroup$



        I think you need to show that it indeed characterizes symmetry.



        Since looking at your start formula:



        $diamond square A rightarrow A$



        the contra positive must hold:



        $neg diamond square A leftarrow neg A$



        Applying the definitions of $square A leftrightarrow neg diamond neg A$ and $diamond A leftrightarrow neg square neg A$ you can derive:



        $neg neg square neg neg diamond neg A leftarrow neg A$



        which then can be simplefied to:



        $neg A rightarrow square diamond neg A$



        which looks very similar to the definiton of symmetry in modal logic:



        $P rightarrow square diamond P$



        Also you have a little typo in $w_2 R w_3$, which probably should be $w_2 R w_1$.
        I think you can find the rest you need here https://plato.stanford.edu/entries/logic-modal/.



        To show that it characterizes symmetry you have to show that $(F models diamond square A rightarrow A) Leftrightarrow (F$ is symmetric). You can do this by proving each implication direction separately. Remember that for a frame $F=<W,R>$ with $F models diamond square A rightarrow A$, it must hold that forall models of the frame $M=<W,R,V>$, $M models diamond square A rightarrow A$







        share|cite|improve this answer














        share|cite|improve this answer



        share|cite|improve this answer








        edited Dec 9 '18 at 16:04

























        answered Dec 9 '18 at 14:02









        LogiCLogiC

        263




        263






























            draft saved

            draft discarded




















































            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.




            draft saved


            draft discarded














            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3032351%2fprove-that-a-frame-is-symmetric-in-modal-logic%23new-answer', 'question_page');
            }
            );

            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







            Popular posts from this blog

            Tonle Sap (See)

            I get strange results when I access the Sqlitedatabase with Unity C# via XAMPP

            Guatemaltekische Davis-Cup-Mannschaft