On principles of computability on admissible sets
From MaRDI portal
Recommendations
Cited in
(22)- Positive presentations of families in relation to reducibility with respect to enumerability
- On a universal -function over a tree
- Absolute and relative properties of negatively numbered families
- Computable positive and Friedberg numberings in hyperarithmetic
- Universal functions and _ -bounded structures
- On the collection of all computable subsets on admissible sets
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
- scientific article; zbMATH DE number 4134036 (Why is no real title available?)
- scientific article; zbMATH DE number 6536307 (Why is no real title available?)
- Universal functions and almost \(c\)-simple models
- On non-computable functions
- COMPLEXITY OF INDEX SETS OF DESCRIPTIVE SET-THEORETIC NOTIONS
- scientific article; zbMATH DE number 4197977 (Why is no real title available?)
- S-Subsets of Natural Numbers
- The Turing universe in the context of enumeration reducibility
- On processes and structures
- Computability in special models
- PA RELATIVE TO AN ENUMERATION ORACLE
- Descriptive properties on admissible sets
- \(\Sigma \)-uniform structures and \(\Sigma \)-functions. I
- \(\Sigma \)-uniform structures and \(\Sigma \)-functions. II
- Permutation groups and ideals of Turing degrees
This page was built for publication: On principles of computability on admissible sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5476771)
