Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T11:23:43.330Z Has data issue: false hasContentIssue false

The proof-theoretic analysis of transfinitely iterated quasi least fixed points

Published online by Cambridge University Press:  12 March 2014

Dieter Probst*
Affiliation:
Universität Bern, Institut Für Informatik Und Angewandte Mathematik Neubrückstrasse 10, CH-3012 Bern, Switzerland.E-mail:probst@iam.unibe.ch

Abstract

The starting point of this article is an old question asked by Feferman in his paper on Hancock's conjecture [6] about the strength of . This theory is obtained from the well-known theory ID1 by restricting fixed point induction to formulas that contain fixed point constants only positively. The techniques used to perform the proof-theoretic analysis of also permit to analyze its transfinitely iterated variants . Thus, we eventually know that

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2006

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable