scientific article; zbMATH DE number 1534570

MaRDI QIDQ4517355zbMATH OpenFDO

Authors A. N. Khisamiev

Publication date 21 November 2000

zbMATH Keywords

admissible setconstructive modelrecursive modelresolvent admissible set

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Review text

A model \(M\) is called internally enumerable if there exists a \(\Sigma\)-function \(\nu\:\omega\to M\) over HF(\(M\)) which is onto. The author proves that a hereditarily finite admissible set HF(\(M\)) is resolvent if and only if the universe of \(M\) is resolvent in HF(\(M\)). As a corollary, he proves that if \(M\) is internally enumerable then HF(\(M\)) is resolvent and, in particular, so are the hereditarily finite superstructures over standard models of arithmetics and finitely generated algebras. The author also proves that there exists a non-internally enumerable model \(M\) for which HF(\(M\)) is resolvent.

Recommendations

• scientific article; zbMATH DE number 4197976
• scientific article; zbMATH DE number 1746559
• Principal numerations of functionals on admissible sets
• Numberings and definability in the hereditarily finite superstructure of a model
• scientific article; zbMATH DE number 1191236

Cited in

(7)

• On positive enumarated models
• The intrinsic enumerability of linear orders
• Large resplendent models generated by indiscernibles
• scientific article; zbMATH DE number 1746559 (Why is no real title available?)
• Using resolution for deciding solvable classes and building finite models
• Inner Models of Univalence
• Quasiresolvent Models

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 Q4517355)