Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged quantifiers
0
votes
0
answers
1
quantifiers to express each of these statements.
Let P(x) be the statement x has a cell phone and M(x,y) be the statement x and y have texted over the cell phone, where the domain for the variables x and y consists of all students in your class. Use quantifiers to ... other student in your class. c) Someone in your class has a cell phone but has not texted with anyone else in your class.
Let P(x) be the statement “x has a cell phone” and M(x,y) be the statement “x and y have texted over the cell phone,” where the domain for the variables x and y c...
hussain yasir
507
views
hussain yasir
asked
Jul 7, 2022
Mathematical Logic
quantifiers
mathematical-logic
first-order-logic
+
–
0
votes
0
answers
2
Subject Topic- Mathematical Logic
Manoj Kumar Pandey
240
views
Manoj Kumar Pandey
asked
Mar 25, 2019
Mathematical Logic
quantifiers
discrete-mathematics
mathematical-logic
+
–
0
votes
0
answers
3
geeksforgeeks
Let S(x) be the predicate "x is a student",T(x) be the predicate "x is a teacher"and Q(x,y) be the predicate "x has asked y a question" where the domain consists of all people associated with the school. Use quantifiers to express the statement. "Some student ... ∀x∃y ( ( S(x) ∧ T(y) ) → Q(y,x) ) [ ¬P v Q = P→Q ] None of the options are matching .
Let S(x) be the predicate "x is a student",T(x) be the predicate "x is a teacher"and Q(x,y) be the predicate "x has asked y a question" where the domain consists of all p...
Ashish Goyal
686
views
Ashish Goyal
asked
Jan 23, 2019
Mathematical Logic
propositional-logic
quantifiers
+
–
0
votes
0
answers
4
Kenneth Rosen Edition 6th Exercise 1.4 Question 9f (Page No. 59)
Q) There is somebody whom no one loves L(x,y) : x loves y. Doubt:- Does ∀x ∃y ~L(x,y) will be same as ∃x ∀y ~L(y,x) or both are different please give explaination
Q) There is somebody whom no one loves L(x,y) : x loves y.Doubt:-Does ∀x ∃y ~L(x,y) will be same as ∃x ∀y ~L(y,x) or both are d...
kd.....
418
views
kd.....
asked
Jan 10, 2019
Mathematical Logic
mathematical-logic
kenneth-rosen
discrete-mathematics
propositional-logic
quantifiers
+
–
0
votes
1
answer
5
Kenneth Rosen Edition 6th Exercise 1.3 Question 53 (Page No. 50)
kd.....
394
views
kd.....
asked
Dec 16, 2018
Mathematical Logic
kenneth-rosen
discrete-mathematics
quantifiers
+
–
0
votes
0
answers
6
Kenneth Rosen Edition 6th Exercise 1.4 Question 9 (Page No. 59)
Let L(x, y) be the statement x loves y, where the domain for both x and y consists of all people in the world. Use quantifiers to express each of these statements. g) There is exactly one person whom everybody loves ... There is someone who loves no one besides himself or herself. How these are represented???? The answer given is:-
Let L(x, y) be the statement “x loves y,” where the domainfor both x and y consists of all people in the world.Use quantifiers to express each of these statements.g) ...
Sandy Sharma
371
views
Sandy Sharma
asked
Jul 25, 2018
Mathematical Logic
kenneth-rosen
discrete-mathematics
quantifiers
mathematical-logic
+
–
1
votes
0
answers
7
Kenneth Rosen Edition 6th Exercise 1.4 Question 7 e,f (Page No. 58)
Let T (x, y) mean that student x likes cuisine y, where the domain for x consists of all students at your school and the domain for y consists of all cuisines. Express each of these statements by a simple English sentence. e ... have the same opinion (either they both like it or they both do not like it). How to reach the answers?
Let T (x, y) mean that student x likes cuisine y, where thedomain for x consists of all students at your school andthe domain for y consists of all cuisines. Express each...
Sandy Sharma
811
views
Sandy Sharma
asked
Jul 24, 2018
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
quantifiers
+
–
0
votes
2
answers
8
UGC NET CSE | July 2018 | Part 2 | Question: 85
The equivalence of $\neg \: \exists \: x \: Q \: (x)$ is $\exists \: x \: \neg \: Q \: (x)$ $\forall \: x \: \neg \: Q \: (x)$ $\neg \: \exists \: x \: \neg \: Q \: (x)$ $\forall \: x \: Q \: (x)$
The equivalence of $\neg \: \exists \: x \: Q \: (x)$ is$\exists \: x \: \neg \: Q \: (x)$$\forall \: x \: \neg \: Q \: (x)$$\neg \: \exists \: x \: \neg \: Q \: (x)$$\f...
Pooja Khatri
3.5k
views
Pooja Khatri
asked
Jul 13, 2018
Discrete Mathematics
ugcnetcse-july2018-paper2
discrete-mathematics
quantifiers
+
–
0
votes
1
answer
9
Kenneth Rosen Edition 6th Exercise 1.3 Question 41b (Page No. 49)
Express each of these system specifications using predicates, quantifiers, and logical connectives b) Whenever there is an active alert, all queued messages are transmitted. There are two Solution to this AND Both seems correct to ... And the reason " we don't use implication with ∃x " Which leaves me in confusion.?
Express each of these system specifications using predicates,quantifiers, and logical connectivesb) Whenever there is an active alert, all queued messagesare transmitted....
Sandy Sharma
668
views
Sandy Sharma
asked
Jul 6, 2018
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
quantifiers
+
–
0
votes
1
answer
10
Kenneth Rosen Edition 6th Exercise 1.3 Question 40c (Page No. 49)
Express each of these system specifications using predicates, quantifiers, and logical connectives. c) The file system cannot be backed up if there is a user currently logged on. I got this expression : ∃x(U(x)) -> not F(x) ... the manual is:- Which one is correct? If the manual is correct then why two variables x,y are required?
Express each of these system specifications using predicates,quantifiers, and logical connectives.c) The file system cannot be backed up if there is a usercurrently logge...
Sandy Sharma
1.3k
views
Sandy Sharma
asked
Jul 6, 2018
Mathematical Logic
kenneth-rosen
mathematical-logic
discrete-mathematics
quantifiers
+
–
0
votes
2
answers
11
Kenneth Rosen Edition 6th Exercise 1.4 Question 11f (Page No. 59)
Let S(x) be the predicate x is a student, F(x) the predicate x is a faculty member, and A(x, y) the predicate x has asked y a question, where the domain consists of all people associated with ... member, there exists some student who has not asked that faculty member a question. is both the above statements have same meaning?
Let S(x) be the predicate “x is a student,” F(x) the predicate“x is a faculty member,” and A(x, y) the predicate“x has asked y a question,” where the domain c...
Prince Sindhiya
2.6k
views
Prince Sindhiya
asked
Jul 2, 2018
Mathematical Logic
kenneth-rosen
discrete-mathematics
quantifiers
+
–
0
votes
1
answer
12
Kenneth Rosen Edition 6th Exercise 1.3 Example 27 (Page No. 45)
Q)Consider these statements, of which the first three are and fourth is a valid conclusion. "All hummingbirds are richly colored." "No large birds live on honey." "Birds that do not live on honey are dull in color" "Hummingbirds are small." Express using quantifiers??
Q)Consider these statements, of which the first three are and fourth is a valid conclusion."All hummingbirds are richly colored.""No large birds live on honey.""Birds tha...
Lakshman Bhaiya
9.2k
views
Lakshman Bhaiya
asked
Feb 18, 2018
Mathematical Logic
propositional-logic
kenneth-rosen
discrete-mathematics
quantifiers
+
–
1
votes
0
answers
13
Universal Quantifier (Basics)
Which one of the expression of universal quantifier is ambiguous? For all For every all of for each for any for arbitrary
Which one of the expression of universal quantifier is ambiguous?For allFor everyall offor eachfor anyfor arbitrary
Mk Utkarsh
354
views
Mk Utkarsh
asked
Feb 9, 2018
Mathematical Logic
mathematical-logic
quantifiers
+
–
1
votes
1
answer
14
First Order Logic
A = ∃x (P(x) ^ Q(x)). B = ∃x P(x) ^ ∃x Q(x). Which is correct? a) A => B b) B => A c) A <=> B d) None of These Please Explain.
A = ∃x (P(x) ^ Q(x)).B = ∃x P(x) ^ ∃x Q(x).Which is correct?a) A = Bb) B = Ac) A <= Bd) None of ThesePlease Explain.
nishant279
1.3k
views
nishant279
asked
Oct 18, 2017
Mathematical Logic
discrete-mathematics
mathematical-logic
first-order-logic
propositional-logic
quantifiers
+
–
0
votes
0
answers
15
First Order Logic
A = ∃x(P(x)^Q(x)) B = ∃x P(x) ^ ∃x Q(x), which is correct? a) A <=> B b) A => B c) B => A d) None of These Please Explain.
A = ∃x(P(x)^Q(x))B = ∃x P(x) ^ ∃x Q(x), which is correct?a) A <= Bb) A = Bc) B = Ad) None of ThesePlease Explain.
nishant279
474
views
nishant279
asked
Oct 18, 2017
Mathematical Logic
discrete-mathematics
mathematical-logic
first-order-logic
propositional-logic
quantifiers
+
–
0
votes
0
answers
16
Rosen_Discrete_Mathematics_and_Its_Applications_7th_Edition/Pg.56/Section 1.4 :predicates and quantifiers/Q.43 and Q.44
43. Determine whether ∀x(P(x)→Q(x)) and ∀xP (x)→∀xQ(x) are logically equivalent. Justify your answer.44. Determine whether ∀x(P(x)↔Q(x)) and ∀ x P (x) ↔...
kmr_ndrsh
748
views
kmr_ndrsh
asked
Aug 13, 2017
Mathematical Logic
discrete-mathematics
propositional-logic
quantifiers
+
–
1
votes
0
answers
17
Kenneth Rosen Edition 6th Exercise 1.4 Question 35 (Page No. 61)
Find a common domain for the variables x, y, z, and w for which the statement $∀x∀y∀z∃w((w \neq x) ∧ (w \neq y) ∧ (w \neq z))$ is true and another common domain for these variables for which it is false.
Find a common domain for the variables x, y, z,and w for which the statement $∀x∀y∀z∃w((w \neq x) ∧ (w \neq y) ∧ (w \neq z))$ is true and another common dom...
Ali Jazib Mahmood
701
views
Ali Jazib Mahmood
asked
Jul 25, 2017
Mathematical Logic
discrete-mathematics
kenneth-rosen
domain
mathematical-logic
quantifiers
+
–
3
votes
1
answer
18
Discrete Maths: First Order Logic - Question in my mind based on question from Kenneth Rosen
This is not a direct question from Rosen but a question that popped up in my head as I was solving problems from Rosen. 1) ∀x∃y(x≠y → M(x,y)) 2) ∀x∃y(x≠y ∧ M(x,y)) Here the ... Also, could you please explain the difference between the meaning of these statements (in plain English) if they are different?
This is not a direct question from Rosen but a question that popped up in my head as I was solving problems from Rosen.1) ∀x∃y(x≠y → M(x,y))2) ∀x∃y(x≠y ∧ ...
meghashyamc
741
views
meghashyamc
asked
Jul 12, 2017
Mathematical Logic
quantifiers
discrete-mathematics
mathematical-logic
propositional-logic
kenneth-rosen
+
–
0
votes
0
answers
19
Kenneth Rosen Edition 6th Exercise 1.3 Question 41 c (Page No. 49)
Express using predicate,quantifies and connectives:- The diagnostic monitor tracks status of all systems except main console
Express using predicate,quantifies and connectives:-The diagnostic monitor tracks status of all systems except main console
rahul sharma 5
530
views
rahul sharma 5
asked
Jun 8, 2017
Mathematical Logic
kenneth-rosen
discrete-mathematics
propositional-logic
quantifiers
+
–
1
votes
1
answer
20
Quantifiers
Anup patel
471
views
Anup patel
asked
Jan 2, 2017
Mathematical Logic
quantifiers
+
–
3
votes
2
answers
21
Logic
Everyone has exactly one best friend Are all three below same? Let B(x, y) to be the statement “y is the best friend of x" $ ∀x∃y(B(x, y) ∧ ∀z((z = y)→¬B(x, z))) $ $ ∀x ∃!y (B(x, y) $ $ ∀x ∃y (B(x, y) ∧ ∀z (B(x, z) → (y = z))) $
Everyone has exactly one best friendAre all three below same?Let B(x, y) to be the statement “y is the best friend of x"$ ∀x∃y(B(x, y) ∧ ∀z((z = y)→¬B(x, z))...
Shivam Chauhan
1.0k
views
Shivam Chauhan
asked
Oct 18, 2016
Mathematical Logic
quantifiers
+
–
4
votes
0
answers
22
Multiplicative inverse
Every real number except zero has a multiplicative inverse Are both the statements same? $ ∀x((x != 0) → ∃y(xy = 1)) $ $ ∀x ∃y ((x != 0) → (xy = 1)) $
Every real number except zero has a multiplicative inverseAre both the statements same?$ ∀x((x != 0) → ∃y(xy = 1)) $$ ∀x ∃y ((x != 0) → (xy = 1)) $
Shivam Chauhan
819
views
Shivam Chauhan
asked
Oct 18, 2016
Mathematical Logic
quantifiers
+
–
1
votes
1
answer
23
Kenneth Rosen Edition 6th Exercise 1.3 Example 17 (Page No. 38)
The restriction of a universal quantification is the same as the universal quantification of a conditional statement. For instance, ∀x < 0 (x2 > 0) is another way of expressing ∀x(x < 0 ... whereas existential quantification is same as existential quantification of a conjunction? Please provide proper details. Thank You.
The restriction of a universal quantification is the same as the universal quantificationof a conditional statement. For instance, ∀x < 0 (x2 0) is another way of expr...
Navneet Srivastava
546
views
Navneet Srivastava
asked
Jul 1, 2016
Mathematical Logic
kenneth-rosen
discrete-mathematics
mathematical-logic
propositional-logic
quantifiers
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register