scientific article; zbMATH DE number 1533641

zbMATH Open0953.03057MaRDI QIDQ4516989FDOQ4516989

Vadim G. Puzarenko

Publication date: 20 November 2000

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

admissible setTuring degreehereditarily finite superstructure\(m\)-degreesimplest theory

Mathematics Subject Classification ID

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

Cited In (6)

• Computational model theory: an overview
• Title not available (Why is that?)
• Decidable models of \(\omega\)-stable theories
• The theory of hereditarily bounded sets
• Computability and universal determinability of negatively representable models
• Applications of Kolmogorov complexity to computable model theory

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)