scientific article; zbMATH DE number 1533641

MaRDI QIDQ4516989zbMATH OpenFDO

Authors Vadim G. Puzarenko

Publication date 20 November 2000

zbMATH Keywords

\(m\)-degreeadmissible sethereditarily finite superstructuresimplest theoryTuring degree

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• scientific article; zbMATH DE number 1534487
• scientific article; zbMATH DE number 2154089
• scientific article; zbMATH DE number 2167511
• Computable model theory over the reals
• Numberings and definability in the hereditarily finite superstructure of a model

Cited in

(7)

• Computability and universal determinability of negatively representable models
• Decidable models of -stable theories
• Computational model theory: an overview
• scientific article; zbMATH DE number 1534487 (Why is no real title available?)
• Applications of Kolmogorov complexity to computable model theory
• \(\Sigma \)-definability of uncountable models of \(c\)-simple theories
• The theory of hereditarily bounded sets

This page was built for publication:

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