how to prove that (P⊃Q)≡(¬Q⊃¬P) ( P ⊃ Q ) ≡ ( ¬ Q ⊃ ¬ P ) is disallowed in intuitionistic...












2












$begingroup$


this is what I've tried;



define kripke model K=({0,1},≤,⊩) where ≤ is the (total) order relation over {0,1} defined by
0≤0 0≤ 11≤1,and ⊩ is a binary relation from {0,1} to the set of propositional variables such that 0⊮A and 1⊩A and 1⊮B and 0⊩B. then



1⊮(A⊃B)≡(¬B⊃¬A) ( B ⊃ A ) ≡ ( ¬ B ⊃ ¬ A )



can somebody tell me if this is correct or if there are errors, what are they and how can they be corrected?






logic intuitionistic-logic







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    A special case of that with $P = top$ would be $Q equiv lnot lnot Q$...
    $endgroup$
    – Daniel Schepler
    Dec 5 '18 at 23:11










  • $begingroup$
    @DanielSchepler P=T? could you please clarify what you mean? I appreciate you trying to help and I need to know how to prove this soon
    $endgroup$
    – katerine
    Dec 5 '18 at 23:33










  • $begingroup$
    I'm not sure what your question here is. If $P$ is the true proposition, then $(P supset Q) = (top supset Q) equiv Q$ and $(lnot Q supset lnot P) = (lnot Q supset lnot top) equiv (lnot Q supset bot) equiv lnot lnot Q$.
    $endgroup$
    – Daniel Schepler
    Dec 5 '18 at 23:37








  • 2




    $begingroup$
    In a Kripke model, if $0 Vdash B$ and $0 leq 1$, then $1 Vdash B$ too—theorem’s can’t become “unproved”.
    $endgroup$
    – ryan221b
    Dec 6 '18 at 0:57






  • 1




    $begingroup$
    Already asked and answered here.
    $endgroup$
    – Mauro ALLEGRANZA
    Dec 6 '18 at 7:45
















2












$begingroup$


this is what I've tried;



define kripke model K=({0,1},≤,⊩) where ≤ is the (total) order relation over {0,1} defined by
0≤0 0≤ 11≤1,and ⊩ is a binary relation from {0,1} to the set of propositional variables such that 0⊮A and 1⊩A and 1⊮B and 0⊩B. then



1⊮(A⊃B)≡(¬B⊃¬A) ( B ⊃ A ) ≡ ( ¬ B ⊃ ¬ A )



can somebody tell me if this is correct or if there are errors, what are they and how can they be corrected?






logic intuitionistic-logic







share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    A special case of that with $P = top$ would be $Q equiv lnot lnot Q$...
    $endgroup$
    – Daniel Schepler
    Dec 5 '18 at 23:11










  • $begingroup$
    @DanielSchepler P=T? could you please clarify what you mean? I appreciate you trying to help and I need to know how to prove this soon
    $endgroup$
    – katerine
    Dec 5 '18 at 23:33










  • $begingroup$
    I'm not sure what your question here is. If $P$ is the true proposition, then $(P supset Q) = (top supset Q) equiv Q$ and $(lnot Q supset lnot P) = (lnot Q supset lnot top) equiv (lnot Q supset bot) equiv lnot lnot Q$.
    $endgroup$
    – Daniel Schepler
    Dec 5 '18 at 23:37








  • 2




    $begingroup$
    In a Kripke model, if $0 Vdash B$ and $0 leq 1$, then $1 Vdash B$ too—theorem’s can’t become “unproved”.
    $endgroup$
    – ryan221b
    Dec 6 '18 at 0:57






  • 1




    $begingroup$
    Already asked and answered here.
    $endgroup$
    – Mauro ALLEGRANZA
    Dec 6 '18 at 7:45














2












2








2


1



$begingroup$


this is what I've tried;



define kripke model K=({0,1},≤,⊩) where ≤ is the (total) order relation over {0,1} defined by
0≤0 0≤ 11≤1,and ⊩ is a binary relation from {0,1} to the set of propositional variables such that 0⊮A and 1⊩A and 1⊮B and 0⊩B. then



1⊮(A⊃B)≡(¬B⊃¬A) ( B ⊃ A ) ≡ ( ¬ B ⊃ ¬ A )



can somebody tell me if this is correct or if there are errors, what are they and how can they be corrected?






logic intuitionistic-logic







share|cite|improve this question











$endgroup$




this is what I've tried;



define kripke model K=({0,1},≤,⊩) where ≤ is the (total) order relation over {0,1} defined by
0≤0 0≤ 11≤1,and ⊩ is a binary relation from {0,1} to the set of propositional variables such that 0⊮A and 1⊩A and 1⊮B and 0⊩B. then



1⊮(A⊃B)≡(¬B⊃¬A) ( B ⊃ A ) ≡ ( ¬ B ⊃ ¬ A )



can somebody tell me if this is correct or if there are errors, what are they and how can they be corrected?






logic intuitionistic-logic




logic intuitionistic-logic






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 5 '18 at 23:03







katerine

















asked Dec 5 '18 at 21:11









katerinekaterine

405




405








  • 1




    $begingroup$
    A special case of that with $P = top$ would be $Q equiv lnot lnot Q$...
    $endgroup$
    – Daniel Schepler
    Dec 5 '18 at 23:11










  • $begingroup$
    @DanielSchepler P=T? could you please clarify what you mean? I appreciate you trying to help and I need to know how to prove this soon
    $endgroup$
    – katerine
    Dec 5 '18 at 23:33










  • $begingroup$
    I'm not sure what your question here is. If $P$ is the true proposition, then $(P supset Q) = (top supset Q) equiv Q$ and $(lnot Q supset lnot P) = (lnot Q supset lnot top) equiv (lnot Q supset bot) equiv lnot lnot Q$.
    $endgroup$
    – Daniel Schepler
    Dec 5 '18 at 23:37








  • 2




    $begingroup$
    In a Kripke model, if $0 Vdash B$ and $0 leq 1$, then $1 Vdash B$ too—theorem’s can’t become “unproved”.
    $endgroup$
    – ryan221b
    Dec 6 '18 at 0:57






  • 1




    $begingroup$
    Already asked and answered here.
    $endgroup$
    – Mauro ALLEGRANZA
    Dec 6 '18 at 7:45














  • 1




    $begingroup$
    A special case of that with $P = top$ would be $Q equiv lnot lnot Q$...
    $endgroup$
    – Daniel Schepler
    Dec 5 '18 at 23:11










  • $begingroup$
    @DanielSchepler P=T? could you please clarify what you mean? I appreciate you trying to help and I need to know how to prove this soon
    $endgroup$
    – katerine
    Dec 5 '18 at 23:33










  • $begingroup$
    I'm not sure what your question here is. If $P$ is the true proposition, then $(P supset Q) = (top supset Q) equiv Q$ and $(lnot Q supset lnot P) = (lnot Q supset lnot top) equiv (lnot Q supset bot) equiv lnot lnot Q$.
    $endgroup$
    – Daniel Schepler
    Dec 5 '18 at 23:37








  • 2




    $begingroup$
    In a Kripke model, if $0 Vdash B$ and $0 leq 1$, then $1 Vdash B$ too—theorem’s can’t become “unproved”.
    $endgroup$
    – ryan221b
    Dec 6 '18 at 0:57






  • 1




    $begingroup$
    Already asked and answered here.
    $endgroup$
    – Mauro ALLEGRANZA
    Dec 6 '18 at 7:45








1




1




$begingroup$
A special case of that with $P = top$ would be $Q equiv lnot lnot Q$...
$endgroup$
– Daniel Schepler
Dec 5 '18 at 23:11




$begingroup$
A special case of that with $P = top$ would be $Q equiv lnot lnot Q$...
$endgroup$
– Daniel Schepler
Dec 5 '18 at 23:11












$begingroup$
@DanielSchepler P=T? could you please clarify what you mean? I appreciate you trying to help and I need to know how to prove this soon
$endgroup$
– katerine
Dec 5 '18 at 23:33




$begingroup$
@DanielSchepler P=T? could you please clarify what you mean? I appreciate you trying to help and I need to know how to prove this soon
$endgroup$
– katerine
Dec 5 '18 at 23:33












$begingroup$
I'm not sure what your question here is. If $P$ is the true proposition, then $(P supset Q) = (top supset Q) equiv Q$ and $(lnot Q supset lnot P) = (lnot Q supset lnot top) equiv (lnot Q supset bot) equiv lnot lnot Q$.
$endgroup$
– Daniel Schepler
Dec 5 '18 at 23:37






$begingroup$
I'm not sure what your question here is. If $P$ is the true proposition, then $(P supset Q) = (top supset Q) equiv Q$ and $(lnot Q supset lnot P) = (lnot Q supset lnot top) equiv (lnot Q supset bot) equiv lnot lnot Q$.
$endgroup$
– Daniel Schepler
Dec 5 '18 at 23:37






2




2




$begingroup$
In a Kripke model, if $0 Vdash B$ and $0 leq 1$, then $1 Vdash B$ too—theorem’s can’t become “unproved”.
$endgroup$
– ryan221b
Dec 6 '18 at 0:57




$begingroup$
In a Kripke model, if $0 Vdash B$ and $0 leq 1$, then $1 Vdash B$ too—theorem’s can’t become “unproved”.
$endgroup$
– ryan221b
Dec 6 '18 at 0:57




1




1




$begingroup$
Already asked and answered here.
$endgroup$
– Mauro ALLEGRANZA
Dec 6 '18 at 7:45




$begingroup$
Already asked and answered here.
$endgroup$
– Mauro ALLEGRANZA
Dec 6 '18 at 7:45










1 Answer
1






active

oldest

votes


















2












$begingroup$

I am a bit confused by your notation, so I think this may only be a partial answer, but I hope it helps.



Note that intuitionistically, as classically, $(A supset B) supset (lnot B supset lnot A)$; so to show that the two aren't equivalent, we're going to have to produce a counterexample to $(lnot B supset lnot A) supset (A supset B)$.



I'm assuming you are familiar with Kripke semantics (quick reminder here: https://math.stackexchange.com/a/3027858/446689). Consider this structure:



enter image description here




  • Since $1Vdash B$, we have $0notVdashlnot B$ and $1notVdashlnot B$, so $0Vdash (lnot B supset lnot A)$.

  • On the other hand, $0Vdash A$ but $0notVdash B$, so $0notVdash (A supset B)$.


Therefore, $0notVdash (lnot B supset lnot A) supset (A supset B)$, and so $0notVdash (A supset B) equiv (lnot B supset lnot A)$.




You also seem to consider $(B supset A) equiv (lnot B supset lnot A)$, but this is even classically false!






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%2f3027656%2fhow-to-prove-that-p%25e2%258a%2583q%25e2%2589%25a1%25c2%25acq%25e2%258a%2583%25c2%25acp-p-%25e2%258a%2583-q-%25e2%2589%25a1-%25c2%25ac-q-%25e2%258a%2583-%25c2%25ac-p-is-disallowed-in-intui%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









    2












    $begingroup$

    I am a bit confused by your notation, so I think this may only be a partial answer, but I hope it helps.



    Note that intuitionistically, as classically, $(A supset B) supset (lnot B supset lnot A)$; so to show that the two aren't equivalent, we're going to have to produce a counterexample to $(lnot B supset lnot A) supset (A supset B)$.



    I'm assuming you are familiar with Kripke semantics (quick reminder here: https://math.stackexchange.com/a/3027858/446689). Consider this structure:



    enter image description here




    • Since $1Vdash B$, we have $0notVdashlnot B$ and $1notVdashlnot B$, so $0Vdash (lnot B supset lnot A)$.

    • On the other hand, $0Vdash A$ but $0notVdash B$, so $0notVdash (A supset B)$.


    Therefore, $0notVdash (lnot B supset lnot A) supset (A supset B)$, and so $0notVdash (A supset B) equiv (lnot B supset lnot A)$.




    You also seem to consider $(B supset A) equiv (lnot B supset lnot A)$, but this is even classically false!






    share|cite|improve this answer









    $endgroup$


















      2












      $begingroup$

      I am a bit confused by your notation, so I think this may only be a partial answer, but I hope it helps.



      Note that intuitionistically, as classically, $(A supset B) supset (lnot B supset lnot A)$; so to show that the two aren't equivalent, we're going to have to produce a counterexample to $(lnot B supset lnot A) supset (A supset B)$.



      I'm assuming you are familiar with Kripke semantics (quick reminder here: https://math.stackexchange.com/a/3027858/446689). Consider this structure:



      enter image description here




      • Since $1Vdash B$, we have $0notVdashlnot B$ and $1notVdashlnot B$, so $0Vdash (lnot B supset lnot A)$.

      • On the other hand, $0Vdash A$ but $0notVdash B$, so $0notVdash (A supset B)$.


      Therefore, $0notVdash (lnot B supset lnot A) supset (A supset B)$, and so $0notVdash (A supset B) equiv (lnot B supset lnot A)$.




      You also seem to consider $(B supset A) equiv (lnot B supset lnot A)$, but this is even classically false!






      share|cite|improve this answer









      $endgroup$
















        2












        2








        2





        $begingroup$

        I am a bit confused by your notation, so I think this may only be a partial answer, but I hope it helps.



        Note that intuitionistically, as classically, $(A supset B) supset (lnot B supset lnot A)$; so to show that the two aren't equivalent, we're going to have to produce a counterexample to $(lnot B supset lnot A) supset (A supset B)$.



        I'm assuming you are familiar with Kripke semantics (quick reminder here: https://math.stackexchange.com/a/3027858/446689). Consider this structure:



        enter image description here




        • Since $1Vdash B$, we have $0notVdashlnot B$ and $1notVdashlnot B$, so $0Vdash (lnot B supset lnot A)$.

        • On the other hand, $0Vdash A$ but $0notVdash B$, so $0notVdash (A supset B)$.


        Therefore, $0notVdash (lnot B supset lnot A) supset (A supset B)$, and so $0notVdash (A supset B) equiv (lnot B supset lnot A)$.




        You also seem to consider $(B supset A) equiv (lnot B supset lnot A)$, but this is even classically false!






        share|cite|improve this answer









        $endgroup$



        I am a bit confused by your notation, so I think this may only be a partial answer, but I hope it helps.



        Note that intuitionistically, as classically, $(A supset B) supset (lnot B supset lnot A)$; so to show that the two aren't equivalent, we're going to have to produce a counterexample to $(lnot B supset lnot A) supset (A supset B)$.



        I'm assuming you are familiar with Kripke semantics (quick reminder here: https://math.stackexchange.com/a/3027858/446689). Consider this structure:



        enter image description here




        • Since $1Vdash B$, we have $0notVdashlnot B$ and $1notVdashlnot B$, so $0Vdash (lnot B supset lnot A)$.

        • On the other hand, $0Vdash A$ but $0notVdash B$, so $0notVdash (A supset B)$.


        Therefore, $0notVdash (lnot B supset lnot A) supset (A supset B)$, and so $0notVdash (A supset B) equiv (lnot B supset lnot A)$.




        You also seem to consider $(B supset A) equiv (lnot B supset lnot A)$, but this is even classically false!







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Dec 6 '18 at 2:01









        ryan221bryan221b

        9510




        9510






























            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%2f3027656%2fhow-to-prove-that-p%25e2%258a%2583q%25e2%2589%25a1%25c2%25acq%25e2%258a%2583%25c2%25acp-p-%25e2%258a%2583-q-%25e2%2589%25a1-%25c2%25ac-q-%25e2%258a%2583-%25c2%25ac-p-is-disallowed-in-intui%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

            How to change which sound is reproduced for terminal bell?

            Image
            3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question
            Read more

            Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

            Image
            up vote 5 down vote favorite 2 I would like to make it so that the vertical space below the title of each chapter is the same when using the Bjornstrup package (i.e. so that the descenders do not affect the spacing - as shown by the red arrow in the picture below). I think I'm fairly happy with the spacing around "A chapter", so I'd really like titles without descenders (e.g. "Contents") to have the same vertical spacing as "A chapter" below the title. I would also like to remove the large "0" in the contents title. Any help appreciated, as always. documentclass[11pt,a4paper]{book} % Packages[![enter image description here][1]][1] usepackage[left=3.5cm, right=3.5cm, top=4.3cm, bottom=4.25cm]{geometry} usepackage[utf8]{inputenc} usepackage{libertine} usepackage[libertine]{newtx
            Read more

            Can I use Tabulator js library in my java Spring + Thymeleaf project?

            Image
            0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"
            Read more