Natural deduction sets (Rules of nature deduction)

AI Thread Summary
The discussion centers on the challenges of proving set theory identities using natural deduction, specifically the laws A ∪ ∅ = A and A ∩ ∅ = ∅. The original poster seeks assistance in applying natural deduction rules to these principles and requests resources for further learning. Respondents clarify that the empty set has no elements, impacting union and intersection operations. They also note that traditional proofs in set theory often involve quantifiers, which differ from the elementary logic discussed. The conversation emphasizes the need for a clear understanding of logical implications in set theory.
emanoelvianna
Messages
2
Reaction score
0
Hello fine.

I'm studying logic and great difficulties to understand its principles, and should prove some theories involving the laws of identity of sets of mathematics using the method of natural deduction, they are:

a) A ∪ ∅ = A
b) A ∩ ∅ = ∅

I am trying as follows, but I can not solve

http://www.imagesup.net/dm-1514135726215.png

Could anyone help me solve ?!
If I could be pointed out to me some book or website to get more doubts which were to appear on deduction of sets I'd appreciate it.
Thank you.
 
Last edited by a moderator:
Physics news on Phys.org
I am not sure what you are trying to do, but the basic logic is that the empty set has no elements, so if it is the union it must be in A.
 
Hello, thank you by return.

I understand the theory that a set, but I need to prove it by natural deduction, this theory is known as "Natural deduction rules for theory set"

Link to example: http://tellerprimer.ucdavis.edu/pdf/1ch6.pdf
 
emanoelvianna said:

The usual way to do proofs about set theory identities is to use logic that involves quantifiers, such as "for each" and "there exists". ( symbolized by \forall and \exists). The link you gave is about using the more elementary type of logic that lacks quantifiers.

In the link you gave, A \supset B does not mean that B is a subset of A. In the link, A \supset B means "A implies B". The link you gave is not about set theory.
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top