|
This article is cited in 4 scientific papers (total in 4 papers)
Boolean algebras of elementary characteristic (1,0,1) whose set of atoms and Ershov–Tarski ideal are computable
M. N. Leontieva Novosibirsk State University, Novosibirsk, Russia
Abstract:
It is proved that there exists a computable Boolean algebra of elementary characteristics (1,0,1) which has a computable set of atoms and a computable Ershov–Tarski ideal, but no strongly computable isomorphic copy. Also a description of $\Delta^0_6$-computable Boolean algebras is presented.
Keywords:
Boolean algebra, computability, computable model.
Received: 23.10.2009 Revised: 07.06.2010
Citation:
M. N. Leontieva, “Boolean algebras of elementary characteristic (1,0,1) whose set of atoms and Ershov–Tarski ideal are computable”, Algebra Logika, 50:2 (2011), 133–151; Algebra and Logic, 50:2 (2011), 93–105
Linking options:
https://www.mathnet.ru/eng/al478 https://www.mathnet.ru/eng/al/v50/i2/p133
|
Statistics & downloads: |
Abstract page: | 319 | Full-text PDF : | 205 | References: | 49 | First page: | 10 |
|