This article is cited in 2 papers

Linear orderings. Coding theorems

A. N. Frolov

Institute of Mathematics and Mechanics, Kazan (Volga Region) Federal University

Abstract: In this paper, we consider $\mathbf0'$- and $\mathbf0''$-coding theorems. We obtain two general theorems which generalize all $\mathbf0'$- and $\mathbf0''$-coding theorems known at this moment. Using one $\mathbf0'$-coding theorem, we describe ranges of $\eta$-functions of $\eta$-like linear orderings with no computable representations.

Keywords: linear orderings, computable representations, coding theorems.

UDC: 510.53

Received: 14.02.2012