• In order theory and model theory, branches of mathematics, Cantor's isomorphism theorem states that every two countable dense unbounded linear orders are...
    25 KB (3,035 words) - 08:06, 24 April 2025
  • interval does not, and order isomorphisms must preserve the existence of least elements. By Cantor's isomorphism theorem, every unbounded countable dense...
    8 KB (1,061 words) - 17:31, 22 December 2024
  • In set theory and order theory, the Cantor–Bernstein theorem states that the cardinality of the second type class, the class of countable order types,...
    1 KB (99 words) - 17:41, 10 August 2023
  • between A and B Cantor's isomorphism theorem: every two countable dense unbounded linear orders are isomorphic Cantor's intersection theorem: a decreasing...
    1 KB (168 words) - 05:49, 3 December 2023
  • Thumbnail for Cantor's theorem
    question marks, boxes, or other symbols. In mathematical set theory, Cantor's theorem is a fundamental result which states that, for any set A {\displaystyle...
    22 KB (3,735 words) - 00:55, 8 December 2024
  • The theorem is named after Felix Bernstein and Ernst Schröder. It is also known as the Cantor–Bernstein theorem or Cantor–Schröder–Bernstein theorem, after...
    20 KB (2,377 words) - 11:57, 23 March 2025
  • Gödel's incompleteness theorems are two theorems of mathematical logic that are concerned with the limits of provability in formal axiomatic theories...
    92 KB (12,171 words) - 07:16, 2 August 2025
  • mathematics, in the areas of order theory and combinatorics, Dilworth's theorem states that, in any finite partially ordered set, the maximum size of an...
    18 KB (2,445 words) - 18:06, 31 December 2024
  • no endpoints; Cantor proved that any such countable linear order is isomorphic to the rational numbers: see Cantor's isomorphism theorem. Every categorical...
    10 KB (1,157 words) - 04:00, 24 March 2025
  • axiom of choice). The principle is also called the Hausdorff maximality theorem or the Kuratowski lemma (Kelley 1955:33). The Hausdorff maximal principle...
    13 KB (2,424 words) - 02:29, 14 July 2025
  • order preserving functions as morphisms. The correspondence above is an isomorphism of categories between Alex and PreOrd. Furthermore, the functor A : P...
    12 KB (1,604 words) - 17:27, 20 July 2025
  • In mathematics, Kruskal's tree theorem states that the set of finite trees over a well-quasi-ordered set of labels is itself well-quasi-ordered under...
    14 KB (1,642 words) - 16:05, 18 June 2025
  • In mathematics, the Boolean prime ideal theorem states that ideals in a Boolean algebra can be extended to prime ideals. A variation of this statement...
    15 KB (2,256 words) - 13:54, 6 April 2025
  • graph Logic gate Boolean analysis Boolean prime ideal theorem Compactness theorem Consensus theorem De Morgan's laws Duality (order theory) Laws of classical...
    6 KB (271 words) - 23:18, 23 July 2024
  • Thumbnail for Cantor's first set theory article
    Cantor's first set theory article contains Georg Cantor's first theorems of transfinite set theory, which studies infinite sets and their properties. One...
    102 KB (7,563 words) - 21:39, 11 July 2025
  • z) = (x ∨ y) ∧ (x ∨ z) holds Being a Boolean algebra Being an order isomorphism. Since partial orders are antisymmetric, the only ones that are self-dual...
    4 KB (457 words) - 00:47, 21 September 2023
  • of abstract algebra. He adopted this terminology because, using the isomorphism of the categories of Boolean algebras and of Boolean rings, the two notions...
    13 KB (1,762 words) - 08:42, 16 June 2025
  • Results Boolean prime ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle...
    8 KB (1,337 words) - 03:16, 22 April 2025
  • Results Boolean prime ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle...
    13 KB (1,914 words) - 19:45, 4 June 2025
  • must satisfy the sentence saying the real numbers are uncountable. Cantor's theorem states that some sets are uncountable. This counterintuitive situation...
    22 KB (2,795 words) - 12:03, 4 October 2024
  • antichain in a partially ordered set is known as its width. By Dilworth's theorem, this also equals the minimum number of chains (totally ordered subsets)...
    8 KB (1,090 words) - 11:19, 27 February 2023
  • Thumbnail for Hasse diagram
    & Tamassia (1995a), Theorem 9, p. 118; Baker, Fishburn & Roberts (1971), theorem 4.1, page 18. Garg & Tamassia (1995a), Theorem 15, p. 125; Bertolazzi...
    11 KB (1,342 words) - 10:38, 16 December 2024
  • strictly increasing bijection from the former to the latter. Relevant theorems of this sort are expanded upon below. More examples can be given now: The...
    5 KB (695 words) - 12:50, 4 September 2024
  • Pointwise order of functions Galois connection Order embedding Order isomorphism Closure operator Functions that preserve suprema/infima Dedekind completion...
    5 KB (396 words) - 23:32, 16 April 2025
  • logic) Cantor–Bernstein–Schröder theorem (set theory, cardinal numbers) Cantor's theorem (set theory, Cantor's diagonal argument) Church–Rosser theorem (lambda...
    78 KB (6,296 words) - 20:31, 6 July 2025
  • List of statements independent of ZFC Continuum hypothesis AD+ Cantor's isomorphism theorem K. Devlin and H. Johnsbråten, The Souslin Problem, Lecture Notes...
    6 KB (781 words) - 21:14, 2 July 2025
  • Results Boolean prime ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle...
    5 KB (901 words) - 05:00, 6 June 2025
  • An order isomorphism can be characterized as a surjective order embedding. As a consequence, any order embedding f restricts to an isomorphism between...
    6 KB (817 words) - 22:01, 18 February 2025
  • order-preserving. Given the standard definition of isomorphisms as invertible morphisms, a lattice isomorphism is just a bijective lattice homomorphism. Similarly...
    39 KB (5,451 words) - 17:40, 29 June 2025
  • Thumbnail for Monotonic function
    {\displaystyle (Tu-Tv,u-v)\geq 0\quad \forall u,v\in X.} Kachurovskii's theorem shows that convex functions on Banach spaces have monotonic operators as...
    19 KB (2,475 words) - 06:23, 2 July 2025