• areas of order and lattice theory, the KnasterTarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following: Let (L, ≤) be a...
    19 KB (2,426 words) - 00:25, 19 May 2025
  • closed fields KnasterTarski theorem (sometimes referred to as Tarski's fixed point theorem) Tarski–Seidenberg theorem Some fixed point theorems, usually variants...
    740 bytes (121 words) - 13:08, 29 June 2023
  • Fixed-point theorems in infinite-dimensional spaces Injective metric space Kakutani fixed-point theorem Kleene fixed-point theorem KnasterTarski theorem Lefschetz...
    11 KB (1,278 words) - 00:51, 3 February 2024
  • Łoś–Tarski preservation theorem KnasterTarski theorem (sometimes referred to as Tarski's fixed point theorem) Tarski's undefinability theorem Tarski–Seidenberg...
    2 KB (181 words) - 17:41, 16 March 2022
  • lists, in domain theory. Kleene fixed-point theorem for Scott-continuous functions KnasterTarski theorem for complete lattices Nicolas Bourbaki (1949)...
    4 KB (559 words) - 15:58, 16 November 2024
  • Thumbnail for Bronisław Knaster
    Bronisław Knaster (22 May 1893 – 3 November 1980) was a Polish mathematician; from 1939 a university professor in Lwów and from 1945 in Wrocław. In 1945...
    4 KB (282 words) - 18:16, 16 May 2025
  • 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
  • countable intersections of open sets are open Speer 2007, Theorem 7. Arenas 1999, Theorem 2.2. Erné, M. "The ABC of order and topology" (PDF)., page...
    12 KB (1,604 words) - 06:22, 25 May 2025
  • 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
  • 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
  • Hausdorff maximality theorem (set theory) Kleene fixed-point theorem (order theory) KnasterTarski theorem (order theory) Kruskal's tree theorem (order theory)...
    78 KB (6,289 words) - 12:34, 6 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
  • 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,394 words) - 04:09, 6 May 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
  • 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,471 words) - 01:32, 25 January 2025
  • problemsPages displaying wikidata descriptions as a fallback KnasterTarski theorem – Theorem in order and lattice theory Sutherland, Wilson A. (1975). Introduction...
    16 KB (2,522 words) - 21:18, 28 April 2025
  • North-Holland (1984) This is a strengthening of the KnasterTarski theorem sometimes referred to as "Pataraia’s theorem". For example, see Section 4.1 of "Realizability...
    11 KB (1,428 words) - 17:40, 18 May 2025
  • Thumbnail for Complete lattice
    take a particularly simple form in this case. An example is the KnasterTarski theorem, which states that the set of fixed points of a monotone function...
    18 KB (2,705 words) - 14:43, 17 June 2025
  • complete partial order, (d)cpo Bounded complete Complete lattice KnasterTarski theorem Infinite divisibility Heyting algebra Relatively complemented lattice...
    5 KB (396 words) - 23:32, 16 April 2025
  • ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle KnasterTarski theorem...
    10 KB (1,414 words) - 15:58, 2 May 2025
  • further structure. Another early representation theorem is now known as Stone's representation theorem for distributive lattices (the name honors Marshall...
    17 KB (2,061 words) - 16:03, 7 May 2025
  • ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle KnasterTarski theorem...
    22 KB (3,147 words) - 10:51, 4 June 2025
  • ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle KnasterTarski theorem...
    15 KB (2,175 words) - 00:47, 19 May 2025
  • ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle KnasterTarski theorem...
    4 KB (608 words) - 15:30, 7 February 2024
  • without the axiom of choice). This issue is discussed in various prime ideal theorems, which are necessary for many applications that require prime ideals. An...
    13 KB (1,762 words) - 08:42, 16 June 2025
  • ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle KnasterTarski theorem...
    2 KB (198 words) - 21:00, 15 December 2022
  • mathematics, in the areas of order theory and combinatorics, Mirsky's theorem characterizes the height of any finite partially ordered set in terms of...
    8 KB (1,119 words) - 13:33, 10 November 2023
  • algebra De Morgan algebra First-order logic Heyting algebra Lindenbaum–Tarski algebra Skew Boolean algebra Algebraic normal form Boolean conjunctive query...
    6 KB (271 words) - 23:18, 23 July 2024
  • of constructions Domain theory Directed complete partial order KnasterTarski theorem Cartesian closed category Yoneda lemma Graph reduction Combinator...
    3 KB (205 words) - 20:20, 20 February 2025
  • theory and model theory, branches of mathematics, Cantor's isomorphism theorem states that every two countable dense unbounded linear orders are order-isomorphic...
    25 KB (3,035 words) - 08:06, 24 April 2025