Complexity of \(\Sigma^0_n\)-classifications for definable subsets
From MaRDI portal
Publication:2700822
DOI10.1007/s00153-022-00842-6OpenAlexW4286209841MaRDI QIDQ2700822
Svetlana Aleksandrova, M. V. Zubkov, Nikolay Bazhenov
Publication date: 27 April 2023
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-022-00842-6
Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Computable structures and the hyperarithmetical hierarchy
- Classifications of definable subsets
- Ehrenfeucht-Fraïssé games on ordinals
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- A construction for recursive linear orderings
- Orderings with αth Jump Degree 0 (α)
- There is no classification of the decidably presentable structures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item