Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 56, Number 1 (2015), 3-60.
Rudimentary Recursion, Gentle Functions and Provident Sets
This paper, a contribution to “micro set theory”, is the study promised by the first author in [M4], as improved and extended by work of the second. We use the rudimentarily recursive (set-theoretic) functions and the slightly larger collection of gentle functions to initiate the study of provident sets, which are transitive models of , a subsystem of whose minimal model is Jensen’s . supports familiar definitions, such as rank, transitive closure and ordinal addition—though not ordinal multiplication—and (shown in [M8]) Shoenfield’s unramified forcing. Providence is preserved under directed unions. An arbitrary set has a provident closure, and (shown in [M8]) the extension of a provident by a set-generic is the provident closure of . The improvidence of many models of is shown. The final section uses similar but simpler recursions to show, in the weak system , that the truth predicate for formulæ is .
Notre Dame J. Formal Logic, Volume 56, Number 1 (2015), 3-60.
First available in Project Euclid: 24 March 2015
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Primary: 03E30: Axiomatics of classical set theory and its fragments 03D65: Higher-type and set recursion theory
Secondary: 03E40: Other aspects of forcing and Boolean-valued models 03E45: Inner models, including constructibility, ordinal definability, and core models
Mathias, A. R. D.; Bowler, N. J. Rudimentary Recursion, Gentle Functions and Provident Sets. Notre Dame J. Formal Logic 56 (2015), no. 1, 3--60. doi:10.1215/00294527-2835101. https://projecteuclid.org/euclid.ndjfl/1427202973