
The omitting types theorem of infinitary logic is used to prove that every small Π 1 1 \Pi _1^1 set of analysis or any small Σ 1 {\Sigma _1} set of set theory is constructible.
Descriptive set theory, Hierarchies of computability and definability
Descriptive set theory, Hierarchies of computability and definability
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
