Computable Boolean Algebras and Complexity of the Fréchet Ideal Full article
Journal |
Journal of Mathematical Sciences (United States)
ISSN: 1072-3374 , E-ISSN: 1573-8795 |
||
---|---|---|---|
Output data | Year: 2024, Volume: 284, Number: 1, Pages: 72–82 Pages count : DOI: 10.1007/s10958-024-07328-1 | ||
Authors |
|
||
Affiliations |
|
Funding (1)
1 | Russian Science Foundation | 23-11-00170 |
Cite:
Goncharov S.S.
Computable Boolean Algebras and Complexity of the Fréchet Ideal
Journal of Mathematical Sciences (United States). 2024. V.284. N1. P.72–82. DOI: 10.1007/s10958-024-07328-1 Scopus РИНЦ OpenAlex
Computable Boolean Algebras and Complexity of the Fréchet Ideal
Journal of Mathematical Sciences (United States). 2024. V.284. N1. P.72–82. DOI: 10.1007/s10958-024-07328-1 Scopus РИНЦ OpenAlex
Dates:
Submitted: | May 13, 2024 |
Published print: | Aug 19, 2024 |
Published online: | Sep 23, 2024 |
Identifiers:
Scopus: | 2-s2.0-85201552173 |
Elibrary: | 73752359 |
OpenAlex: | W4401710052 |
Citing:
Пока нет цитирований