Each family of subsets of the urelements generates an admissible set

DOI10.1007/BF00970909zbMATH Open0715.03017MaRDI QIDQ751652FDOQ751652

Authors: Yuri L. Ershov 

Publication date: 1989

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 4057496
• Forcing in admissible sets
• S-Subsets of Natural Numbers
• scientific article; zbMATH DE number 5165178
• scientific article; zbMATH DE number 4057500

zbMATH Keywords

admissible seturelements\(\Sigma \) -extensionrecursively saturated extension

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Each family of subsets of the urelements generates an admissible set

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