Cantor's diagonal argument is a mathematical proof published in 1891 demonstrating that certain infinite sets, called uncountable sets, cannot be put into one-to-one correspondence with natural numbers. The technique constructs a sequence that differs from every element in a given enumeration, proving sets like binary sequences and real numbers are uncountable, and has been applied to foundational results in logic and computability theory.