On a universal \(\Sigma \)-function over a tree

DOI10.1134/S0037446612020358zbMath1250.03072MaRDI QIDQ1760530

A. N. Khisamiev

Publication date: 14 November 2012

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

zbMATH Keywords

treeadmissible sethereditarily finite admissible setuniversal \(\Sigma \)-function\(\Sigma \)-function

Mathematics Subject Classification ID

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

Related Items (6)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\Sigma \)-bounded algebraic systems and universal functions. I
• \(\Sigma\)-bounded algebraic systems and universal functions. II
• A universal recursive function on admissible sets
• S-Subsets of Natural Numbers

This page was built for publication: On a universal \(\Sigma \)-function over a tree