Crossref
A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets
Archive for Mathematical Logic · 2002-04 · 41 (3) · 251-257
DOI: 10.1007/s001530100107 ↗Kurz gefasst
Fachartikel in der Zeitschrift Archive for Mathematical Logic, online erschienen am 25.02.2002. Verfasst von Arnold Beckmann.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Beckmann, A. (2002). A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets. Archive for Mathematical Logic, 41(3), 251-257. https://doi.org/10.1007/s001530100107
Vancouver
Beckmann A. A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets. Archive for Mathematical Logic. 2002;41(3):251-257. doi:10.1007/s001530100107
BibTeX
@article{Beckmann2002,
author = {Beckmann, Arnold},
title = {A non-well-founded primitive recursive tree provably well-founded for co-r.e. sets},
journal = {Archive for Mathematical Logic},
year = {2002},
volume = {41},
number = {3},
pages = {251--257},
doi = {10.1007/s001530100107}
}
EUVIMED