Applications of cut-free infinitary derivations to generalized recursion theory

DOI10.1016/S0168-0072(97)00063-8zbMath0924.03087MaRDI QIDQ1295406

Arnold Beckmann, Wolfram Pohlers

Publication date: 15 November 1999

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

cut eliminationboundedness principleboundedness theoremdefinable well-orderingsgeneralized recursion theorycut-free infinitary derivationsrecursive ordinals

Mathematics Subject Classification ID

Descriptive set theory (03E15) Cut-elimination and normal-form theorems (03F05) Second- and higher-order arithmetic and fragments (03F35) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Hierarchies of computability and definability (03D55)

Related Items

On the Performance of Axiom Systems, AN INCOMPLETENESS THEOREM VIA ORDINAL ANALYSIS, From Subsystems of Analysis to Subsystems of Set Theory, Ordinal analysis of non-monotone \(\Pi_1^0\)-definable inductive definitions, Iterated Inductive Definitions Revisited, Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results

Cites Work

• Unnamed Item
• Unnamed Item
• Descriptive set theory