How is uncountability characterized in second order logic?

mpitluk · Jun 10, 2012

lugita15 · Jun 20, 2012

A set is infinite if it can be put in one-to-one correspondence with one of its proper subsets. A set is countably infinite if it is infinite and it can be put in one-to-one correspondence with every one of its infinite subsets. A set is uncountably infinite if it is infinite but not countably infinite.

How is uncountability characterized in second order logic?

Discussion

Similar threads

Graduate Second order logic and completeness

Graduate Alternatives to proving the uncountability of number between 0 and 1

Graduate How to Prove (∀x)(A→B) ≡ ((∃x)A) → B Using First-Order Logic

Graduate Dissatisfaction with second-order logic

Graduate Cantor's Diagonalization Proof of the uncountability of the real numbers

How to determine if a term is free in first-order logic

Graduate First-order logic without sets?

Graduate Substitutionless first-order logic w/ identity

Graduate Proving Vacuous Quantification in First-Order Logic

Undergrad How to express 'a graph has exactly 6 edges' in first-order logic