In
ee also
*
*
*
References
* Howard Becker, "The restriction of a Borel equivalence relation to a sparse set", Arch. Math. Logic 42, 335–347 (2003), DOI|10.1007/s001530200142
Wikimedia Foundation. 2010.
Suslin's problem — In mathematics, Suslin s problem is a question about totally ordered sets posed by Mikhail Yakovlevich Suslin in the early 1920s. [cite journal title=Problème 3 last= Souslin first=M. journal=Fundamenta Mathematicae volume=1 date=1920 pages=223]… … Wikipedia
Suslin tree — In mathematics, a Suslin tree is a tree of height omega;1 such that every branch and every antichain is at most countable. (An antichain is a set of elements such that any two are incomparable.)Every Suslin tree is an Aronszajn tree.The existence … Wikipedia
Lambda-Suslin — In mathematics, a subset A of κω is λ Suslin if there is a tree T on κ × λ such that A = p [ T ] .By a tree on κ × λ we mean here a subset T of the union of κ i × λ i for all i ∈ N (or i < ω in set theoretical notation).Here, p [ T ] = { f | ∃ g … Wikipedia
Homogeneously Suslin set — In descriptive set theory, a set S is said to be homogeneously Suslin if it is the projection of a homogeneous tree. S is said to be kappa homogeneously Suslin if it is the projection of a kappa homogeneous tree.If Asubseteq{}^omegaomega is a… … Wikipedia
List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… … Wikipedia
Aronszajn tree — In set theory, an Aronszajn tree is an uncountable tree with no uncountable branches and no uncountable levels. For example, every Suslin tree is an Aronszajn tree. More generally, for a cardinal kappa;, a kappa; Aronszajn tree is a tree of… … Wikipedia
List of statements undecidable in ZFC — The following is a list of mathematical statements that are undecidable in ZFC (the Zermelo–Fraenkel axioms plus the axiom of choice), assuming that ZFC is consistent.Functional analysisCharles Akemann and Nik Weaver showed in 2003 that the… … Wikipedia
Zermelo–Fraenkel set theory — Zermelo–Fraenkel set theory, with the axiom of choice, commonly abbreviated ZFC, is the standard form of axiomatic set theory and as such is the most common foundation of mathematics.ZFC consists of a single primitive ontological notion, that of… … Wikipedia
Tree (set theory) — In set theory, a tree is a partially ordered set (poset) ( T … Wikipedia
List of set theory topics — Logic portal Set theory portal … Wikipedia
