|
This article is cited in 5 scientific papers (total in 5 papers)
Mathematical logic, algebra and number theory
Undecidability of elementary theory of Rogers semilattices in analytical hierarchy
M. V. Dorzhieva Novosibirsk State University, st. Pirogova, 2 630090, Novosibirsk, Russia
Abstract:
We prove that the elementary theory of any nontrivial Rogers semilattice for analytical sets of bounded complexity is hereditarily undecidable. We also prove some results on the existence of minimal numberings in such lattices.
Keywords:
analitycal hierarchy, computable numberings, minimal numberings, Rogers semilattices.
Received April 10, 2014, published March 16, 2016
Citation:
M. V. Dorzhieva, “Undecidability of elementary theory of Rogers semilattices in analytical hierarchy”, Sib. Èlektron. Mat. Izv., 13 (2016), 148–153
Linking options:
https://www.mathnet.ru/eng/semr663 https://www.mathnet.ru/eng/semr/v13/p148
|
Statistics & downloads: |
Abstract page: | 192 | Full-text PDF : | 53 | References: | 53 |
|