scientific article; zbMATH DE number 1533641

zbMATH Open0953.03057MaRDI QIDQ4516989

V. G. Puzarenko

Publication date: 20 November 2000

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

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)

Related Items (4)

DECIDABLE MODELS OF ω-STABLE THEORIES ⋮ Computability and universal determinability of negatively representable models ⋮ Applications of Kolmogorov complexity to computable model theory ⋮ Computational model theory: an overview

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)