Web Page

Syllabus: Propositional and first order logic.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\textbf{2024-1}&\textbf{2024-2}&\textbf{2023}& \textbf{2022}& \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count}&0&1&1& 0 & 1&1&0&0.67&1
\\\hline\textbf{2 Marks Count}&0&0&0&0 & 0&0&0&0&0
\\\hline\textbf{Total Marks}& 0&1&1& 0 & 1&1&\bf{0}&\bf{0.67}&\bf{1}\\\hline
\end{array}}}$$

Recent questions in Mathematical Logic

#881
147
views
0 answers
0 votes
Suggest some resources for learning recurrence relations and generating functions thoroughly.
#882
499
views
0 answers
0 votes
Are normal forms and proofs part of syllabus in preposition and 1st order logic in discrete mathematics ?
#883
1.8k
views
1 answers
0 votes
What is a discrete set?
#884
795
views
2 answers
0 votes
Q1) Why is the path between a pair of vertices in a minimum Spanning tree of an undirected graph not the shortest( minimum weight) path?
#885
215
views
0 answers
0 votes
how to solve any such question faster as I am able to visualize sstatement 1 but not 2 clearly and it is taking a lot of time for me.
#886
224
views
0 answers
0 votes
how to solve this question as I am able to think of statement 1 but unable to visualise 2 clearly ,please tell me any fast way to do such question.can you ... tell me relation between det and det of adjoint and how to derive them please .
#887
247
views
1 answers
0 votes
#888
291
views
0 answers
0 votes
Consider these statements,of which the first three are premises and the fourth is a valid conclusion. All hummingbirds are richly colored. No large birds live on honey. Birds that ... using quantifiers and P(x) , Q(x), R(x), and S(x).
#889
283
views
0 answers
0 votes
how to solve this equation by A.G.P. method or any other method.S=1+(n)2+ (n-6)2+(n-12)2+(n-18)2+..........................................+(n-6(k-1))2.
#890
209
views
0 answers
0 votes
Please explain why the anwer will be d.
#891
2.5k
views
2 answers
5 votes
Stmt 1: A simple graph is necessarily connected if |E| > (n-1)*(n-2)/2.Stmt2: A simple graph with n vertices and k components has at least n-k edges.Can you please explain how are these results derived?
#892
501
views
1 answers
0 votes
P->RQ->R How is the conclusion is (P^Q)->R ?I could only derive that both P and Q are true .
#893
449
views
1 answers
0 votes
#894
540
views
1 answers
0 votes
#895
269
views
0 answers
0 votes
#896
515
views
0 answers
0 votes
#897
170
views
0 answers
0 votes
#898
558
views
1 answers
2 votes
Can someone plz explain Relative Complement of graph and also check the validity of the statement "If G is simple n vertex graph with min degree >= (n-1)/2 then G is Connected "
#899
903
views
0 answers
0 votes
Boolean algebra is a bounded distributed complemented lattice, also lattice is a poset thus it satisfies reflexive , antisymmetric and transitive properties. Does Boolean Algebra satisfy commutative law?
#900
242
views
0 answers
0 votes
I am not able to understand clearly the concepts related to cosets, subgroups, lattice theory.Can someone suggest references to clarify my understanding of each topic?