Constructible Sets
Constructible Sets is a formal class of sets in set theory defined by transfinite recursion over the ordinals, where each set is explicitly definable from previous stages using first-order formulas, forming the backbone of the constructible universe $L$.
57
Publications
2.7K
Citations
69
Authors
53
Institutions
Publications per year
2017–2026
4
Parents
57
The fine structure of the constructible hierarchy
Ronald Björn Jensen · Annals of Mathematical Logic · 1972 · 681 citations
Computing cylindrical algebraic decomposition via triangular decomposition
Changbo Chen, Marc Moreno Maza, Bican Xia et al. · 2009 · 104 citations
Constructibility and Mathematical Existence.
Michael D. Resnik, Charles S. Chihara · The Journal of Philosophy · 1992 · 100 citations
Humanities, Mathematics, Philosophy +17
Set constructors in a logic database language
Catriel Beeri, Shamim A. Naqvi, Oded Shmueli et al. · The Journal of Logic Programming · 1991 · 94 citations
1–5 of 57
69
3
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 69
53

Uppsala University
Uppsala, Sweden
3 h-index
3 publications
65 citations
Novosibirsk State University
Novosibirsk, Russia
3 h-index
3 publications
41 citations
Sobolev Institute of Mathematics
Novosibirsk, Russia
3 h-index
4 publications
55 citations
Massachusetts Institute of Technology
Cambridge, United States
3 h-index
4 publications
123 citations
Hebrew University of Jerusalem
Jerusalem, Israel
2 h-index
2 publications
37 citations
Institute for Information Transmission Problems
Moscow, Russia
2 h-index
4 publications
62 citations
University of California, Berkeley
Berkeley, United States
2 h-index
2 publications
737 citations
Institut de recherche mathématique de Rennes
Rennes, France
2 h-index
2 publications
47 citations
1–8 of 53
5 publications · 205 citations
5
h-index
TRAN · 4 publications · 175 citations
4
h-index
4 publications · 233 citations
4
h-index
2 publications · 77 citations
2
h-index
2 publications · 108 citations
2
h-index
1–5