Find link

language:

jump to random article

view article
Find link is a tool written by Edward Betts.

Longer titles found: Ultrafilter on a set (view), Ultrafiltered milk (view)

searching for Ultrafilter 286 found (466 total)

alternate case: ultrafilter

Tychonoff's theorem (2,102 words) [view diff] exact match in snippet view article find links to article

to the following criterion: assuming the ultrafilter lemma, a space is compact if and only if each ultrafilter on the space converges. With this in hand
Hyperreal number (4,923 words) [view diff] exact match in snippet view article find links to article
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
Type shifter (435 words) [view diff] exact match in snippet view article find links to article
property. Lift can be seen as mapping an individual onto the principal ultrafilter that it generates. Without type shifting: [ [ J o h n ] ] = j {\displaystyle
Normal measure (176 words) [view diff] exact match in snippet view article find links to article
where the property holds is a member of the ultrafilter, i.e. has measure 1.) Also equivalent, the ultrafilter (set of sets of measure 1) is closed under
Boolean-valued model (2,447 words) [view diff] exact match in snippet view article find links to article
instead of ultrafilters: the complement of an ultrafilter is a maximal ideal, and conversely the complement of a maximal ideal is an ultrafilter.) If g is
Algebraic closure (992 words) [view diff] exact match in snippet view article find links to article
one of many closures in mathematics. Using Zorn's lemma or the weaker ultrafilter lemma, it can be shown that every field has an algebraic closure, and
Lindenbaum's lemma (158 words) [view diff] exact match in snippet view article find links to article
to a complete consistent theory. The lemma is a special case of the ultrafilter lemma for Boolean algebras, applied to the Lindenbaum algebra of a theory
Shelah cardinal (115 words) [view diff] exact match in snippet view article find links to article
{\displaystyle V_{j(f)(\kappa )}\subset N} . A Shelah cardinal has a normal ultrafilter containing the set of weakly hyper-Woodin cardinals below it. Ernest
Extender (set theory) (701 words) [view diff] exact match in snippet view article
is a system of ultrafilters which represents an elementary embedding witnessing large cardinal properties. A nonprincipal ultrafilter is the most basic
Dimension theorem for vector spaces (780 words) [view diff] exact match in snippet view article find links to article
choice, the uniqueness of the cardinality of the basis requires only the ultrafilter lemma, which is strictly weaker (the proof given below, however, assumes
Strongly compact cardinal (392 words) [view diff] exact match in snippet view article find links to article
and only if every κ-complete filter can be extended to a κ-complete ultrafilter. Strongly compact cardinals were originally defined in terms of infinitary
Cardinal characteristic of the continuum (1,573 words) [view diff] exact match in snippet view article find links to article
The ultrafilter number u {\displaystyle {\mathfrak {u}}} is defined to be the least cardinality of a filter base of a non-principal ultrafilter on ω
Gödel's completeness theorem (2,330 words) [view diff] exact match in snippet view article find links to article
provably equivalent to a weak form of the axiom of choice known as the ultrafilter lemma. In particular, no theory extending ZF can prove either the completeness
Gödel's completeness theorem (2,330 words) [view diff] exact match in snippet view article find links to article
provably equivalent to a weak form of the axiom of choice known as the ultrafilter lemma. In particular, no theory extending ZF can prove either the completeness
Strength (mathematical logic) (83 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Elementary diagram (182 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Non-standard model (105 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Discrete space (2,288 words) [view diff] exact match in snippet view article find links to article
Y} has a neighborhood on which f {\displaystyle f} is constant. Every ultrafilter U {\displaystyle {\mathcal {U}}} on a non-empty set X {\displaystyle
Abstract logic (143 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Hereditary set (279 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Counterexamples in Topology (1,069 words) [view diff] exact match in snippet view article find links to article
Stone–Čech compactification of the integers Novak space Strong ultrafilter topology Single ultrafilter topology Nested rectangles Topologist's sine curve Closed
List of formal systems (284 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Truth predicate (230 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Diagram (mathematical logic) (314 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Donaldson Company (1,684 words) [view diff] exact match in snippet view article find links to article
million 2002 - Acquired industrial parts maker Ultrafilter International AG for $68 million. Ultrafilter had sales of $100 million and operated in 30 countries
List of mathematical proofs (593 words) [view diff] exact match in snippet view article find links to article
(as corollaries of Lindemann–Weierstrass) Tychonoff's theorem (to do) Ultrafilter lemma Ultraparallel theorem Urysohn's lemma Van der Waerden's theorem
Independence (mathematical logic) (519 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Compactness theorem (1,947 words) [view diff] exact match in snippet view article find links to article
A i {\displaystyle A_{i}} generates a proper filter, so there is an ultrafilter U {\displaystyle U} containing all sets of the form A i . {\displaystyle
Propositional variable (445 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Formation rule (442 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Quantifier rank (516 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Map (mathematics) (708 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Extensionality (618 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Lemma (mathematics) (399 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Classical logic (841 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Singular cardinals hypothesis (708 words) [view diff] exact match in snippet view article find links to article
measure one—i.e., there is normal κ {\displaystyle \kappa } -complete ultrafilter D on P ( κ ) {\displaystyle {\mathcal {P}}(\kappa )} such that { α <
Truth value (863 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Predicate variable (560 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Self-verifying theories (419 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Atomic formula (523 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Logical constant (289 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Model theory (9,065 words) [view diff] exact match in snippet view article find links to article
agree on almost all entries, where almost all is made precise by an ultrafilter U on I. An ultraproduct of copies of the same structure is known as an
Lindström's theorem (386 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Model complete theory (557 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Symbol (formal) (494 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Semantics of logic (590 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Uniqueness quantification (848 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Uninterpreted function (410 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Equiconsistency (732 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Formal proof (579 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Predicate (logic) (421 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Sentence (mathematical logic) (461 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Urelement (995 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
T-schema (584 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Free logic (973 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Timeline of mathematical logic (948 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Logical equivalence (751 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Inner model theory (355 words) [view diff] exact match in snippet view article find links to article
relative to a normal, non-principal, κ {\displaystyle \kappa } -complete ultrafilter U over an ordinal κ {\displaystyle \kappa } (see zero dagger). One important
Domain of a function (962 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Elementary equivalence (956 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Monadic predicate calculus (698 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Ground expression (656 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Soundness (1,096 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Elementary equivalence (956 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Substructure (mathematics) (754 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Soundness (1,096 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Spectrum of a theory (1,132 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Higher-order logic (1,066 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Validity (logic) (1,110 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Semantic theory of truth (1,050 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Elementary function arithmetic (875 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Spectrum of a sentence (1,365 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Arity (1,464 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Codensity monad (952 words) [view diff] exact match in snippet view article find links to article
inclusion of FinSet into Set is the ultrafilter monad associating to any set M {\displaystyle M} the set of ultrafilters on M . {\displaystyle M.} This was
Infinite-valued logic (1,480 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Complete theory (396 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Alphabet (formal languages) (842 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Saturated model (1,095 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Monadic second-order logic (1,308 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Syntax (logic) (1,052 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Decision problem (1,261 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Logical conjunction (1,465 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Mathematical structure (651 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Signature (logic) (1,339 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Open formula (394 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Inhabited set (1,358 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Binary operation (1,568 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Non-logical symbol (783 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Extension by new constant and function names (425 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Codomain (1,051 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Logical equality (614 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Existential quantification (1,535 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Functional predicate (1,252 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Enumeration (1,633 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Decidability (logic) (1,889 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Finite-valued logic (1,322 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Categorical theory (1,157 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Range of a function (835 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Prime model (508 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Completeness (logic) (771 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Extension by definition (1,504 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Primitive recursive arithmetic (1,369 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Argument of a function (436 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Abstract model theory (169 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Computably enumerable set (1,318 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Cauchy space (705 words) [view diff] exact match in snippet view article find links to article
following properties: For each x ∈ X , {\displaystyle x\in X,} the discrete ultrafilter at x , {\displaystyle x,} denoted by U ( x ) , {\displaystyle U(x),}
Metalanguage (1,426 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Stratification (mathematics) (820 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Łoś–Vaught test (233 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Formal system (1,520 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Glossary of set theory (11,628 words) [view diff] exact match in snippet view article find links to article
or ultraproduct ultrafilter 1.  A maximal filter 2.  The ultrafilter number 𝔲 is the minimum possible cardinality of an ultrafilter base ultrapower An
List of lemmas (525 words) [view diff] exact match in snippet view article find links to article
Kelly's lemma Kőnig's lemma Szemerédi regularity lemma Higman's lemma Ultrafilter lemma Barbalat's lemma Kac's lemma (ergodic theory) Shadowing lemma Big-little-big
Grothendieck universe (1,342 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Hahn–Banach theorem (12,640 words) [view diff] exact match in snippet view article find links to article
proof of the general case uses Zorn's lemma although the strictly weaker ultrafilter lemma (which is equivalent to the compactness theorem and to the Boolean
Undecidable problem (1,921 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Logical truth (1,094 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Metavariable (329 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
C-minimal theory (421 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Levi-Civita field (1,237 words) [view diff] exact match in snippet view article find links to article
constructed as ultrapowers of R {\displaystyle \mathbb {R} } modulo a free ultrafilter on N {\displaystyle \mathbb {N} } (although here the embeddings are not
List of statements independent of ZFC (2,182 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Axiomatic system (1,763 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Logical consequence (1,910 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Surjective function (2,184 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Vopěnka's principle (597 words) [view diff] exact match in snippet view article find links to article
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 is a binary relation
Theory (mathematical logic) (1,695 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Well-formed formula (2,164 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
List of statements independent of ZFC (2,182 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Surjective function (2,184 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Product topology (2,230 words) [view diff] exact match in snippet view article find links to article
space. A specialization of Tychonoff's theorem that requires only the ultrafilter lemma (and not the full strength of the axiom of choice) states that
Finitary relation (1,905 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Gödel numbering (1,536 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Logical disjunction (1,937 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Robinson arithmetic (1,839 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Atomic sentence (1,196 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Elementary proof (623 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Weakly o-minimal structure (508 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Richard's paradox (1,800 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Proof-theoretic semantics (350 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Negation (2,236 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Proof theory (2,666 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Contradiction (2,670 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Material conditional (2,109 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Totally bounded space (1,935 words) [view diff] exact match in snippet view article find links to article
\operatorname {cl} _{\widehat {X}}S} of S {\displaystyle S} is compact. Every ultrafilter on S {\displaystyle S} is a Cauchy filter. The definition of right totally
Proof without words (931 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Von Neumann cardinal assignment (651 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Banach–Alaoglu theorem (8,306 words) [view diff] exact match in snippet view article find links to article
constructive proof. In the general case of an arbitrary normed space, the ultrafilter Lemma, which is strictly weaker than the axiom of choice and equivalent
Injective function (2,575 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Weakly compact cardinal (918 words) [view diff] exact match in snippet view article find links to article
a κ {\displaystyle \kappa } -complete ultrafilter. (W. W. Comfort, S. Negrepontis, The Theory of Ultrafilters, p.185) κ {\displaystyle \kappa } has Alexander's
Aleph number (2,453 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Beth definability (315 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Universal quantification (2,503 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Hilbert's axioms (2,313 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Satisfiability (1,500 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Atomic model (mathematical logic) (344 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Mathematical object (2,770 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Tarski's undefinability theorem (2,271 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Walter Carnielli (1,075 words) [view diff] exact match in snippet view article find links to article
Quarterly 39 (1993) pp. 461–474. W. A. Carnielli (with P. A. S. Veloso). Ultrafilter logic and generic reasoning. In Computational Logic and Proof Theory
Eduard Helly (724 words) [view diff] exact match in snippet view article find links to article
intervals of the real numbers; the more general theorem requires the ultrafilter lemma, a weakened variant of the axiom of choice, which had not yet been
Proof by exhaustion (940 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Electrophoretic deposition (4,331 words) [view diff] exact match in snippet view article find links to article
process may utilize an ultrafilter to dewater a portion of the bath from the coating vessel to be used as rinse material. If an ultrafilter is used, all of the
Substitution (logic) (2,938 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
NP (complexity) (2,784 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Universe (mathematics) (2,649 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Institutional model theory (358 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Supertask (2,385 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Boolean function (2,887 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Recursion (3,677 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Hilbert's second problem (1,500 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Inaccessible cardinal (2,247 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Well-founded relation (1,378 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Formal language (3,163 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
O-minimal theory (1,294 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Richardson's theorem (704 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Tautology (logic) (3,114 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Variable (mathematics) (3,784 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Invariant basis number (1,027 words) [view diff] exact match in snippet view article find links to article
free module over an IBN ring have the same cardinality. Assuming the ultrafilter lemma (a strictly weaker form of the axiom of choice), this result is
Entscheidungsproblem (2,642 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Consistency (2,931 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Algebraic logic (2,224 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Axiom (4,918 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Square of opposition (3,161 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Amalgamation property (817 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Interpretation (model theory) (824 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Term (logic) (2,808 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Logical connective (3,164 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Back-and-forth method (688 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Formal grammar (3,450 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Computer-assisted proof (2,071 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Proof by contradiction (2,529 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Theorem (4,409 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Computable function (3,401 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Approach space (976 words) [view diff] exact match in snippet view article find links to article
the Stone–Čech compactification of the integers. A point U ∈ βN is an ultrafilter on N. A subset A ⊆ βN induces a filter F(A) = ∩ {U : U ∈ A}. Let b(U
Functional completeness (1,957 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Automated theorem proving (2,933 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Löwenheim–Skolem theorem (2,795 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Finite model theory (3,107 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Term logic (3,903 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Følner sequence (924 words) [view diff] exact match in snippet view article find links to article
doesn't necessarily exist. To overcome this technicality, we take an ultrafilter U {\displaystyle U} on the natural numbers that contains intervals [
Basis (linear algebra) (4,751 words) [view diff] exact match in snippet view article
generally require the axiom of choice or a weaker form of it, such as the ultrafilter lemma. If V is a vector space over a field F, then: If L is a linearly
Three-valued logic (3,292 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Rule of inference (7,292 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Logical biconditional (1,794 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Tarski's axioms (3,825 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Argument (4,258 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Truth table (3,307 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Gentzen's consistency proof (1,993 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Model-theoretic grammar (526 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Compact space (5,704 words) [view diff] exact match in snippet view article find links to article
X has a cluster point. Every filter on X has a cluster point. Every ultrafilter on X converges to at least one point. Every infinite subset of X has
List of axiomatic systems in logic (3,906 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Second-order logic (4,502 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Beck's monadicity theorem (1,051 words) [view diff] exact match in snippet view article find links to article
Sci. Paris, 270 (A): 96–98 Leinster, Tom (2013), "Codensity and the ultrafilter monad", Theory and Applications of Categories, 28: 332–370, arXiv:1209
Mathematical proof (4,780 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
List of superseded scientific theories (3,004 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Quantifier (logic) (4,559 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Successor cardinal (564 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Quasi-isometry (2,392 words) [view diff] exact match in snippet view article find links to article
metric spaces. Let (X,d) be a metric space, let ω be a non-principal ultrafilter on N {\displaystyle \mathbb {N} } and let pn ∈ X be a sequence of base-points
Ross–Littlewood paradox (1,265 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Identity type (406 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Syllogism (5,126 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Interpretation (logic) (4,478 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Kőnig's theorem (set theory) (1,232 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Law of noncontradiction (3,174 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Electromagnetic absorption by water (3,079 words) [view diff] exact match in snippet view article find links to article
column of water about 10 m in length; the water must be passed through an ultrafilter to eliminate color due to Rayleigh scattering which also can make water
Mathematical logic (8,370 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Computability theory (6,425 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
List of first-order theories (5,269 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Partition regularity (1,116 words) [view diff] exact match in snippet view article find links to article
}{\frac {|\{1,2,\ldots ,n\}\cap A|}{n}}.} (Szemerédi's theorem) For any ultrafilter U {\displaystyle \mathbb {U} } on a set X {\displaystyle X} , U {\displaystyle
Spectrum of a ring (4,089 words) [view diff] exact match in snippet view article find links to article
MR 1730819 Fontana, Marco; Loper, K. Alan (2008). "The Patch Topology and the Ultrafilter Topology on the Prime Spectrum of a Commutative Ring". Communications
Halting problem (7,356 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Expression (mathematics) (5,457 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Proof of impossibility (3,915 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Fraïssé limit (1,388 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Peano axioms (6,478 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Structural induction (1,750 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Strongly minimal theory (405 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Joint embedding property (320 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Law of excluded middle (5,615 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Turing machine (9,420 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Decidability of first-order theories of the real numbers (496 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Decidability of first-order theories of the real numbers (496 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Mathematical induction (6,914 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Structure (mathematical logic) (5,097 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Boolean algebra (9,572 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Reverse mathematics (4,781 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Type theory (8,234 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Primitive recursive function (7,211 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Smallest organisms (5,879 words) [view diff] exact match in snippet view article find links to article
strain RB2256 is reported to have passed through a 220 nm (0.00022 mm) ultrafilter. A complicating factor is nutrient-downsized bacteria, bacteria that
Banach–Tarski paradox (6,915 words) [view diff] exact match in snippet view article find links to article
of choice but can be proved using a weaker version of AC called the ultrafilter lemma. Here a proof is sketched which is similar but not identical to
Foundations of mathematics (6,910 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Kolmogorov complexity (7,565 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Gödel's incompleteness theorems (12,134 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Subbase (2,157 words) [view diff] exact match in snippet view article find links to article
the full strength of choice. Instead, it relies on the intermediate Ultrafilter principle. Using this theorem with the subbase for R {\displaystyle \mathbb
Equality (mathematics) (7,684 words) [view diff] exact match in snippet view article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Proof by infinite descent (2,223 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Church–Turing thesis (6,820 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Fixed-point logic (2,030 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Lambda calculus (11,994 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Cardinal assignment (589 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Field of sets (3,669 words) [view diff] exact match in snippet view article find links to article
to its ultrafilters and that an atom is below an element of a finite Boolean algebra if and only if that element is contained in the ultrafilter corresponding
Philosophy of mathematics (10,964 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Tarski's high school algebra problem (1,701 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
First-order logic (12,931 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Saturated set (1,160 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Contraposition (6,175 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Skolem's paradox (3,331 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Course-of-values recursion (1,299 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Natural deduction (6,972 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Stable theory (3,633 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Propositional calculus (11,441 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Truth-value semantics (632 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Fecal sludge management (7,101 words) [view diff] exact match in snippet view article find links to article
membranes (mesh fabric, sand, granular activated carbon (GAC), microfilter, ultrafilter) and installed on the bed of a small truck. The target application is
Induction, bounding and least number principles (1,211 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Church encoding (8,544 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Proof sketch for Gödel's first incompleteness theorem (2,988 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Satisfiability modulo theories (4,371 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Satisfiability modulo theories (4,371 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Equivalent definitions of mathematical structures (3,272 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Compactly generated space (4,678 words) [view diff] exact match in snippet view article find links to article
Fortissimo space). The Arens-Fort space. The Appert space. The "Single ultrafilter topology". Other examples of (Hausdorff) spaces that are not compactly
Pierre Grabar (2,497 words) [view diff] exact match in snippet view article find links to article
developed a technique of fractionation of proteins through nitrocellulose ultrafilters of defined porosity, making it possible to specify the dimensions of
Propositional formula (11,131 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Epsilon-induction (4,195 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Complete topological vector space (15,850 words) [view diff] exact match in snippet view article find links to article
Hausdorff TVS X {\displaystyle X} is totally bounded if and only if every ultrafilter on S {\displaystyle S} is Cauchy, which happens if and only if it is
Cantor's first set theory article (7,583 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Implementation of mathematics in set theory (10,960 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Conjunction/disjunction duality (1,337 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann
Hilbert system (3,534 words) [view diff] exact match in snippet view article find links to article
Countable Uncountable Empty Inhabited Singleton Finite Infinite Transitive Ultrafilter Recursive Fuzzy Universal Universe constructible Grothendieck Von Neumann