Zero sharp | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

In the mathematical discipline of set theory, 0# (zero sharp, also 0#) is the set of true formulae about indiscernibles and order-indiscernibles in the Gödel constructible universe. It is often encoded as a subset of the integers (using Gödel numbering), or as a subset of the hereditarily finite sets, or as a real number. Its existence is unprovable in ZFC, the standard form of axiomatic set theory, but follows from a suitable large cardinal axiom. It was first introduced as a set of formulae in Silver's 1966 thesis, later published as , where it was denoted by Σ, and rediscovered by , who considered it as a subset of the natural numbers and introduced the notation O# (with a capital letter O; this later changed to the numeral '0'). Roughly speaking, if 0# exists then the universe V of sets is much larger than the universe L of constructible sets, while if it does not exist then the universe of all sets is closely approximated by the constructible sets. Zero sharp was defined by Silver and Solovay as follows. Consider the language of set theory with extra constant symbols c1, c2, ... for each positive integer. Then 0# is defined to be the set of Gödel numbers of the true sentences about the constructible universe, with ci interpreted as the uncountable cardinal . (Here means in the full universe, not the constructible universe.) If there is in V an uncountable set of Silver order-indiscernibles in the constructible universe L, then 0# is the set of Gödel numbers of formulas θ of set theory such that where ω1, ... ωω are the "small" uncountable initial ordinals in V, but have all large cardinal properties consistent with V=L relative to L. There is a subtlety about this definition: by Tarski's undefinability theorem it is not, in general, possible to define the truth of a formula of set theory in the language of set theory. To solve this, Silver and Solovay assumed the existence of a suitable large cardinal, such as a Ramsey cardinal, and showed that with this extra assumption it is possible to define the truth of statements about the constructible universe.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related concepts (3)

Zero sharp

Erdős cardinal

In mathematics, an Erdős cardinal, also called a partition cardinal is a certain kind of large cardinal number introduced by . A cardinal κ is called α-Erdős if for every function f : κ< ω → {0, 1}, there is a set of order type α that is homogeneous for f . In the notation of the partition calculus, κ is α-Erdős if κ(α) → (α)< ω. The existence of zero sharp implies that the constructible universe L satisfies "for every countable ordinal α, there is an α-Erdős cardinal".

Set theory

Set theory is the branch of mathematical logic that studies sets, which can be informally described as collections of objects. Although objects of any kind can be collected into a set, set theory, as a branch of mathematics, is mostly concerned with those that are relevant to mathematics as a whole. The modern study of set theory was initiated by the German mathematicians Richard Dedekind and Georg Cantor in the 1870s. In particular, Georg Cantor is commonly considered the founder of set theory.