Proving Denumerability for Disjoint Sets | A&B Union Denumerable

  • Thread starter Thread starter kealth
  • Start date Start date
AI Thread Summary
If A and B are disjoint denumerable sets, their union A ∪ B is also denumerable. Denumerability means that there exists a complete list of elements for each set. For sets A and B, the elements can be listed as a1, a2, a3,... for A and b1, b2, b3,... for B. The union can be constructed by alternating elements from both lists, resulting in a sequence like a1, b1, a2, b2, a3, b3, and so on. This demonstrates that A ∪ B can be enumerated, confirming its denumerability.
kealth
Messages
1
Reaction score
0
Would someone please help me on the topic of Denumerability.

Prove that if A and B are disjoint denumerable sets then A union B is denumerable.
 
Physics news on Phys.org
Welcome to PF!

How would you state the definition of denumerability?
 
kealth said:
Would someone please help me on the topic of Denumerability.

Prove that if A and B are disjoint denumerable sets then A union B is denumerable.
A and B being denumerable means there is are complete lists of the form:

a1, a2, a3,... for A
b1, b2, b3,... for B

The union can be listed as:

a1, b1, a2, b2, a3, b3, ...
 
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