RUS  ENG
Full version
JOURNALS // Izvestiya Vysshikh Uchebnykh Zavedenii. Matematika // Archive
Izv. Vyssh. Uchebn. Zaved. Mat., 2011 Number 1, Pages 85–90 (Mi ivm7174)
This article is cited in 3 papers

A semilattice generated by superlow computably enumerable degrees

M. Kh. Faizrakhmanov

Chair of Algebra and Mathematical Logic, Kazan State University, Kazan, Russia

Abstract: We prove that a partially ordered set of all computably enumerable (c.e.) degrees that are the least upper bounds of two superlow c.e. degrees is an upper semilattice not elementary equivalent to the semilattice of all c.e. degrees.

Keywords: superlow degrees, low degrees, totally c.e. degrees, critical triples.

UDC: 510.5

Received: 24.05.2009


 English version: Russian Mathematics (Izvestiya VUZ. Matematika), 2011, 55:1, 74–78

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024