Elementary theories and hereditary undecidability for semilattices of numberings

Bazhenov, Nikolay; Mustafa, Manat; Yamaleev, M. M.

doi:10.1007/s00153-018-0647-y

Cited by 6 publications

(2 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Badaev, Goncharov, and Sorbi [30] proved that for any natural number n ≥ 2, there are infinitely many pairwise elementarily non-equivalent Rogers Σ 0 n -semilattices. The reader is referred to, e.g., [19,31,32,33] for further results on Rogers Σ 0 n -semilattices. Rogers semilattices in the analytical hierarchy were previously studied by Dorzhieva [34,35].…”

Section: Preliminariesmentioning

confidence: 99%

Isomorphism types of Rogers semilattices in the analytical hierarchy

Bazhenov¹,

Ospichev²,

Yamaleev³

2019

Preprint

Self Cite

View full text Add to dashboard Cite

A numbering of a countable family S is a surjective map from the set of natural numbers ω onto S. A numbering ν is reducible to a numbering µ if there is an effective procedure which given a ν-index of an object from S, computes a µ-index for the same object. The reducibility between numberings gives rise to a class of upper semilattices, which are usually called Rogers semilattices. The paper studies Rogers semilattices for families S ⊂ P (ω) belonging to various levels of the analytical hierarchy. We prove that for any non-zero natural numbers m = n, any non-trivial Rogers semilattice of a Π 1 m -computable family cannot be isomorphic to a Rogers semilattice of a Π 1 n -computable family. One of the key ingredients of the proof is an application of the result by Downey and Knight on degree spectra of linear orders.

show abstract

Section: Preliminariesmentioning

confidence: 99%

Isomorphism types of Rogers semilattices in the analytical hierarchy

Bazhenov¹,

Ospichev²,

Yamaleev³

2019

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…Goncharov and Sorbi (1997) started developing the theory of generalized computable numberings. Their approach initiated a fruitful line of research, which is focused on numberings for families of sets which belong to various levels of recursion-theoretic hierarchies: the arithmetical hierarchy (Badaev et al 2006;Bazhenov et al 2019c;Podzorov 2008), the Ershov hierarchy (Badaev and Lempp 2009;Goncharov et al 2002;Herbert et al 2019;Ospichev 2015), the analytical hierarchy (Bazhenov et al 2019d(Bazhenov et al , 2020bDorzhieva 2019), etc. We refer the reader to Goncharov (2008, 2000) for further background on numberings in these hierarchies.…”

Section: Introductionmentioning

confidence: 99%

Rogers semilattices of punctual numberings

Bazhenov

Mustafa

Ospichev

2022

Math. Struct. Comp. Sci.

Self Cite

View full text Add to dashboard Cite

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.

show abstract