A Computable Structure with Non-Standard Computability

DOI10.3103/S1055134419020019zbMath1438.03014OpenAlexW2947474490MaRDI QIDQ5230801

R. R. Avdeev, V. G. Puzarenko

Publication date: 28 August 2019

Published in: Siberian Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s1055134419020019

zbMATH Keywords

admissible setcomputable modeldecidable model\(\Sigma \)-definabilityrecursively saturated modelhereditarily finite superstructure\(\Sigma \)-reducibilityhyperadmissible set

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) 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
• Model theory.
• Degrees of presentability of structures. I
• COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item