A computable structure with nonstandard computability

DOI10.1007/S10469-017-9463-4zbMath1381.03035OpenAlexW2771600437MaRDI QIDQ1703284

R. R. Avdeev, V. G. Puzarenko

Publication date: 2 March 2018

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

Full work available at URL: https://doi.org/10.1007/s10469-017-9463-4

Mathematics Subject Classification ID

Classification theory, stability, and related concepts in model theory (03C45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• On the admissible sets of type \(\mathbb{H}\mathbb{Y}\mathbb{P}(\mathfrak M)\) over recursively saturated models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A computable structure with nonstandard computability