On the admissible sets of type \(\mathbb{H}\mathbb{Y}\mathbb{P}(\mathfrak M)\) over recursively saturated models

DOI10.1134/S0037446611060012zbMath1256.03049MaRDI QIDQ662638

R. R. Avdeev

Publication date: 24 February 2012

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

zbMATH Keywords

uniformizationadmissible setdecidable theoriesSkolem functionseffective reducibilityHFHYPmodel-complete theoriesrecursively saturated model

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (2)

A computable structure with nonstandard computability ⋮ A Computable Structure with Non-Standard Computability

Cites Work

• Descriptive properties on admissible sets
• The uniformization property in hereditary finite superstructures
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the admissible sets of type \(\mathbb{H}\mathbb{Y}\mathbb{P}(\mathfrak M)\) over recursively saturated models