UGC NET CSE | October 2020 | Part 2 | Question: 38

Which of the following pairs of propositions are not logically equivalent?$((p \rightarrow r) \wedge (q \rightarrow r))$ and $((p \vee q) \rightarrow r)$$p \leftrightarro...

go_editor

2.4k views

go_editor asked Nov 20, 2020

Discrete Mathematics
ugcnetcse-oct2020-paper2
discrete-mathematics
mathematical-logic

+ –

0 votes

1 answer

go_editor asked Nov 20, 2020

1,137 views

UGC NET CSE | October 2020 | Part 2 | Question: 37
If $f(x)=x$ is my friend, and $p(x) =x$ is perfect, then correct logical translation of the statement “some of my friends are not perfect” is ______ $\forall _x (f(x) \wedge \neg p(x))$ $\exists _x (f(x) \wedge \neg p(x))$ $\neg (f(x) \wedge \neg p(x))$ $\exists _x (\neg f(x) \wedge \neg p(x))$

If $f(x)=x$ is my friend, and $p(x) =x$ is perfect, then correct logical translation of the statement “some of my friends are not perfect” is ______$\forall _x (f(x) ...

go_editor

1.1k views

go_editor asked Nov 20, 2020

Discrete Mathematics
ugcnetcse-oct2020-paper2
discrete-mathematics
mathematical-logic

+ –

1 votes

2 answers

go_editor asked Nov 20, 2020

956 views

UGC NET CSE | October 2020 | Part 2 | Question: 26
Let $G$ be a directed graph whose vertex set is the set of numbers from $1$ to $100$. There is an edge from a vertex $i$ to a vertex $j$ if and only if either $j=i+1$ or $j=3i$. The minimum number of edges in a path in $G$ from vertex $1$ to vertex $100$ is ______ $23$ $99$ $4$ $7$

Let $G$ be a directed graph whose vertex set is the set of numbers from $1$ to $100$. There is an edge from a vertex $i$ to a vertex $j$ if and only if either $j=i+1$ or ...

go_editor

956 views

go_editor asked Nov 20, 2020

Discrete Mathematics
ugcnetcse-oct2020-paper2
discrete-mathematics
graph-theory

+ –

2 votes

1 answer

go_editor asked Nov 20, 2020

990 views

UGC NET CSE | October 2020 | Part 2 | Question: 40
Consider the following argument with premise $\forall _x (P(x) \vee Q(x))$ and conclusion $(\forall _x P(x)) \wedge (\forall _x Q(x))$ ... $(E)$ are not correct inferences Steps $(D)$ and $(F)$ are not correct inferences Step $(G)$ is not a correct inference

Consider the following argument with premise $\forall _x (P(x) \vee Q(x))$ and conclusion $(\forall _x P(x)) \wedge (\forall _x Q(x))$$\begin{array}{|ll|l|} \hline (A) & ...

go_editor

990 views

go_editor asked Nov 20, 2020

Discrete Mathematics
ugcnetcse-oct2020-paper2
discrete-mathematics
first-order-logic

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

0

0