Notes on local reflection principles.pdfVIP

Notes on local re ection principlesLev BeklemishevSteklov Mathematical InstituteVavilova 42, Moscow 117966, RUSSIAe-mail: lev@bekl.mian.suApril 27, 1995AbstractWe study the hierarchy of re ection principles obtained by restrictingthe full local re ection schema to the classes of the arithmetical hierarchy.Optimal conservation results w.r.t. the arithmetical complexity for suchprinciples are obtained.Re ection principles, for an arithmetical theory T , are formal schemata ex-pressing the soundness of T , that is, the statement that \every sentence provablein T is true. More precisely, if ProvT (x) denotes the canonical 01 provabilitypredicate for T , then the local re ection principle for T is the schemaProvT (pAq)! A; A is a sentence;and uniform re ection principle is the schema8x (ProvT (pA( _x)q)! A(x)); A(x) is a formula:We denote local and uniform re ection principles respectively RfnT and RFNT .Other natural forms of re ection turn out to be equivalent to one of these two(cf also [8]). Partial re ection principles are obtained from local and uniformschemata by imposing a restriction that the formula A may only range over acertain subclass of the class of T -sentences (formulas). Such schemata will bedenoted RfnT () and RFNT (), respectively, and for one usually takes one ofthe classes 0n or 0n of the arithmetical hierarchy. B(0n) denotes the class of allboolean combinations of 0n sentences.In this note we consider some basic questions concerning the hierarchy ofpartial local re ection principles: the collapse of this hierarchy, nite axiomatiz-ability of the theories of the hierarchy, etc. We also obtain optimal conservationresults for partial local re ection principles. The corresponding questions for uni-form re ection principles are well-known and easy, but are resolved in a rather1 p pp Rfn p u u Rfn(B(03)) Rfn(B(02))Rfn(03)Rfn(03) Rfn(02)Rfn(02) uu u uu uu Rfn(01)  Rfn(B(01))Rfn(01)  Conu u uu uu p ppRFN RFN(01)  Con RFN(01)  RFN(