Search results

Results 1 – 20 of 355
Advanced search

Search in namespaces:

There is a page named "Ultrafilter principle" on Wikipedia

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • Thumbnail for Ultrafilter on a set
    In the mathematical field of set theory, an ultrafilter on a set X {\displaystyle X} is a maximal filter on the set X . {\displaystyle X.} In other words...
    47 KB (7,377 words) - 04:20, 9 April 2024
  • Thumbnail for Hyperreal number
    be extended to an ultrafilter, but the proof uses the axiom of choice. The existence of a nontrivial ultrafilter (the ultrafilter lemma) can be added...
    33 KB (4,894 words) - 04:35, 23 July 2024
  • full strength of choice. Instead, it relies on the intermediate Ultrafilter principle. Using this theorem with the subbase for R {\displaystyle \mathbb...
    18 KB (1,960 words) - 05:08, 10 July 2024
  • Thumbnail for Axiom of choice
    former is equivalent in ZF to Tarski's 1930 ultrafilter lemma: every filter is a subset of some ultrafilter. One of the most interesting aspects of the...
    57 KB (7,626 words) - 01:41, 8 July 2024
  • In logic, the law of excluded middle or the principle of excluded middle states that for every proposition, either this proposition or its negation is...
    38 KB (5,701 words) - 21:00, 11 July 2024
  • (as corollaries of Lindemann–Weierstrass) Tychonoff's theorem (to do) Ultrafilter lemma Ultraparallel theorem Urysohn's lemma Van der Waerden's theorem...
    6 KB (593 words) - 20:11, 5 June 2023
  • Thumbnail for Boolean algebra (structure)
    ultrafilter is called the ultrafilter lemma and cannot be proven in Zermelo–Fraenkel set theory (ZF), if ZF is consistent. Within ZF, the ultrafilter...
    49 KB (3,356 words) - 14:42, 23 February 2024
  • construct the hyperreals if given a set-theoretic object called an ultrafilter, but the ultrafilter itself cannot be explicitly constructed. Vladimir Kanovei and...
    18 KB (2,700 words) - 20:48, 30 May 2024
  • Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann...
    2 KB (338 words) - 06:16, 4 March 2024
  • huge cardinal, then a strong form of Vopěnka's principle holds in Vκ: There is a κ-complete ultrafilter U such that for every {Ri: i < κ} where each Ri...
    5 KB (597 words) - 00:05, 23 April 2024
  • Thumbnail for Zorn's lemma
    which it is also equivalent) Every proper filter is contained in an ultrafilter, a result that yields the completeness theorem of first-order logic In...
    26 KB (3,678 words) - 08:20, 10 February 2024
  • Thumbnail for Nonstandard analysis
    {\displaystyle \mathbb {R} ^{\mathbb {N} }} , as follows. Take a nonprincipal ultrafilter F ⊆ P ( N ) {\displaystyle F\subseteq P(\mathbb {N} )} . In particular...
    32 KB (4,070 words) - 06:31, 19 July 2024
  • denoted here S(B), called its Stone space. The points in S(B) are the ultrafilters on B, or equivalently the homomorphisms from B to the two-element Boolean...
    5 KB (715 words) - 14:47, 16 January 2024
  • theories Transfer principle – Concept in model theory Ultrafilter – Maximal proper filter Leinster, Tom (2013). "Codensity and the ultrafilter monad" (PDF)...
    18 KB (3,104 words) - 12:30, 7 February 2024
  • (LNC) (also known as the law of contradiction, principle of non-contradiction (PNC), or the principle of contradiction) states that contradictory propositions...
    23 KB (3,026 words) - 09:50, 14 June 2024
  • Thumbnail for Filters in topology
    ("maximally deep"). The ultrafilter lemma The following important theorem is due to Alfred Tarski (1930). The ultrafilter lemma/principle/theorem (Tarski) — Every...
    193 KB (30,936 words) - 07:26, 24 February 2024
  • assumption that all objects satisfy the negation of the property. The principle may be formally expressed as the propositional formula ¬¬P ⇒ P, equivalently...
    19 KB (2,502 words) - 02:57, 17 July 2024
  • extremely important and powerful property of set algebra, namely, the principle of duality for sets, which asserts that for any true statement about sets...
    15 KB (1,865 words) - 16:28, 28 May 2024
  • All these definitions of Boolean algebra can be shown to be equivalent. Principle: If {X, R} is a partially ordered set, then {X, R(inverse)} is also a...
    75 KB (9,506 words) - 17:24, 21 June 2024
  • Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann...
    20 KB (2,914 words) - 02:18, 23 July 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)