Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Webpage for Mathematical Logic
Important Question Types:
Checking validity of First Order Logic Statements
Checking validity of Propositional Logic
Recent questions tagged mathematical-logic
12
votes
2
answers
91
GO Classes CS Test Series 2025 | Discrete Mathematics | Topic Wise Test 1 | Question: 7
Let $P(x)$ and $Q(x)$ be predicates and let $D$ denote the domain of the predicate variable $x$. Consider the following universal conditional statement, $ \forall x \in D, P(x) \rightarrow Q(x) . $ Which of the following conditions ... is true for all $x \in D$. $P(x) \vee Q(x)$ is true for all $x \in D$.
Let $P(x)$ and $Q(x)$ be predicates and let $D$ denote the domain of the predicate variable $x$. Consider the following universal conditional statement,$$\forall x \in D,...
GO Classes
301
views
GO Classes
asked
Apr 18, 2023
Mathematical Logic
goclasses_2025_cs_dm_tw_1
goclasses
mathematical-logic
first-order-logic
multiple-selects
moderate
2-marks
+
–
5
votes
1
answer
92
GO Classes CS Test Series 2025 | Discrete Mathematics | Topic Wise Test 1 | Question: 8
Let $P(x), Q(x), R(x)$ and $S(x)$ denote the following predicates with domain $\mathbb{Z}$ ... $\forall x \in \mathbb{Z}, \quad S(x) \rightarrow(Q(x) \wedge S(x))$
Let $P(x), Q(x), R(x)$ and $S(x)$ denote the following predicates with domain $\mathbb{Z}$ :$$\begin{aligned}& P(x): x^2-x-12=0, \\& Q(x): x \text { is odd, } \\& R(x): x...
GO Classes
269
views
GO Classes
asked
Apr 18, 2023
Mathematical Logic
goclasses_2025_cs_dm_tw_1
goclasses
mathematical-logic
first-order-logic
multiple-selects
moderate
2-marks
+
–
9
votes
1
answer
93
GO Classes CS Test Series 2025 | Discrete Mathematics | Topic Wise Test 1 | Question: 15
Let's make a trip to a new world called "Never Never Land". Regular, ordinary first-order logic has two quantifiers: $\forall$ and $\exists$. Now, let's imagine we lived in a world in which these quantifiers ... $\mathrm{Nx}(\neg A(x) \wedge B(x))$
Let's make a trip to a new world called "Never Never Land".Regular, ordinary first-order logic has two quantifiers: $\forall$ and $\exists$.Now, let's imagine we lived in...
GO Classes
357
views
GO Classes
asked
Apr 18, 2023
Mathematical Logic
goclasses_2025_cs_dm_tw_1
goclasses
mathematical-logic
first-order-logic
difficult
2-marks
+
–
1
votes
3
answers
94
Discrete Mathematics | Predicate Logic
Which of the following conclusion can be drawn from the following premises $\left ( 1 \right )\sim P\vee Q\rightarrow R$ $\left ( 2 \right )S\vee \sim Q$ $\left ( 3 \right )\sim T$ $\left ( 4 \right )P\rightarrow T$ $\left ( 5 \right )\sim P\wedge R\rightarrow \sim S$ $C1: P$ $C2: \sim Q$ $C3: Q\wedge R$ C1 only C2 only C2 & C3 only C1 & C2 only
Which of the following conclusion can be drawn from the following premises$\left ( 1 \right )\sim P\vee Q\rightarrow R$$\left ( 2 \right )S\vee \sim Q$$\left ( 3 \right )...
Jay Patel 009
505
views
Jay Patel 009
asked
Apr 18, 2023
Mathematical Logic
discrete-mathematics
mathematical-logic
first-order-logic
+
–
3
votes
2
answers
95
Discrete Mathematics | Propositional Logic | Test 2 | Question: 1
Let $\Phi$ be a well-formed formula having atleast one occurrence of atomic variable $x.$ Consider $\Psi$ be any formula. Now, $_x\Phi_{\Psi}$ is the formula obtained by replacing each occurrence of $x$ by $\Psi$ in $\Phi$ and ... Only (i) is correct Only (ii) is correct Both (i) and (ii) are correct None of the above
Let $\Phi$ be a well-formed formula having atleast one occurrence of atomic variable $x.$ Consider $\Psi$ be any formula. Now, $_x\Phi_{\Psi}$ is the formula obtained by ...
ankitgupta.1729
510
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
mathematical-logic
propositional-logic
1-mark
+
–
1
votes
1
answer
96
Discrete Mathematics | Propositional Logic | Test 2 | Question: 2
Consider the following argument: Either logic is difficult, or not many students like it. If mathematics is easy, then logic is not difficult. $\textit{Therefore,}$ if many students like logic, mathematics is not ... then $P \rightarrow Q$ is a tautology Validity of the given argument can't be determined
Consider the following argument: Either logic is difficult, or not many students like it. If mathematics is easy, then logic is not difficult. $\textit{Therefor...
ankitgupta.1729
407
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
mathematical-logic
propositional-logic
multiple-selects
1-mark
+
–
1
votes
1
answer
97
Discrete Mathematics | Propositional Logic | Test 2 | Question: 3
Suppose we have to construct a formula that expresses the truth function $\phi$ ... The formula that $\phi$ expresses is $\neg p \rightarrow ((p \rightarrow \neg p) \rightarrow (\neg p \rightarrow p))$
Suppose we have to construct a formula that expresses the truth function $\phi$ given by: $$\begin{array}{c|c|c}p & q & \phi \\\hlineT & T & T \\T & F & T \\F...
ankitgupta.1729
435
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
mathematical-logic
propositional-logic
multiple-selects
1-mark
+
–
1
votes
1
answer
98
Discrete Mathematics | Propositional Logic | Test 2 | Question: 4
Consider a conditional statement $P \rightarrow Q.$ The proposition $Q \rightarrow P$ is called the $\textit{converse}$ of $P \rightarrow Q.$ The proposition $\neg Q \rightarrow \neg P$ ... If the converse is true, then the inverse is also logically true. (P and Q are distinct atomic sentences)
Consider a conditional statement $P \rightarrow Q.$ The proposition $Q \rightarrow P$ is called the $\textit{converse}$ of $P \rightarrow Q.$ The proposition $\neg Q \rig...
ankitgupta.1729
360
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
mathematical-logic
propositional-logic
multiple-selects
1-mark
+
–
0
votes
1
answer
99
Discrete Mathematics | Propositional Logic | Test 2 | Question: 5
A compound proposition is $\textit{satisfiable}$ if there is an assignment of truth values to its variables that makes it true. When no such assignments exists, that is, when the compound proposition is false for all assignments of ... but not valid. Hence, it is a contingency where $P,Q$ and $R$ are distinct atomic propositions.
A compound proposition is $\textit{satisfiable}$ if there is an assignment of truth values to its variables that makes it true. When no such assignments exists, that is, ...
ankitgupta.1729
787
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
mathematical-logic
propositional-logic
multiple-selects
1-mark
+
–
5
votes
2
answers
100
Discrete Mathematics | Propositional Logic | Test 2 | Question: 6
How many assignments of truth values to distinct $P_1,P_2,P_3,...,P_n$ with $n \geq 5$ ... $\textbf{Hint}:$ Try to construct the recurrence for the given problem and then solve it)
How many assignments of truth values to distinct $P_1,P_2,P_3,...,P_n$ with $n \geq 5$ are there for which $(...(((P_1 \rightarrow P_2) \rightarrow P_3 ) \rightarrow P_4)...
ankitgupta.1729
682
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
mathematical-logic
propositional-logic
2-marks
+
–
0
votes
1
answer
101
Discrete Mathematics | Propositional Logic | Test 2 | Question: 7
Suppose two premises are given as: $(1)$ Either Mary gives Peter his toy or Peter is going to cry. $(2)$ Mary does not give Peter his toy. Which one of the following statements is correct ... from the above two premises. Conclusion 'Peter is not going to cry' logically follows from the above two premises.
Suppose two premises are given as: $(1)$ Either Mary gives Peter his toy or Peter is going to cry. $(2)$ Mary does not give Peter his toy. Which one of th...
ankitgupta.1729
304
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
mathematical-logic
propositional-logic
multiple-selects
2-marks
+
–
2
votes
1
answer
102
Discrete Mathematics | Propositional Logic | Test 2 | Question: 8
In the $\textit{theory of inference},$ we begin with a set of formulas which we call $\textit{premises/ hypotheses}$ and using some rules we obtain some other $\textit{given formula}$ ... a logical consequence of given premises Premise $(1)$ and $\neg C$ does not tautologically imply $S$
In the $\textit{theory of inference},$ we begin with a set of formulas which we call $\textit{premises/ hypotheses}$ and using some rules we obtain some other $\textit{gi...
ankitgupta.1729
489
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
mathematical-logic
propositional-logic
multiple-selects
2-marks
+
–
3
votes
2
answers
103
Discrete Mathematics | Propositional Logic | Test 2 | Question: 9
To decide an argument is $\textit{valid}$ with $n$ distinct premises as $P_1,P_2,...,P_n$ and conclusion $C$, we need to decide whether $(P_1 \wedge P_2 \wedge...\wedge P_n) \rightarrow C$ is tautology or not. Which of ... $R,$ then we $\textit{can't}$ infer $R \rightarrow S$ from $P_1,P_2,...,P_n.$
To decide an argument is $\textit{valid}$ with $n$ distinct premises as $P_1,P_2,...,P_n$ and conclusion $C$, we need to decide whether $(P_1 \wedge P_2 \wedge...\wedge...
ankitgupta.1729
663
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
mathematical-logic
propositional-logic
multiple-selects
2-marks
+
–
1
votes
1
answer
104
Discrete Mathematics | Propositional Logic | Test 2 | Question: 10
Premises $P_1,P_2,...,P_n$ infer/derive a conclusion $Q$ if and only if the conditional $(P_1 \wedge P_2 \wedge...\wedge P_n) \rightarrow Q$ is a tautology. Consider the following statements: From $P$ ... $P$, $Q$ and $R$ are distinct atomic sentences ) Number of correct statements are ______
Premises $P_1,P_2,...,P_n$ infer/derive a conclusion $Q$ if and only if the conditional $(P_1 \wedge P_2 \wedge...\wedge P_n) \rightarrow Q$ is a tautology. �...
ankitgupta.1729
1.0k
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
numerical-answers
mathematical-logic
propositional-logic
2-marks
+
–
1
votes
2
answers
105
Discrete Mathematics | Propositional Logic | Test 2 | Question: 11
Consider the following argument: If either wages or prices are raised, there will be inflation. If there is inflation, then either Congress must regulate it or the people will suffer. If the people suffer, Congressmen ... $P \rightarrow Q$ is a tautology. Validity of the given argument can't be determined.
Consider the following argument: If either wages or prices are raised, there will be inflation. If there is inflation, then either Congress must regulate it or ...
ankitgupta.1729
907
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
mathematical-logic
propositional-logic
multiple-selects
2-marks
+
–
4
votes
3
answers
106
Discrete Mathematics | Propositional Logic | Test 2 | Question: 12
Two sentences are said to be $\textit{contradictory}$ if one is negation of the other. A $\textit{contradiction}$ is a conjunction of two contradictory sentences i.e. it is a conjunction of the form $S \wedge \neg S.$ A set ... Only $(ii)$ is correct Both $(i)$ and $(ii)$ are correct None of the above
Two sentences are said to be $\textit{contradictory}$ if one is negation of the other. A $\textit{contradiction}$ is a conjunction of two contradictory sentences i.e. it ...
ankitgupta.1729
548
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
mathematical-logic
propositional-logic
2-marks
+
–
0
votes
1
answer
107
Discrete Mathematics | Propositional Logic | Test 2 | Question: 13
The consistency of a set of premises whose logical structure may be expressed by sentential connectives alone may be determined directly by a mechanical truth table test. The truth table for the conjunction of the premises is constructed. ... Both systems $(i)$ and $(ii)$ are consistent None of the systems are consistent
The consistency of a set of premises whose logical structure may be expressed by sentential connectives alone may be determined directly by a mechanical truth table test....
ankitgupta.1729
1.4k
views
ankitgupta.1729
asked
Apr 15, 2023
Mathematical Logic
testsbyankitg-dm-2
mathematical-logic
propositional-logic
2-marks
+
–
Page:
« prev
1
2
3
4
5
6
7
8
9
...
35
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register