CIS 301: Homework Assignment #3: Propositional Proofs

$30.00

Category: Tags: , , , , You will Instantly receive a download link for .zip solution file upon Payment || To Order Original Work Click Custom Order?

Description

5/5 - (8 votes)

Problems
==
1. (3 points) From homework 1, you may notice that for every case that “`(p → q) → r“`
is true, “`p → (q → r)“` is true as well. To confirm this observation, prove “`(p → q) → r ⊢ p → (q → r)“` (Hint: https://github.com/sireum/v3-logika-examples/blob/release/src/propositional/implies/implies-4c.logika)

2. (4 points) Prove “`(p ∧ q ∧ r) ∨ s ⊢ (p ∨ s) ∧ (q ∨ s) ∧ (r ∨ s)“` (Hint: consider proof to this sequents “`(p ∧ q) ∨ r ⊢ (p ∨ r) ∧ (q ∨ r)“`)

3. (4 points) Prove “`p ∨ (q ∨ r) ⊢ (p ∨ q) ∨ r“`

4. (3 points) Prove “`p → s ⊢ p ∧ q → r ∨ s“`

5. (4 points) Prove “`p → q ∨ r, q → s, r → t ⊢ p → (t ∨ s)“`

6. The sequent “`<premise1>, <premise2>, … <premiseN> ⊢ <consequent>“` is provable if and only if the formula
“`<premise1> ∧ <premise2> ∧ … <premiseN> → <consequent>“` is a tautology. This is equivalent to saying that a sequent is not provable if and only if there is some truth assignment for the variables where the formula evaulates to false. For each of the following sequents, either prove it or show that it is not possible with a truth table of the corresponding formula.

Advice:
* You could practice Z3 by writing a program to determine if the sequent is provable. Feel free to submit a Z3 files but the autograder will ignore it.
* If you make a truth table that is a tautology, you’ve just shown the sequent is provable. You’ll need to make such a proof instead.
* If you make a truth table that is a contingent, notice the cases you enumerated when the formula is not true. These cases are counter examples to the claim that the sequent is provable. For these cases, the conclusion can not be derived from the premises.
* If you make a truth table that is a contradiction, you’ve shown that in no case can the conclusion be derived from the premises.

* Each completable proof takes at most 10 steps.

a. (3 points) “`p ∧ q ⊢ p → q“`

b. (3 points) “`p → q ⊢ p ∧ q“`

c. (3 points) “`p ∧ q → r ⊢ p → q → r“`

d. (3 points) “`p → q → r ⊢ p ∧ q → r“`

What to submit
==
Commit and push your project containing the solutions to your github repository (see videos) before the deadline. A good practice is to commit/push whenever meaningful progress is made (like you finish a question or fix a bug).