Publication date
July 1995
DOI Publisher
Published by Elsevier B.V. ISSN
0168-0072 Citation count (estimate)
26Abstract
AbstractIn this paper we study applicative theories of operations and numbers with (and without) the non-constructive minimum operator in the context of a total application operation. We determine the proof-theoretic strength of such theories by relating them to well-known systems like Peano Arithmetic PA and the system (Π∞0-CA)<ε0 of second order arithmetic. Essential use will be made of so-called fixed-point theories with ordinals, certain infinitary term models and Church-Rosser properties
Add to ORKG