Classifying the provably total set functions of KP and KP(P)
Jacob Cook, Michael Rathjen

TL;DR
This paper classifies the provably total set functions of KP and KP(P) set theories using relativised hierarchy techniques, establishing conservativity results and characterising functions up to the Bachmann-Howard ordinal.
Contribution
It provides a novel hierarchy-based characterisation of provably total set functions in KP and KP(P), extending ordinal analysis techniques to these theories.
Findings
Provably total functions of KP are characterised by a hierarchy up to the Bachmann-Howard ordinal.
KP(P) proves totality of functions within a hierarchy based on the relativised von Neumann hierarchy.
Conservativity results are established for KP variants with choice and other axioms.
Abstract
This article is concerned with classifying the provably total set-functions of Kripke-Platek set theory, KP, and Power Kripke-Platek set theory, KP(P), as well as proving several (partial) conservativity results. The main technical tool used in this paper is a relativisation technique where ordinal analysis is carried out relative to an arbitrary but fixed set x. A classic result from ordinal analysis is the characterisation of the provably recursive functions of Peano Arithmetic, PA, by means of the fast growing hierarchy [10]. Whilst it is possible to formulate the natural numbers within KP, the theory speaks primarily about sets. For this reason it is desirable to obtain a characterisation of its provably total set functions. We will show that KP proves the totality of a set function precisely when it falls within a hierarchy of set functions based upon a relativised constructible…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topology and Set Theory · Computability, Logic, AI Algorithms · Logic, Reasoning, and Knowledge
