fixed ultrafilter

  • 1Ultrafilter — In the mathematical field of set theory, an ultrafilter on a set X is a collection of subsets of X that is a filter, that cannot be enlarged (as a filter). An ultrafilter may be considered as a finitely additive measure. Then every subset of X is …

    Wikipedia

  • 2T1 space — In topology and related branches of mathematics, T1 spaces and R0 spaces are particular kinds of topological spaces.The T1 and R0 properties are examples of separation axioms. Definitions Let X be a topological space and let x and y be points in… …

    Wikipedia

  • 3Boolean-valued model — In mathematical logic, a Boolean valued model is a generalization of the ordinary Tarskian notion of structure or model, in which the truth values of propositions are not limited to true and false , but take values in some fixed complete Boolean… …

    Wikipedia

  • 4Vector space — This article is about linear (vector) spaces. For the structure in incidence geometry, see Linear space (geometry). Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is… …

    Wikipedia

  • 5metalogic — /met euh loj ik/, n. the logical analysis of the fundamental concepts of logic. [1835 45; META + LOGIC] * * * Study of the syntax and the semantics of formal languages and formal systems. It is related to, but does not include, the formal… …

    Universalium

  • 6Banach–Tarski paradox — The Banach–Tarski paradox is a theorem in set theoretic geometry which states that a solid ball in 3 dimensional space can be split into several non overlapping pieces, which can then be put back together in a different way to yield two identical …

    Wikipedia

  • 7New Foundations — In mathematical logic, New Foundations (NF) is an axiomatic set theory, conceived by Willard Van Orman Quine as a simplification of the theory of types of Principia Mathematica. Quine first proposed NF in a 1937 article titled New Foundations for …

    Wikipedia

  • 8Piecewise syndetic set — In mathematics, piecewise syndeticity is a notion of largeness of subsets of the natural numbers. Let mathcal{P} f(mathbb{N}) denote the set of finite subsets of mathbb{N}. Then a set S sub mathbb{N} is called piecewise syndetic if there exists G …

    Wikipedia

  • 9List of forcing notions — In mathematics, forcing is a method of constructing new models M[G] of set theory by adding a generic subset G of a poset P to a model M. The poset P used will determine what statements hold in the new universe (the extension ); to force a… …

    Wikipedia

  • 10List of mathematical proofs — A list of articles with mathematical proofs:Theorems of which articles are primarily devoted to proving them: See also: *Bertrand s postulate and a proof *Estimation of covariance matrices *Fermat s little theorem and some proofs *Gödel s… …

    Wikipedia