On definability of ordinals in logic with infinitely long expressions
Akiko Kino · Journal of Symbolic Logic · 1966
Let Ω be an infinite cardinal larger than ω. By Lω we mean a language with infinitely long expressions having no individual constants, and such that the only predicates are < and =, and the length of ν or ∃ in a formula in Lω is smaller than Ω (cf. §2).