ELEMENTARY PROPERTIES OF ROGERS SEMILATTICES OF ARITHMETICAL NUMBERINGS

S. A. Badaev, С. С. Гончаров, Andrea Sorbi

2003

Closed access Metadata (CSL-JSON)
DOI 10.1142/9789812705815_0001
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

We investigate differences in the elementary theories of Rogers semilattices of arithmetical numberings, depending on structural invariants of the given families of arithmetical sets. It is shown that at any fixed level of the arithmetical hierarchy there exist infinitely many families with pairwise elementary different Rogers semilattices. 1. Preliminaries and Background For unexplained terminology and notations relative to computability theory, our main references are the textbooks of A.I. Mal’tsev [1], H. Rogers [2] and R. Soare [3]. For the main concepts and notions of the theory of numberings we refer to the book of Yu.L. Ershov [4].