Standard

Computable Boolean Algebras and Complexity of the Fréchet Ideal. / Goncharov, S. S.

In: Journal of Mathematical Sciences (United States), Vol. 284, No. 1, 19.08.2024, p. 72-82.

Research output: Contribution to journal › Article › peer-review

Harvard

Goncharov, SS 2024, 'Computable Boolean Algebras and Complexity of the Fréchet Ideal', Journal of Mathematical Sciences (United States), vol. 284, no. 1, pp. 72-82. https://doi.org/10.1007/s10958-024-07328-1

APA

Goncharov, S. S. (2024). Computable Boolean Algebras and Complexity of the Fréchet Ideal. Journal of Mathematical Sciences (United States), 284(1), 72-82. https://doi.org/10.1007/s10958-024-07328-1

Vancouver

Goncharov SS. Computable Boolean Algebras and Complexity of the Fréchet Ideal. Journal of Mathematical Sciences (United States). 2024 Aug 19;284(1):72-82. doi: 10.1007/s10958-024-07328-1

Author

Goncharov, S. S. / Computable Boolean Algebras and Complexity of the Fréchet Ideal. In: Journal of Mathematical Sciences (United States). 2024 ; Vol. 284, No. 1. pp. 72-82.

BibTeX

@article{a153084b160a4b0887bb3a2905efbb0c,
title = "Computable Boolean Algebras and Complexity of the Fr{\'e}chet Ideal",
abstract = "The concept of computability of Boolean algebras is widely used in the theory of constructive and computable models, initiated by A. I. Mal{\textquoteright}tsev in the 1960s and actively developed in recent decades. In this paper, we study the long-standing question concerning the decidability of the Fr{\'e}chet ideal and connections with the decidability of the set of atoms.",
author = "Goncharov, {S. S.}",
year = "2024",
month = aug,
day = "19",
doi = "10.1007/s10958-024-07328-1",
language = "English",
volume = "284",
pages = "72--82",
journal = "Journal of Mathematical Sciences (United States)",
issn = "1072-3374",
publisher = "Springer Nature",
number = "1",

}

RIS

TY - JOUR

T1 - Computable Boolean Algebras and Complexity of the Fréchet Ideal

AU - Goncharov, S. S.

PY - 2024/8/19

Y1 - 2024/8/19

N2 - The concept of computability of Boolean algebras is widely used in the theory of constructive and computable models, initiated by A. I. Mal’tsev in the 1960s and actively developed in recent decades. In this paper, we study the long-standing question concerning the decidability of the Fréchet ideal and connections with the decidability of the set of atoms.

AB - The concept of computability of Boolean algebras is widely used in the theory of constructive and computable models, initiated by A. I. Mal’tsev in the 1960s and actively developed in recent decades. In this paper, we study the long-standing question concerning the decidability of the Fréchet ideal and connections with the decidability of the set of atoms.

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85201552173&origin=inward&txGid=ec17bdbe692b999770f7d5f5d86042a8

UR - https://www.mendeley.com/catalogue/edabe7d0-d7f1-37f6-a113-48b3f8edeb98/

U2 - 10.1007/s10958-024-07328-1

DO - 10.1007/s10958-024-07328-1

M3 - Article

VL - 284

SP - 72

EP - 82

JO - Journal of Mathematical Sciences (United States)

JF - Journal of Mathematical Sciences (United States)

SN - 1072-3374

IS - 1

ER -

ID: 60848704