Semidecidable numberings in admissible sets

DOI10.1007/S10469-020-09599-4zbMath1484.03081OpenAlexW3097702350MaRDI QIDQ2213938

M. Kh. Faizrakhmanov, V. G. Puzarenko, Iskander Sh. Kalimullin

Publication date: 4 December 2020

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-020-09599-4

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Positive presentations of families relative to \(e\)-oracles
• Positive numberings in admissible sets
• Computable positive and Friedberg numberings in hyperarithmetic
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Non Σ_n axiomatizable almost strongly minimal theories
• Jump inversions of algebraic structures and Σ‐definability
• Complexity of Categorical Theories with Computable Models

This page was built for publication: Semidecidable numberings in admissible sets