Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

1.1k questions

1.3k answers

1.7k comments

557 users

0 votes

How is this sequent calculus step is getting performed on XOR? 

Whole question is : preporsitional logic formula : ((a ⊕ b) ∧ ¬ a) ∨ b

Check the validity of the formula by means of sequent calculus.

in * TF "Emb. Sys. and Rob." by (870 points)

1 Answer

+1 vote
See the answer to the following question: https://q2a.cs.uni-kl.de/1214/sequent-calculus
by (170k points)
This is the solution to the exam question. Is not it wrong? If we apply
p⊕q = (!p|!q)&(p|q)
this formula and applied sequent calculus of OR - right. Then take it from right to left thus we will negate. So, it should give (a&b),-(a|b)
Which exam paper is this?
I fixed that; it seems to have been a bug (it appears to me as if someone has made that proof tree manually and made a mistake).
Thank you so much.
Imprint | Privacy Policy
...