scientific article; zbMATH DE number 5041640
From MaRDI portal
Publication:5476771
zbMath1095.03029MaRDI QIDQ5476771
V. G. Puzarenko, Iskander Sh. Kalimullin
Publication date: 18 July 2006
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
admissible sete-degreecomputably enumerable sethereditarily finite superstructureenumeration reducibilityprinciples of descriptive set theory
Descriptive set theory (03E15) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Abstract and axiomatic computability and recursion theory (03D75)
Related Items (11)
Descriptive properties on admissible sets ⋮ PA RELATIVE TO AN ENUMERATION ORACLE ⋮ Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting) ⋮ Computable positive and Friedberg numberings in hyperarithmetic ⋮ Positive presentations of families in relation to reducibility with respect to enumerability ⋮ Universal functions and almost \(c\)-simple models ⋮ Universal functions and \(\Sigma_\omega \)-bounded structures ⋮ \(\Sigma \)-uniform structures and \(\Sigma \)-functions. I ⋮ \(\Sigma \)-uniform structures and \(\Sigma \)-functions. II ⋮ On a universal \(\Sigma \)-function over a tree ⋮ Absolute and relative properties of negatively numbered families
This page was built for publication:
