A logical judgment problem of Discrete Mathematics At a seminar, three participants judged where Professor Wang came from according to his accent. A said that Professor Wang was not from Suzhou, but from Shanghai. B said that Professor Wang was not from Shanghai, but from Suzhou. C said that Professor Wang was neither from Shanghai nor from Hangzhou. After listening to the above three people's judgments, Professor Wang said that one of them was all right, and one of them was half right, What the other person said is totally wrong. Using logic algorithm to analyze where Professor Wang is from (please provide detailed process,)

A logical judgment problem of Discrete Mathematics At a seminar, three participants judged where Professor Wang came from according to his accent. A said that Professor Wang was not from Suzhou, but from Shanghai. B said that Professor Wang was not from Shanghai, but from Suzhou. C said that Professor Wang was neither from Shanghai nor from Hangzhou. After listening to the above three people's judgments, Professor Wang said that one of them was all right, and one of them was half right, What the other person said is totally wrong. Using logic algorithm to analyze where Professor Wang is from (please provide detailed process,)

Let P: Professor Wang is from Suzhou. Q: Professor Wang is from Shanghai. R: Professor Wang is from Hangzhou. Obviously, there is only one true proposition in P, Q, R. A's judgment is A1 = P Λ Q, B's judgment is A2 = P Λ Q, C's judgment is A3 = q Λ R. then, a's judgment is all right for B1 = A1 = P Λ Q, and a's judgment is half right for B2 =

Help to prove a logical proof of discrete mathematics
Title: to prove that (P → q) ∧ (Q → R) → (P → R) is a perpetual form
Please write the proof process

Its reasoning formula is: (P → q) ∧ (Q → R) → (P → R), which requires that P → R can be deduced from (P → q) ∧ (Q → R)
①｛1｝(p→q)∧(q→r) P/∴p→r
②｛1｝p→q T①
③｛1｝q→r T①
④｛2｝p P
⑤｛12｝q T②④
⑥｛12｝r T③⑤
⑦｛1｝p→r D④⑥

A proof of Discrete Mathematics
Let t be a trivial undirected tree, there are two nodes with the largest degree in T, and the degree k > = 2. The number of leaf nodes in t is proved to be > = 2k-2
I'm sorry, I got the wrong number. It's an extraordinary undirected tree,

1. Because every non root node has either two leaves or one leaf, the least case is that there is only one leaf, and the leaf has at most one child leaf. The node with degree = n has the corresponding number of final leaves > = N2. The node with the largest degree must be the direct successor of the root node, otherwise it will lead to contradiction

（P→（Q∨┐R））∧┐P∧Q
Find out the equivalent expression of ∨ and ∨ and make it as simple as possible

┐(┐（┐P∨(Q∨┐R))∨P∨┐Q)
=┐（P∨┐Q）