On principles of computability on admissible sets

zbMATH Open1095.03029MaRDI QIDQ5476771FDOQ5476771

Authors: Vadim G. Puzarenko, Iskander Kalimullin 

Publication date: 18 July 2006

Recommendations

• Computability in special models
• Descriptive properties on admissible sets
• S-Subsets of Natural Numbers
• On the collection of all computable subsets on admissible sets
• scientific article; zbMATH DE number 4057500

zbMATH Keywords

e-degreeadmissible setcomputably enumerable sethereditarily finite superstructureenumeration reducibilityprinciples of descriptive set theory

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Descriptive set theory (03E15) Abstract and axiomatic computability and recursion theory (03D75)

Cited In (19)

• Absolute and relative properties of negatively numbered families
• S-Subsets of Natural Numbers
• Universal functions and almost \(c\)-simple models
• \(\Sigma \)-uniform structures and \(\Sigma \)-functions. I
• \(\Sigma \)-uniform structures and \(\Sigma \)-functions. II
• Universal functions and \(\Sigma_\omega \)-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)
• Computability in special models
• On a universal \(\Sigma \)-function over a tree
• Title not available (Why is that?)
• Computable positive and Friedberg numberings in hyperarithmetic
• Descriptive properties on admissible sets
• On non-computable functions
• Title not available (Why is that?)
• On processes and structures
• Positive presentations of families in relation to reducibility with respect to enumerability
• The Turing universe in the context of enumeration reducibility
• PA RELATIVE TO AN ENUMERATION ORACLE

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)