Undecidability of elementary theories of Rogers semilattices of analytical hierarchies

DOI10.17377/SEMI.2016.13.013zbMath1353.03049MaRDI QIDQ2630488

M. V. Dorzhieva

Publication date: 28 July 2016

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

analytical hierarchycomputable numberingsRogers semilatticesminimal numberings

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Theory of numerations, effectively presented structures (03D45) Hierarchies of computability and definability (03D55)

Related Items (5)

Numberings in the analytical hierarchy ⋮ Computable positive and Friedberg numberings in hyperarithmetic ⋮ On universal pairs in the Ershov hierarchy ⋮ Theories of Rogers semilattices of analytical numberings ⋮ Partial decidable presentations in hyperarithmetic

This page was built for publication: Undecidability of elementary theories of Rogers semilattices of analytical hierarchies