Game arguments in some existence theorems of Friedberg numberings
Logic
2020-03-23 v9
Abstract
We provide game-theoretic proofs of some well-known existence theorems of Friedberg numberings for the class of all partial computable functions, including (1) the existence of two incomparable Friedberg numberings; (2) the existence of a uniformly c.e. sequence of pairwise incomparable Friedberg numberings; (3) the existence of a uniformly c.e. independent sequence of Friedberg numberings. Parameterizing these proofs, we have game-theoretic proofs of Kummer's criteria and their modifications.
Keywords
Cite
@article{arxiv.1508.04387,
title = {Game arguments in some existence theorems of Friedberg numberings},
author = {Takuma Imamura},
journal= {arXiv preprint arXiv:1508.04387},
year = {2020}
}