EUVIMEDEUVIMED entdecken
Crossref

S. Todorčević and Z. Vidnyánszky A complexity problem for Borel graphs Inventiones mathematicae vol. 226 (2021), pp. 225–249.

Allison Wang

The Bulletin of Symbolic Logic · 28.04.2026 · 1-3

DOI: 10.1017/bsl.2026.10151 ↗

Kurz gefasst

Fachartikel in der Zeitschrift The Bulletin of Symbolic Logic, online erschienen am 28.04.2026. Verfasst von Allison Wang.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Zitieren

APA

Wang, A. (2026). S. Todorčević and Z. Vidnyánszky A complexity problem for Borel graphs Inventiones mathematicae vol. 226 (2021), pp. 225–249. The Bulletin of Symbolic Logic, 1-3. https://doi.org/10.1017/bsl.2026.10151

Vancouver

Wang A. S. Todorčević and Z. Vidnyánszky A complexity problem for Borel graphs Inventiones mathematicae vol. 226 (2021), pp. 225–249. The Bulletin of Symbolic Logic. 2026:1-3. doi:10.1017/bsl.2026.10151

BibTeX
@article{Wang2026,
  author = {Wang, Allison},
  title = {S. Todorčević and Z. Vidnyánszky A complexity problem for Borel graphs Inventiones mathematicae vol. 226 (2021), pp. 225–249},
  journal = {The Bulletin of Symbolic Logic},
  year = {2026},
  pages = {1--3},
  doi = {10.1017/bsl.2026.10151}
}
Kostenlos starten →