A computable structure with non-standard computability

DOI10.3103/S1055134419020019zbMATH Open1438.03014OpenAlexW2947474490MaRDI QIDQ5230801FDOQ5230801

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

Recommendations

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

zbMATH Keywords

computable modeladmissible setdecidable 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

• HF-computability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computability in special models
• Model theory.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A certain reducibility on admissible sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the admissible sets of type \(\mathbb{H}\mathbb{Y}\mathbb{P}(\mathfrak M)\) over recursively saturated models
• Degrees of presentability of structures. I
• Title not available (Why is that?)
• Title not available (Why is that?)
• COMPUTABLE FUNCTORS AND EFFECTIVE INTERPRETABILITY
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• 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)