Friedberg Numberings on Admissible Sets

Friedberg Numberings on Admissible Sets Full article

Journal

Algebra and Logic
ISSN: 0002-5232 , E-ISSN: 1573-8302

Output data

Year: 2026, Volume: 64, Number: 6, Pages: 447-454 Pages count : 8 DOI: 10.1007/s10469-026-09847-z

Tags

admissible set, numbering, Friedberg representation, computable numbering, positive numbering, negative numbering, equivalence relation.

Authors

Puzarenko V.G. ^1,2

Affiliations

1	Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
2	Novosibirsk State University, Novosibirsk, Russia

We consider the problem of existence of single-valued, computable, positive, and negative representations of the family of all computably enumerable subsets on admissible structures. Additionally, a description of the properties of the admissible structures under consideration is given.

Puzarenko V.G.
Friedberg Numberings on Admissible Sets
Algebra and Logic. 2026. V.64. N6. P.447-454. DOI: 10.1007/s10469-026-09847-z OpenAlex

Submitted:	Jan 12, 2026
Accepted:	Jan 21, 2026
Published print:	Aug 28, 2026
Published online:	Aug 28, 2026

≡ OpenAlex:

W7204522059