Definition
Cantor's diagonal argument is a mathematical proof that there are infinite sets which cannot be put into one-to-one correspondence with the infinite set of natural numbers – informally, that there are sets which in some sense contain more elements than there are positive integers. Such sets are now called uncountable sets, and the size of infinite sets is treated by the theory of cardinal numbers, which Cantor began.
Related concepts
Abraham FraenkelAbstract logicAckermann set theoryAleph numberAlgebraic logicAlmostAlphabet (formal languages)Alternative set theoryAmerican Mathematical MonthlyAmorphous setAntisymmetric relationArgumentArityAtomic formulaAtomic model (mathematical logic)Atomic sentenceAutomata theoryAutomated theorem provingAxiomAxiom of adjunctionAxiom of choiceAxiom of constructibilityAxiom of countable choiceAxiom of dependent choiceAxiom of determinacyAxiom of extensionalityAxiom of global choiceAxiom of infinityAxiom of limitation of sizeAxiom of pairingAxiom of power setAxiom of powersetAxiom of projective determinacyAxiom of regularityAxiom of unionAxiom schemaAxiom schema of predicative separationAxiom schema of replacementAxiom schema of specificationAxiomatic systemAxiomatization of Boolean algebrasBanach–Tarski paradoxBertrand RussellBijectionBinary digitsBinary expansionBinary operationBinary pointBoolean algebraBoolean algebras canonically definedBoolean functionBurali-Forti paradoxCantor's first uncountability proofCantor's paradoxCantor's theoremCardinal numberCardinalityCardinality of the continuumCartesian productCategorical theoryCategory (mathematics)Category of setsCategory theoryCauchy sequenceCharacteristic functionsChurch encodingChurch–Turing thesisClass (set theory)Classical logicClosed intervalCodomainCompactness theoremComplement (set theory)Complete theoryComplexity classesComputability theoryComputable functionComputable setComputably enumerable setConcrete categoryConservative extensionConsistencyConstructible universeConstruction of the real numbersConstructive analysisConstructive proofConstructive set theoryConstructivism (mathematics)Continuum hypothesisControversy over Cantor's theoryCountable choiceCountable setCountably infiniteDe Morgan's lawsDecidability (logic)Decimal fractionsDecision problemDedekind-infinite setDedekind cutDeductive systemDiagonal lemmaDiagram (mathematical logic)Disjoint unionDomain of a functionDyadic rationalEffective toposElement (mathematics)Elementary diagramElementary equivalenceElementary function arithmeticEmpty setEntscheidungsproblemEnumerationEquiconsistencyEquivalence relationEric W. WeissteinErnst ZermeloEuclid's ElementsEuclidean geometryEven numbersExistential quantificationExpression (mathematics)Extension by definitionsExtension by new constant and function namesExtensionalityFamily of setsFilter on a setFinitary relationFinite-valued logicFinite model theoryFinite setFirst-order logicFixed-point logicForcing (mathematics)Formal grammarFormal languageFormal proofFormal semantics (logic)Formal systemFormation ruleFoundations of geometryFoundations of mathematicsFree logicFree variables and bound variablesFunction (mathematics)Function compositionFunctional predicateFuzzy setGeneral set theoryGeorg CantorGrothendieck universeGround expressionGround formulaGödel's completeness theoremGödel's incompleteness theoremsGödel numberingHalting problemHereditarily finite setHereditary setHigher-order logicHilbert's axiomsHilbert systemHistory of logicHistory of mathematical logicImage (mathematics)Inaccessible cardinalIndependence (mathematical logic)InferenceInfinite-valued logicInfinite seriesInfinite setInformation theoryInhabited setInjective functionInterpretation (logic)Interpretation (model theory)Interpretation functionIntersection (set theory)IntuitionistIrrational numberIsomorphismJahresbericht der Deutschen Mathematiker-VereinigungJohn Lane BellJohn von NeumannJoseph DaubenKeith Simmons (philosopher)Kolmogorov complexityKripke's theory of truthKripke–Platek set theoryKurt GödelLambda calculusLarge cardinalLaw of excluded middleLemma (mathematics)Lindström's theoremLinear functionList of Hilbert systemsList of axiomsList of first-order theoriesList of formal systemsList of mathematical theoriesList of set identities and relationsList of statements independent of ZFCLogicLogical biconditionalLogical conjunctionLogical connectiveLogical consequenceLogical constantLogical disjunctionLogical equalityLogical equivalenceLogical truthLogicismLöwenheim–Skolem theoremMany-valued logicMap (mathematics)Martin's axiomMaterial conditionalMathWorldMathematical logicMathematical objectMathematical proofMetalanguageMinimal axioms for Boolean algebraModel complete theoryModel theoryModulus of convergenceMonadic predicate calculusMonadic second-order logicMorse–Kelley set theoryNP (complexity)Naive set theoryNatural deductionNatural numberNatural numbersNegationNew FoundationsNon-Euclidean geometryNon-logical symbolNon-standard modelNon-standard model of arithmeticOnes' complementOpen formulaOpen intervalOperation (mathematics)Ordered pairOrdinal analysisOrdinal numberOrdinal numbersP (complexity)P versus NPP versus NP problemParadoxes of set theoryPartial orderPartition of a setPaul BernaysPaul CohenPeano axiomsPhilosophy of mathematicsPower setPredicate (mathematical logic)Predicate logicPredicate variablePreorderPrime modelPrimitive recursive arithmeticPrimitive recursive functionPrincipia MathematicaProof by contradictionProof of impossibilityProof theoryPropositionPropositional calculusPropositional formulaPropositional variableQuantifier (logic)Quantifier rankRadixRange of a functionReal numberRecursionRecursive setRelation (mathematics)Reverse mathematicsRice's theoremRichard's paradoxRichard DedekindRobinson arithmeticRule of inferenceRussell's paradoxSatisfiabilitySaturated modelSchröder–Bernstein theoremSecond-order arithmeticSecond-order logicSelf-verifying theoriesSemantic theory of truthSemantics of logicSentence (mathematical logic)SequencesSequent calculusSet-builder notationSet (mathematics)Set of all setsSet theorySignature (logic)Singleton (mathematics)Skolem arithmeticSoundnessSpectrum of a sentenceSpectrum of a theorySquare of oppositionStrength (mathematical logic)String (formal languages)Structure (mathematical logic)SubcountabilitySubcountableSubsetSubstitution (logic)Substructure (mathematics)SupertaskSurjectiveSurjective functionSuslin's problemSyllogismSymbol (formal)Symmetric differenceSyntax (logic)T-schemaTarski's axiomatization of the realsTarski's axiomsTarski's theory of truthTarski's undefinability theoremTarski–Grothendieck set theoryTautology (logic)Term (logic)Term logicTheoremTheories of truthTheory (mathematical logic)Thomas JechThoralf SkolemThree-valued logicTimeline of mathematical logicTotal orderTransfer principleTransfinite inductionTransitive setTrigonometric functionsTrue arithmeticTruth predicateTruth tableTruth valueTupleTuring machineType (model theory)Type theoryUltrafilter (set theory)Ultrafilter on a setUltraproductUncountable setUndecidable problemUninterpreted functionUnion (set theory)Uniqueness quantificationUniversal quantificationUniversal setUniverse (mathematics)Unrestricted comprehensionUrelementValidity (logic)Variable (mathematics)Venn diagramVon Neumann cardinal assignmentVon Neumann universeVon Neumann–Bernays–Gödel set theoryW. V. QuineWell-formed formulaWillard Van Orman QuineZermelo set theoryZermelo–Fraenkel set theory
148 concepts already in your glossary