On the collection of all computable subsets on admissible sets

zbMATH Open1299.03049MaRDI QIDQ2454471FDOQ2454471

Authors: Vadim G. Puzarenko 

Publication date: 13 June 2014

Published in: Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: http://semr.math.nsc.ru/v5/p1-7.pdf

Recommendations

• Positive numberings in admissible sets
• scientific article; zbMATH DE number 1873434
• Principal numerations of functionals on admissible sets
• On principles of computability on admissible sets
• S-Subsets of Natural Numbers

zbMATH Keywords

admissible setclassical recursion theoryPost reduction problem

Mathematics Subject Classification ID

Theory of numerations, effectively presented structures (03D45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cited In (4)

• On principles of computability on admissible sets
• S-Subsets of Natural Numbers
• Title not available (Why is that?)
• Principal numerations of functionals on admissible sets

This page was built for publication: On the collection of all computable subsets on admissible sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2454471)