Notes in Set Theory

To Subscribe, use this Key

Status	Last Update	Fields
Published	11/14/2024	[latex]Zorn's Lemma [/latex]
Published	11/14/2024	[latex]A binary relation \( < \) on a set \( P \) is called a \textbf{partial ordering} of \( P \) if ... [/latex]
Published	11/14/2024	[latex]\( (P, \leq) \) a partially ordered set and \( X \subseteq P \) a nonempty subset. \( a \) is called a \textbf{maximal} element of \( X \) if …
Published	11/14/2024	[latex]\( (P, \leq) \) a partially ordered set and \( X \subseteq P \) a nonempty subset. \( a \) is called the \textbf{greatest} element of \( X \) …
Published	11/14/2024	[latex]Cantor's theorem [/latex]
Status	Last Update	Fields