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

Graduate Expected numbers of cards of a last color remaining

Graduate Probability puzzle

Undergrad The problem of points

Undergrad The countability paradox of computable numbers

Undergrad How does axiom of foundation prevent infinite sequence of elements?

Graduate Cannot understand this corollary on surreal numbers

High School Bunkbed Conjecture Debunked?

Insights Revisiting the Velocity-Time Function

Insights Remote Operated Gate Control System

Insights AI Enriched Problem Solving

Insights Thinking Outside The Box Versus Knowing What’s In The Box

Insights Why Entangled Photon-Polarization Qubits Violate Bell’s Inequality

Insights Quantum Entanglement is a Kinematic Fact, not a Dynamical Effect

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 Second-Order Logic: Understanding the Basics

Graduate Understanding Cantor Set: Uncountability & Measure

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

Graduate First-order logic without sets?

Graduate Definable Numbers: Countability, Uncountability & Paradoxes

Graduate Substitutionless first-order logic w/ identity