Universal functions and almost \(c\)-simple models

DOI10.1134/S0037446615030167zbMath1328.03045OpenAlexW2246086743MaRDI QIDQ498242

A. N. Khisamiev

Publication date: 28 September 2015

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

Full work available at URL: https://doi.org/10.1134/s0037446615030167

zbMATH Keywords

treeequivalencealmost \(c\)-simple modelhereditarily finite admissible setuniversal \(\sigma\)-function

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Related Items (4)

Universal functions over trees ⋮ Universal functions and \(K \Sigma \)-structures ⋮ Universal functions and unbounded branching trees ⋮ A class of almost \(c\)-simple rings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\Sigma \)-bounded algebraic systems and universal functions. I
• \(\Sigma\)-bounded algebraic systems and universal functions. II
• \(\Sigma \)-uniform structures and \(\Sigma \)-functions. I
• \(\Sigma \)-uniform structures and \(\Sigma \)-functions. II
• A universal recursive function on admissible sets
• Model theory
• On a universal \(\Sigma \)-function over a tree
• The uniformization problem for \(\Sigma\)-predicates in a hereditarily finite list superstructure over the real exponential field
• S-Subsets of Natural Numbers
• The Computable Dimension of I-Trees of Infinite Height

This page was built for publication: Universal functions and almost \(c\)-simple models