What are the conditions for RAA?What are the necessary conditions for an action to be regarded as a free choice?Is “nothing” easy to understand?Succinct argument for the fundamental role of binary digits as information unitsConditions for DeductionProof of a Conditional and Discharged AssumptionsAre all sufficient conditions necessary?When does ℱx ≡ (x)ℱx ? What if x has the same domain in both?Satisfaction/validity and variable assignmentsWe do everything for pleasureWhy did we define vacuous statements as true rather than false?

Function argument returning void or non-void type

Why did the person in charge of a principality not just declare themself king?

What are Antecedent & Consequent Phrases in Music?

How did NASA Langley end up with the first 737?

Why do Russians almost not use verbs of possession akin to "have"?

Grade-school elementary algebra presented in an abstract-algebra style?

Dealing with spaghetti codebase, manager asks for things I can't deliver

Is it legal to meet with potential future employers in the UK, whilst visiting from the USA

Why did Theresa May offer a vote on a second Brexit referendum?

Public transport tickets in UK for two weeks

Time complexity of an algorithm: Is it important to state the base of the logarithm?

Why did Drogon spare this character?

Can you output map values in visualforce inline using a string key?

Is my plasma cannon concept viable?

I know that there is a preselected candidate for a position to be filled at my department. What should I do?

Why did Jon Snow do this immoral act if he is so honorable?

Why are GND pads often only connected by four traces?

便利な工具 what does な means

Is this statement about cut time correct?

My players want to grind XP but we're using milestone advancement

What Armor Optimization applies to a Mithral full plate?

Why would a rational buyer offer to buy with no conditions precedent?

Gravitational effects of a single human body on the motion of planets

Should there be an "a" before "ten years imprisonment"?



What are the conditions for RAA?


What are the necessary conditions for an action to be regarded as a free choice?Is “nothing” easy to understand?Succinct argument for the fundamental role of binary digits as information unitsConditions for DeductionProof of a Conditional and Discharged AssumptionsAre all sufficient conditions necessary?When does ℱx ≡ (x)ℱx ? What if x has the same domain in both?Satisfaction/validity and variable assignmentsWe do everything for pleasureWhy did we define vacuous statements as true rather than false?













2















My textbook states that:
enter image description here



In this case, however, what about situations where we can get Q ^ ~Q (sorry, unfamiliar with this formatting) without depending on P? For instance, the proof of EFQ:



1 (1) P A 
2 (2) ~P A
3 (3) ~Q A
1,2 (4) P ^ ~P 1^2
1,2 (5) ~~Q 3,4 RAA
1,2 (6) Q 5 DN


Why isn't it a problem that line 5 does not depend on line 3, when it is the negation of line 3 that we are proving? If we take the above definition of RAA to be true, don't we need 3 to be a dependency of P ^ ~P?










share|improve this question







New contributor



user538118 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.



















  • You have only exchange P and Q... You have derived P ^ ~P from ~Q. Thus, apply RAA rule to get ~~Q.

    – Mauro ALLEGRANZA
    10 hours ago















2















My textbook states that:
enter image description here



In this case, however, what about situations where we can get Q ^ ~Q (sorry, unfamiliar with this formatting) without depending on P? For instance, the proof of EFQ:



1 (1) P A 
2 (2) ~P A
3 (3) ~Q A
1,2 (4) P ^ ~P 1^2
1,2 (5) ~~Q 3,4 RAA
1,2 (6) Q 5 DN


Why isn't it a problem that line 5 does not depend on line 3, when it is the negation of line 3 that we are proving? If we take the above definition of RAA to be true, don't we need 3 to be a dependency of P ^ ~P?










share|improve this question







New contributor



user538118 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.



















  • You have only exchange P and Q... You have derived P ^ ~P from ~Q. Thus, apply RAA rule to get ~~Q.

    – Mauro ALLEGRANZA
    10 hours ago













2












2








2








My textbook states that:
enter image description here



In this case, however, what about situations where we can get Q ^ ~Q (sorry, unfamiliar with this formatting) without depending on P? For instance, the proof of EFQ:



1 (1) P A 
2 (2) ~P A
3 (3) ~Q A
1,2 (4) P ^ ~P 1^2
1,2 (5) ~~Q 3,4 RAA
1,2 (6) Q 5 DN


Why isn't it a problem that line 5 does not depend on line 3, when it is the negation of line 3 that we are proving? If we take the above definition of RAA to be true, don't we need 3 to be a dependency of P ^ ~P?










share|improve this question







New contributor



user538118 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











My textbook states that:
enter image description here



In this case, however, what about situations where we can get Q ^ ~Q (sorry, unfamiliar with this formatting) without depending on P? For instance, the proof of EFQ:



1 (1) P A 
2 (2) ~P A
3 (3) ~Q A
1,2 (4) P ^ ~P 1^2
1,2 (5) ~~Q 3,4 RAA
1,2 (6) Q 5 DN


Why isn't it a problem that line 5 does not depend on line 3, when it is the negation of line 3 that we are proving? If we take the above definition of RAA to be true, don't we need 3 to be a dependency of P ^ ~P?







logic propositional-logic






share|improve this question







New contributor



user538118 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.










share|improve this question







New contributor



user538118 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








share|improve this question




share|improve this question






New contributor



user538118 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








asked 11 hours ago









user538118user538118

132




132




New contributor



user538118 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.




New contributor




user538118 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.














  • You have only exchange P and Q... You have derived P ^ ~P from ~Q. Thus, apply RAA rule to get ~~Q.

    – Mauro ALLEGRANZA
    10 hours ago

















  • You have only exchange P and Q... You have derived P ^ ~P from ~Q. Thus, apply RAA rule to get ~~Q.

    – Mauro ALLEGRANZA
    10 hours ago
















You have only exchange P and Q... You have derived P ^ ~P from ~Q. Thus, apply RAA rule to get ~~Q.

– Mauro ALLEGRANZA
10 hours ago





You have only exchange P and Q... You have derived P ^ ~P from ~Q. Thus, apply RAA rule to get ~~Q.

– Mauro ALLEGRANZA
10 hours ago










2 Answers
2






active

oldest

votes


















4














It only seems like a problem if we think the set Γ is consistent, in which case we feel like it's P which "makes" the premises inconsistent, and so must be used in the proof. But if Γ is already inconsistent, then we don't need to use P at all. Think about it in cases:



If Γ is consistent, and Γ, P ⊢ Q ∧ ¬Q, then Γ, P is inconsistent, so that Γ ⊢ ¬P



If, on the other hand, Γ is already inconsistent (as in your example proof), then Γ ⊢ ¬P anyways (since inconsistent sets of statements can prove anything).






share|improve this answer

























  • Aha that makes sense! Thank you.

    – user538118
    9 hours ago











  • Happy it helped :)

    – Adam
    7 hours ago


















1















Why isn't it a problem that line 5 does not depend on line 3, when it is the negation of line 3 that we are proving?




Because the rule of RAA states that whenever you have Γ, ~Q Ⱶ P ^ ~P , then you may infer that Γ Ⱶ ~~Q



Now, as Γ Ⱶ P ^ ~P when Γ is P, ~P, therefore we can add any additional premise, such as ~Q, and obtain the required sequent so as to be able to apply Reduction To Absurdity: Γ, ~Q Ⱶ P ^ ~P therefore Γ Ⱶ ~~Q



Here's the full sequent notation for the proof:



1 (1) P Ⱶ P A 
2 (2) ~P Ⱶ ~P A
3 (3) ~Q Ⱶ ~Q A
1,2 (4) P, ~P Ⱶ P ^ ~P 1^2
1,2,3 (X) P, ~P, ~Q Ⱶ P ^ ~P 3,4 (skipped this line)
1,2 (5) P, ~P Ⱶ ~~Q X RAA (discharges assumption of ~Q)
1,2 (6) P, ~P Ⱶ Q 5 DN





share|improve this answer























    Your Answer








    StackExchange.ready(function()
    var channelOptions =
    tags: "".split(" "),
    id: "265"
    ;
    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: false,
    noModals: true,
    showLowRepImageUploadWarning: true,
    reputationToPostImages: null,
    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
    );



    );






    user538118 is a new contributor. Be nice, and check out our Code of Conduct.









    draft saved

    draft discarded


















    StackExchange.ready(
    function ()
    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fphilosophy.stackexchange.com%2fquestions%2f63571%2fwhat-are-the-conditions-for-raa%23new-answer', 'question_page');

    );

    Post as a guest















    Required, but never shown

























    2 Answers
    2






    active

    oldest

    votes








    2 Answers
    2






    active

    oldest

    votes









    active

    oldest

    votes






    active

    oldest

    votes









    4














    It only seems like a problem if we think the set Γ is consistent, in which case we feel like it's P which "makes" the premises inconsistent, and so must be used in the proof. But if Γ is already inconsistent, then we don't need to use P at all. Think about it in cases:



    If Γ is consistent, and Γ, P ⊢ Q ∧ ¬Q, then Γ, P is inconsistent, so that Γ ⊢ ¬P



    If, on the other hand, Γ is already inconsistent (as in your example proof), then Γ ⊢ ¬P anyways (since inconsistent sets of statements can prove anything).






    share|improve this answer

























    • Aha that makes sense! Thank you.

      – user538118
      9 hours ago











    • Happy it helped :)

      – Adam
      7 hours ago















    4














    It only seems like a problem if we think the set Γ is consistent, in which case we feel like it's P which "makes" the premises inconsistent, and so must be used in the proof. But if Γ is already inconsistent, then we don't need to use P at all. Think about it in cases:



    If Γ is consistent, and Γ, P ⊢ Q ∧ ¬Q, then Γ, P is inconsistent, so that Γ ⊢ ¬P



    If, on the other hand, Γ is already inconsistent (as in your example proof), then Γ ⊢ ¬P anyways (since inconsistent sets of statements can prove anything).






    share|improve this answer

























    • Aha that makes sense! Thank you.

      – user538118
      9 hours ago











    • Happy it helped :)

      – Adam
      7 hours ago













    4












    4








    4







    It only seems like a problem if we think the set Γ is consistent, in which case we feel like it's P which "makes" the premises inconsistent, and so must be used in the proof. But if Γ is already inconsistent, then we don't need to use P at all. Think about it in cases:



    If Γ is consistent, and Γ, P ⊢ Q ∧ ¬Q, then Γ, P is inconsistent, so that Γ ⊢ ¬P



    If, on the other hand, Γ is already inconsistent (as in your example proof), then Γ ⊢ ¬P anyways (since inconsistent sets of statements can prove anything).






    share|improve this answer















    It only seems like a problem if we think the set Γ is consistent, in which case we feel like it's P which "makes" the premises inconsistent, and so must be used in the proof. But if Γ is already inconsistent, then we don't need to use P at all. Think about it in cases:



    If Γ is consistent, and Γ, P ⊢ Q ∧ ¬Q, then Γ, P is inconsistent, so that Γ ⊢ ¬P



    If, on the other hand, Γ is already inconsistent (as in your example proof), then Γ ⊢ ¬P anyways (since inconsistent sets of statements can prove anything).







    share|improve this answer














    share|improve this answer



    share|improve this answer








    edited 9 hours ago

























    answered 10 hours ago









    AdamAdam

    874112




    874112












    • Aha that makes sense! Thank you.

      – user538118
      9 hours ago











    • Happy it helped :)

      – Adam
      7 hours ago

















    • Aha that makes sense! Thank you.

      – user538118
      9 hours ago











    • Happy it helped :)

      – Adam
      7 hours ago
















    Aha that makes sense! Thank you.

    – user538118
    9 hours ago





    Aha that makes sense! Thank you.

    – user538118
    9 hours ago













    Happy it helped :)

    – Adam
    7 hours ago





    Happy it helped :)

    – Adam
    7 hours ago











    1















    Why isn't it a problem that line 5 does not depend on line 3, when it is the negation of line 3 that we are proving?




    Because the rule of RAA states that whenever you have Γ, ~Q Ⱶ P ^ ~P , then you may infer that Γ Ⱶ ~~Q



    Now, as Γ Ⱶ P ^ ~P when Γ is P, ~P, therefore we can add any additional premise, such as ~Q, and obtain the required sequent so as to be able to apply Reduction To Absurdity: Γ, ~Q Ⱶ P ^ ~P therefore Γ Ⱶ ~~Q



    Here's the full sequent notation for the proof:



    1 (1) P Ⱶ P A 
    2 (2) ~P Ⱶ ~P A
    3 (3) ~Q Ⱶ ~Q A
    1,2 (4) P, ~P Ⱶ P ^ ~P 1^2
    1,2,3 (X) P, ~P, ~Q Ⱶ P ^ ~P 3,4 (skipped this line)
    1,2 (5) P, ~P Ⱶ ~~Q X RAA (discharges assumption of ~Q)
    1,2 (6) P, ~P Ⱶ Q 5 DN





    share|improve this answer



























      1















      Why isn't it a problem that line 5 does not depend on line 3, when it is the negation of line 3 that we are proving?




      Because the rule of RAA states that whenever you have Γ, ~Q Ⱶ P ^ ~P , then you may infer that Γ Ⱶ ~~Q



      Now, as Γ Ⱶ P ^ ~P when Γ is P, ~P, therefore we can add any additional premise, such as ~Q, and obtain the required sequent so as to be able to apply Reduction To Absurdity: Γ, ~Q Ⱶ P ^ ~P therefore Γ Ⱶ ~~Q



      Here's the full sequent notation for the proof:



      1 (1) P Ⱶ P A 
      2 (2) ~P Ⱶ ~P A
      3 (3) ~Q Ⱶ ~Q A
      1,2 (4) P, ~P Ⱶ P ^ ~P 1^2
      1,2,3 (X) P, ~P, ~Q Ⱶ P ^ ~P 3,4 (skipped this line)
      1,2 (5) P, ~P Ⱶ ~~Q X RAA (discharges assumption of ~Q)
      1,2 (6) P, ~P Ⱶ Q 5 DN





      share|improve this answer

























        1












        1








        1








        Why isn't it a problem that line 5 does not depend on line 3, when it is the negation of line 3 that we are proving?




        Because the rule of RAA states that whenever you have Γ, ~Q Ⱶ P ^ ~P , then you may infer that Γ Ⱶ ~~Q



        Now, as Γ Ⱶ P ^ ~P when Γ is P, ~P, therefore we can add any additional premise, such as ~Q, and obtain the required sequent so as to be able to apply Reduction To Absurdity: Γ, ~Q Ⱶ P ^ ~P therefore Γ Ⱶ ~~Q



        Here's the full sequent notation for the proof:



        1 (1) P Ⱶ P A 
        2 (2) ~P Ⱶ ~P A
        3 (3) ~Q Ⱶ ~Q A
        1,2 (4) P, ~P Ⱶ P ^ ~P 1^2
        1,2,3 (X) P, ~P, ~Q Ⱶ P ^ ~P 3,4 (skipped this line)
        1,2 (5) P, ~P Ⱶ ~~Q X RAA (discharges assumption of ~Q)
        1,2 (6) P, ~P Ⱶ Q 5 DN





        share|improve this answer














        Why isn't it a problem that line 5 does not depend on line 3, when it is the negation of line 3 that we are proving?




        Because the rule of RAA states that whenever you have Γ, ~Q Ⱶ P ^ ~P , then you may infer that Γ Ⱶ ~~Q



        Now, as Γ Ⱶ P ^ ~P when Γ is P, ~P, therefore we can add any additional premise, such as ~Q, and obtain the required sequent so as to be able to apply Reduction To Absurdity: Γ, ~Q Ⱶ P ^ ~P therefore Γ Ⱶ ~~Q



        Here's the full sequent notation for the proof:



        1 (1) P Ⱶ P A 
        2 (2) ~P Ⱶ ~P A
        3 (3) ~Q Ⱶ ~Q A
        1,2 (4) P, ~P Ⱶ P ^ ~P 1^2
        1,2,3 (X) P, ~P, ~Q Ⱶ P ^ ~P 3,4 (skipped this line)
        1,2 (5) P, ~P Ⱶ ~~Q X RAA (discharges assumption of ~Q)
        1,2 (6) P, ~P Ⱶ Q 5 DN






        share|improve this answer












        share|improve this answer



        share|improve this answer










        answered 1 hour ago









        Graham KempGraham Kemp

        1,151110




        1,151110




















            user538118 is a new contributor. Be nice, and check out our Code of Conduct.









            draft saved

            draft discarded


















            user538118 is a new contributor. Be nice, and check out our Code of Conduct.












            user538118 is a new contributor. Be nice, and check out our Code of Conduct.











            user538118 is a new contributor. Be nice, and check out our Code of Conduct.














            Thanks for contributing an answer to Philosophy 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.

            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%2fphilosophy.stackexchange.com%2fquestions%2f63571%2fwhat-are-the-conditions-for-raa%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

            Invision Community Contents History See also References External links Navigation menuProprietaryinvisioncommunity.comIPS Community ForumsIPS Community Forumsthis blog entry"License Changes, IP.Board 3.4, and the Future""Interview -- Matt Mecham of Ibforums""CEO Invision Power Board, Matt Mecham Is a Liar, Thief!"IPB License Explanation 1.3, 1.3.1, 2.0, and 2.1ArchivedSecurity Fixes, Updates And Enhancements For IPB 1.3.1Archived"New Demo Accounts - Invision Power Services"the original"New Default Skin"the original"Invision Power Board 3.0.0 and Applications Released"the original"Archived copy"the original"Perpetual licenses being done away with""Release Notes - Invision Power Services""Introducing: IPS Community Suite 4!"Invision Community Release Notes

            Canceling a color specificationRandomly assigning color to Graphics3D objects?Default color for Filling in Mathematica 9Coloring specific elements of sets with a prime modified order in an array plotHow to pick a color differing significantly from the colors already in a given color list?Detection of the text colorColor numbers based on their valueCan color schemes for use with ColorData include opacity specification?My dynamic color schemes

            Ласкавець круглолистий Зміст Опис | Поширення | Галерея | Примітки | Посилання | Навігаційне меню58171138361-22960890446Bupleurum rotundifoliumEuro+Med PlantbasePlants of the World Online — Kew ScienceGermplasm Resources Information Network (GRIN)Ласкавецькн. VI : Літери Ком — Левиправивши або дописавши її