Using the auxiliary hypothesis metatheorem prove ⊢ (∃x)A → (∃x) ( A ∧ (A ∨ B) )
Please use the graphical technique.
Here is an example of it:
http://www.diag.uniroma1.it/liberato/planning/tableau/multiple-04.png
-
The auxiliary hypothesis is: "Suppose that Γ ⊢ (∃x)A."
-
I don't understand the technique. Can you give a definition rather than an example?
- closed
- 90 views
- $4.92
Related Questions
- Logic Question ¬¬𝐴→𝐴
- Logic Questions (𝐴→𝐶)∧(𝐵→𝐶)⊢(𝐴∧𝐵)→𝐶
- Induction proof for an algorithm. Introductory level discrete math course. See attachment for details
- Questions about computability Theory, Logic
- Logic Question (𝐴→(𝐵→𝐶))→((𝐴→𝐵)→(𝐴→𝐶))
- Logic Question 𝐴∧(𝐵∨𝐶)⊢(𝐴∧𝐵)∨(𝐴∧𝐶)
- Logic Question 𝐴→(𝐵→𝐶),𝐴→𝐵,𝐴⊢𝐶
- Logic equation
