Descriptive Set-theoretic Complexity
Descriptive Set-Theoretic Complexity is a formal measure in mathematical logic that classifies the complexity of sets of real numbers according to their definability and structural properties within the hierarchy of Borel and projective sets in descriptive set theory.
19
Publications
568
Citations
33
Authors
27
Institutions
Publications per year
2017–2026
1
Parents
19
Descriptive complexity theory over the real numbers
Erich Grädel, Klaus Meer · 1995 · 50 citations
Studies in the logic of trees with applications to grammar formalisms
James Rogers · 1994 · 49 citations
1–5 of 19
33
3
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 33
27
California Institute of Technology
Pasadena, United States
3 h-index
6 publications
71 citations
Université Paris Cité
Paris, France
2 h-index
4 publications
43 citations
RWTH Aachen University
Aachen, Germany
2 h-index
3 publications
110 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
3 publications
40 citations
City University of New York
New York, United States
1 h-index
1 publications
35 citations

University of North Texas
Denton, United States
1 h-index
1 publications
72 citations
New York University
New York, United States
1 h-index
1 publications
35 citations
Fields Institute for Research in Mathematical Sciences
Toronto, Canada
1 h-index
1 publications
35 citations
1–8 of 27
TRAN · 2 publications · 24 citations
2
h-index
1 publications · 51 citations
1
h-index
1 publications · 27 citations
1
h-index
1 publications · 28 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5