GATE | GATE-CS-2015 (Set 2) | Question 65 - GeeksforGeeks

11 Oct, 2021
Which one of the following well formed formulae is a tautology?
(A) A(B) B(C) C(D) DAnswer: (C)Explanation:  
In logic, a tautology is a formula that is true in every possible interpretation.
All options here are based on order of application of quantifier.So, there are 2 rules:
The positions of the same type of quantifiers can be switched
The positions of different types of quantifiers cannot be switched.
Now, let’s see the Choices of the question:
Option (a)
Sign <-> represents “not equivalent”.
∀x∃y R( x, y ) is not equivalent to ∃Y ∀X R( X, Y )
Let R( X, Y ) represent X < Y for the set of numbers as the universe, for example.
Then ∀X ∃Y R( X, Y ) reads “for every number x, there is a number y that is greater than x”, which is true, while∃Y ∀X R( X, Y ) reads “there is a number that is greater than every (any) number”, which is not true. So this option is rejected.
Option (d)
Sign -> represents “euivalent”
 ∀X ∀Y R( X, Y ) is equivalent to ∀X ∀Y R( Y, X )
Let R( X, Y ) represent X < Y for the set of numbers as the universe, for example.
Then ∀X ∀Y R( X, Y ) reads “for every number X, there is every Y that is greater than x”,while ∀X ∀Y R( Y, X ) reads “for every number Y, there is every X that is greater than Y”.
And both can’t be equivalent (because at one time, one will be true and other one will be false) So this option isrejected.
Option (b) is clearly rejected as two predicate can’t be equivalent to one predicate only. So Option (c) is the correct one.Explanation for Pption (c) – as position of the quantifier is not changed and since LHS P -> R = ⌐P ᴠ R which is equal to RHS.Option c is tautology and correct answer too.
Note: For solving proposition logic question, always remember not to try with rules only. Just take an exampleand see if options are satisfying it or not. Because for a particular example, three options will give same result andone will be different. And different one is your answer.
For basics to this question, you can refer to:http://www.cs.odu.edu/~cs381/cs381content/logic/pred_logic/quantification/quantification.html
This explanation has been contributed by Nitika Bansal.
YouTubeGeeksforGeeks GATE Computer Science16.3K subscribersNested Quantifiers with Sakshi Singhal | GeeksforGeeks GATEWatch laterShareCopy linkInfoShoppingTap to unmuteIf playback doesn't begin shortly, try restarting your device.You're signed outVideos you watch may be added to the TV's watch history and influence TV recommendations. To avoid this, cancel and sign in to YouTube on your computer.CancelConfirmMore videosMore videosSwitch cameraShareInclude playlistAn error occurred while retrieving sharing information. Please try again later.Watch on0:000:0021:49 / 40:44•Live•<div class="player-unavailable"><h1 class="message">An error occurred.</h1><div class="submessage"><a href="https://www.youtube.com/watch?v=Yv-yu4gsWCs" target="_blank">Try watching this video on www.youtube.com</a>, or enable JavaScript if it is disabled in your browser.</div></div>Quiz of this Question
GATE-CS-2015 (Set 2)
GATE-GATE-CS-2015 (Set 2)
GATE
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
GATE | Gate IT 2007 | Question 25
GATE | GATE-CS-2000 | Question 41
GATE | GATE-CS-2001 | Question 39
GATE | GATE-CS-2005 | Question 6
GATE | GATE MOCK 2017 | Question 21
GATE | GATE-CS-2006 | Question 47
GATE | GATE MOCK 2017 | Question 24
GATE | Gate IT 2008 | Question 43
GATE | GATE-CS-2009 | Question 38
GATE | GATE-CS-2003 | Question 90