Rudimentary Recursion, Gentle Functions and Provident Sets

Notre Dame Journal of Formal Logic 56 (1):3-60 (2015)
  Copy   BIBTEX


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 functions and the slightly larger collection of gentle functions to initiate the study of provident sets, which are transitive models of $\mathsf{PROVI}$, a subsystem of $\mathsf{KP}$ whose minimal model is Jensen’s $J_{\omega}$. $\mathsf{PROVI}$ supports familiar definitions, such as rank, transitive closure and ordinal addition—though not ordinal multiplication—and Shoenfield’s unramified forcing. Providence is preserved under directed unions. An arbitrary set has a provident closure, and the extension of a provident $M$ by a set-generic $\mathcal{G}$ is the provident closure of $M\cup\{\mathcal{G}\}$. The improvidence of many models of $\mathsf{Z}$ is shown. The final section uses similar but simpler recursions to show, in the weak system $\mathsf{MW}$, that the truth predicate for $\dot{\varDelta}_{0}$ formulæ is $\Delta_{1}$



    Upload a copy of this work     Papers currently archived: 79,724

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Successor levels of the Jensen hierarchy.Gunter Fuchs - 2009 - Mathematical Logic Quarterly 55 (1):4-20.
Unary primitive recursive functions.Daniel E. Severin - 2008 - Journal of Symbolic Logic 73 (4):1122-1138.
Degrees of difficulty of generalized r.e. separating classes.Douglas Cenzer & Peter G. Hinman - 2008 - Archive for Mathematical Logic 46 (7-8):629-647.
Characterization of recursively enumerable sets.Jesse B. Wright - 1972 - Journal of Symbolic Logic 37 (3):507-511.
Term rewriting theory for the primitive recursive functions.E. A. Cichon & Andreas Weiermann - 1997 - Annals of Pure and Applied Logic 83 (3):199-223.
Tennenbaum's Theorem and Unary Functions.Sakae Yaegasi - 2008 - Notre Dame Journal of Formal Logic 49 (2):177-183.
The provident principal.John R. McCall - 1986 - [Chapel Hill]: Institute of Government, University of North Carolina at Chapel Hill.
A note on da Costa-Doria “exotic formalizations”.L. Gordeev - 2010 - Archive for Mathematical Logic 49 (7-8):813-821.
Consumer Credit in Housing Common Accumulation Fund: Problems and Countermeasures.Bu-Ying Yuan - 1997 - Nankai University (Philosophy and Social Sciences) 4:66-72.
The dimension of the negation of transitive closure.Gregory L. McColm - 1995 - Journal of Symbolic Logic 60 (2):392-414.


Added to PP

16 (#686,609)

6 months
1 (#479,335)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Infinite Computations with Random Oracles.Merlin Carl & Philipp Schlicht - 2017 - Notre Dame Journal of Formal Logic 58 (2):249-270.

Add more citations

References found in this work

The strength of Mac Lane set theory.A. R. D. Mathias - 2001 - Annals of Pure and Applied Logic 110 (1-3):107-234.
The fine structure of the constructible hierarchy.R. Björn Jensen - 1972 - Annals of Mathematical Logic 4 (3):229.
Slim models of zermelo set theory.A. R. D. Mathias - 2001 - Journal of Symbolic Logic 66 (2):487-496.
Reconsidering ordered pairs.Dana Scott & Dominic McCarty - 2008 - Bulletin of Symbolic Logic 14 (3):379-397.
A converse of the Barwise completeness theorem.Jonathan Stavi - 1973 - Journal of Symbolic Logic 38 (4):594-612.

Add more references