Main Page | See live article | Alphabetical index In mathematics, a cardinal number κ is called totally indescribable iff for every proposition φ and every A ⊆ Vκ with (Vκ, ∈, A) ⊧ φ there exists an α < κ with (Vα, ∈, A ∩ Vα) ⊧ φ. This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License.