We define a class of functions, the descent recursive functions, relative to an arbitrary elementary recursive system of ordinal notations. By means of these functions, we provide a general technique for measuring the proof-theoretic strength of a variety of systems of first-order arithmetic. We characterize the provable well-orderings and provably recursive functions of these systems, and derive various conservation and equiconsistency results.

A subtheory of the theory of self-referential truth known as FS is shown to be weak as a theory of truth but equivalent to full FS in its proof-theoretic strength.

In a modal system of arithmetic, a theory S has the modal disjunction property if whenever $S \vdash \square\varphi \vee \square\psi$ , either $S \vdash \square\varphi$ or $S \vdash \square\psi. S$ has the modal numerical existence property if whenever $S \vdash \exists x\square\varphi(x)$ , there is some natural number n such that $S \vdash \square\varphi(\mathbf{n})$ . Under certain broadly applicable assumptions, these two properties are equivalent.

Probably the two most famous examples of elementary embeddings between inner models of set theory are the embeddings of the universe into an inner model given by a measurable cardinal and the embeddings of the constructible universeLinto itself given by 0#. In both of these examples, the “target model” is a subclass of the “ground model”. It is not hard to find examples of embeddings in which the target model is not a subclass of the ground model: ifis a generic (...) ultrafilter arising from forcing with a precipitous ideal on a successor cardinalκ, then the ultraproduct of the ground model viacollapsesκ. Such considerations suggest a classification of how close the target model comes to “fitting inside” the ground model.Definition 1.1. LetMandNbe inner models of ZFC, and letj:M→Nbe an elementary embedding. Theco-critical pointofjis the least ordinalλ, if any exist, such that there isX⊆λ, X∈NbutX∉M. Such anXis called anew subsetofλ.It is easy to see that the co-critical point ofj:M→Nis a cardinal inN. (shrink)

In a language for arithmetic with a predicate T, intended to mean “ x is the Gödel number of a true sentence”, a set S of axioms and rules of inference has the truth disjunction property if whenever S ⊢ T ∨ T, either S ⊢ T or S ⊢ T. Similarly, S has the truth existence property if whenever S ⊢ ∃χ T ), there is some n such that S ⊢ T ). Continuing previous work, we establish whether (...) these properties hold or fail for a large collection of possible axiomatic systems. (shrink)