Rogers semilattices of punctual numberings

The paper works within the framework of punctual computability, which is focused on eliminating unbounded search from constructions in algebra and infinite combinatorics. We study punctual numberings, that is, uniform computations for families S of primitive recursive functions. The punctual reducib...

Full description

Saved in:
Bibliographic Details
Published in:Mathematical structures in computer science Vol. 32; no. 2; pp. 164 - 188
Main Authors: Bazhenov, Nikolay, Mustafa, Manat, Ospichev, Sergei
Format: Journal Article
Language:English
Published: Cambridge, UK Cambridge University Press 01.02.2022
Subjects:
ISSN:0960-1295, 1469-8072
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The paper works within the framework of punctual computability, which is focused on eliminating unbounded search from constructions in algebra and infinite combinatorics. We study punctual numberings, that is, uniform computations for families S of primitive recursive functions. The punctual reducibility between numberings is induced by primitive recursive functions. This approach gives rise to upper semilattices of degrees, which are called Rogers pr-semilattices. We show that any infinite, uniformly primitive recursive family S induces an infinite Rogers pr-semilattice R. We prove that the semilattice R does not have minimal elements, and every nontrivial interval inside R contains an infinite antichain. In addition, every non-greatest element from R is a part of an infinite antichain. We show that the $\Sigma_1$ -fragment of the theory Th(R) is decidable.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0960-1295
1469-8072
DOI:10.1017/S0960129522000093