Rudimentary recursion, gentle functions and provident sets

DOI10.1215/00294527-2835101zbMath1371.03061OpenAlexW2078719364MaRDI QIDQ2345391

N. J. Bowler, Adrian R. D. Mathias

Publication date: 22 May 2015

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1427202973

zbMATH Keywords

delayattaincanonical progressgentle functionprovident closureprovident setrudimentary recursionsolid progressstrict progress

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Axiomatics of classical set theory and its fragments (03E30) Other aspects of forcing and Boolean-valued models (03E40) Higher-type and set recursion theory (03D65)

Related Items (6)

Unordered pairs in the set theory of Bourbaki 1949 ⋮ Constructing the constructible universe constructively ⋮ The formal verification of the ctm approach to forcing ⋮ Applicable Mathematics in a Minimal Computational Theory of Sets ⋮ Mathias and set theory ⋮ The lost melody theorem for infinite time Blum-Shub-Smale machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unordered pairs in the set theory of Bourbaki 1949
• Slim models of Zermelo set theory
• Fine Structure
• Reconsidering Ordered Pairs
• A converse of the Barwise completeness theorem
• Provident sets and rudimentary set forcing
• The fine structure of the constructible hierarchy
• The strength of Mac Lane set theory

This page was built for publication: Rudimentary recursion, gentle functions and provident sets