Rudimentary Recursion, Gentle Functions and Provident Sets

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

Abstract

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}$

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,452

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

Variations on determinacy and ℵω1.Ramez L. Sami - 2022 - Journal of Symbolic Logic 87 (2):721-731.
Does Imply, Uniformly?Alessandro Andretta & Lorenzo Notaro - forthcoming - Journal of Symbolic Logic:1-25.
Wellfoundedness proof with the maximal distinguished set.Toshiyasu Arai - 2023 - Archive for Mathematical Logic 62 (3):333-357.
Around splitting and reaping for partitions of ω.Hiroaki Minami - 2010 - Archive for Mathematical Logic 49 (4):501-518.
Degrees of difficulty of generalized r.e. separating classes.Douglas Cenzer & Peter G. Hinman - 2008 - Archive for Mathematical Logic 46 (7-8):629-647.
Destructibility and axiomatizability of Kaufmann models.Corey Bacal Switzer - 2022 - Archive for Mathematical Logic 61 (7):1091-1111.
Tennenbaum's Theorem and Unary Functions.Sakae Yaegasi - 2008 - Notre Dame Journal of Formal Logic 49 (2):177-183.
Addition and multiplication of sets.Laurence Kirby - 2007 - Mathematical Logic Quarterly 53 (1):52-65.
A Nonstandard Counterpart of WWKL.Stephen G. Simpson & Keita Yokoyama - 2011 - Notre Dame Journal of Formal Logic 52 (3):229-243.
Canjar Filters.Osvaldo Guzmán, Michael Hrušák & Arturo Martínez-Celis - 2017 - Notre Dame Journal of Formal Logic 58 (1):79-95.

Analytics

Added to PP
2015-03-25

Downloads
27 (#588,527)

6 months
10 (#396,727)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Constructing the constructible universe constructively.Michael Rathjen - 2024 - Annals of Pure and Applied Logic 175 (3):103392.
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