Discrete Structures
– You must justify your answers.
– The answers should be concise, clear and neat.
– When presenting proofs, every step should be justified.

Question 6: In this exercise, we will denote Boolean variables by lowercase letters, such as p and q. A proposition is any Boolean formula that can be obtained by applying the following recursive rules 1. For every Boolean variable p, p is a proposition 2. If f is a proposition, then-f is
PayPal Gateway not configured
PayPal Gateway not configured