2000 character limit reached
Proof-theoretic strengths of weak theories for positive inductive definitions
Published 4 Mar 2016 in math.LO | (1603.01342v7)
Abstract: In this paper the lightface $\Pi{1}_{1}$-Comprehension axiom is shown to be proof-theoretically strong even over $\mbox{RCA}{0}{*}$, and we calibrate the proof-theoretic ordinals of weak fragments of the theory $\mbox{ID}{1}$ of positive inductive definitions over natural numbers. Conjunctions of negative and positive formulas in the transfinite induction axiom of $\mbox{ID}{1}$ are shown to be weak, and disjunctions are strong. Thus we draw a boundary line between predicatively reducible and impredicative fragments of $\mbox{ID}{1}$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.