Symmetric difference of set identity

AI Thread Summary
The discussion focuses on finding a more efficient method to verify the symmetric difference identity without relying on Venn diagrams or truth tables. Participants highlight the associative and commutative properties of sets concerning the symmetric difference operator, suggesting the combination of like terms for simplification. The conversation emphasizes using these techniques to create new identities that can serve as shortcuts in other proofs involving symmetric differences. Overall, the aim is to streamline the verification process while maintaining a formal approach. This method can enhance understanding and application of set identities.
el_llavero
Messages
29
Reaction score
0
Is there a shorter way to verify this identity, as you can see I haven't even finished it. I know you can use Ven diagrams and truth tables but I wanted to avoid them inorder to use a more general formal approach. picture is attached
 

Attachments

Physics news on Phys.org
Sets are associative and commutative over the symmetric difference operator, use this to combine like terms, then simplify. Similar technique can be used on variations of this identity to build your own identities which can be used as short cuts in other proofs containing the symmetric difference operator.

see attachment
 

Attachments

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