A computable structure with non-standard computability

DOI10.3103/S1055134419020019MaRDI QIDQ5230801zbMATH OpenOpenAlexFDO

Authors R. R. Avdeev, Vadim 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

\(\Sigma \)-definability\(\Sigma \)-reducibilityadmissible setcomputable modeldecidable modelhereditarily finite superstructurehyperadmissible setrecursively saturated model

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1534487
• scientific article; zbMATH DE number 6536307
• scientific article; zbMATH DE number 1302870
• Spectra of computable models for Ehrenfeucht theories
• Computable trees, prime models, and relative decidability

Cites work

• A certain reducibility on admissible sets
• Computability in special models
• Computable functors and effective interpretability
• Degrees of presentability of structures. I
• HF-computability
• scientific article; zbMATH DE number 996573 (Why is no real title available?)
• scientific article; zbMATH DE number 3779289 (Why is no real title available?)
• scientific article; zbMATH DE number 3494394 (Why is no real title available?)
• scientific article; zbMATH DE number 2047495 (Why is no real title available?)
• scientific article; zbMATH DE number 1534487 (Why is no real title available?)
• scientific article; zbMATH DE number 2154082 (Why is no real title available?)
• scientific article; zbMATH DE number 3995659 (Why is no real title available?)
• scientific article; zbMATH DE number 890268 (Why is no real title available?)
• scientific article; zbMATH DE number 934728 (Why is no real title available?)
• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• Model theory.
• On the admissible sets of type \(\mathbb{H}\mathbb{Y}\mathbb{P}(\mathfrak M)\) over recursively saturated models

Cited in

(3)

• Computable quotient presentations of models of arithmetic and set theory
• scientific article; zbMATH DE number 1534487 (Why is no real title available?)
• Principal numerations of functionals on admissible sets

This page was built for publication: A computable structure with non-standard computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5230801)