A universal recursive function on admissible sets

DOI10.1007/BF01979014zbMath0633.03033OpenAlexW2027167403MaRDI QIDQ1095896

V. A. Rudnev

Publication date: 1986

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/187359

zbMATH Keywords

admissible sethereditary finite sets with urelementsKripke-Platek axiom systemuniversal recursive function

Mathematics Subject Classification ID

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

Related Items (11)

\(\Sigma \)-bounded algebraic systems and universal functions. I ⋮ Bounded algebraic systems and universal functions ⋮ 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 ⋮ \(\Sigma \)-uniform structures and \(\Sigma \)-functions. I ⋮ 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 ⋮ A class of almost \(c\)-simple rings

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: A universal recursive function on admissible sets