Crossref
On the Computational Content of Moduli of Regularity and their Logical Strength
Electronic Proceedings in Theoretical Computer Science · 04.03.2026 · 441 · 185-196
DOI: 10.4204/eptcs.441.11 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Proceedings in Theoretical Computer Science, online erschienen am 04.03.2026. Verfasst von Ulrich Kohlenbach. Die Arbeit nennt 29 Literaturangaben.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Kohlenbach, U. (2026). On the Computational Content of Moduli of Regularity and their Logical Strength. Electronic Proceedings in Theoretical Computer Science, 441, 185-196. https://doi.org/10.4204/eptcs.441.11
Vancouver
Kohlenbach U. On the Computational Content of Moduli of Regularity and their Logical Strength. Electronic Proceedings in Theoretical Computer Science. 2026;441:185-196. doi:10.4204/eptcs.441.11
BibTeX
@article{Kohlenbach2026,
author = {Kohlenbach, Ulrich},
title = {On the Computational Content of Moduli of Regularity and their Logical Strength},
journal = {Electronic Proceedings in Theoretical Computer Science},
year = {2026},
volume = {441},
pages = {185--196},
doi = {10.4204/eptcs.441.11}
}
EUVIMED