Zero sharp

http://dbpedia.org/resource/Zero_sharp an entity of type: WikicatLargeCardinals

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 , p.52), 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'). rdf:langString
rdf:langString Zero sharp
xsd:integer 248085
xsd:integer 1117468071
xsd:integer 2 3
xsd:integer 1
rdf:langString 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 , p.52), 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.
xsd:nonNegativeInteger 9046

data from the linked data cloud