The predicative Frege hierarchy (Q2271986): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Proof-theoretic analysis by iterated reflection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5694788 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the interpretability of arithmetic in set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetization of metamathematics in a general setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Burgess’<i>PV</i>is Robinson’s<i>Q</i> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the untenability of Nelson's predicativism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal predicative set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lattice of chapters of mathematics (interpretations between theorems [theories]) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4726219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts, consistency statements and interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694229 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The formalization of interpretability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inside view of EXP; or, The closed fragment of the provability logic of I<i>Δ</i><sub>0</sub> + <i>Ω</i><sub>1</sub> with a prepositional constant for EXP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5393646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5810546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the scheme of induction for bounded arithmetic formulas / rank
 
Normal rank

Latest revision as of 21:12, 1 July 2024

scientific article
Language Label Description Also known as
English
The predicative Frege hierarchy
scientific article

    Statements

    The predicative Frege hierarchy (English)
    0 references
    0 references
    5 August 2009
    0 references
    The paper is devoted to the characterization of the strength of the predicative Frege hierarchy P\(^{n+1}\)V, introduced by \textit{J. P. Burgess} in [Fixing Frege. Princeton, NJ: Princeton University Press (2005; Zbl 1089.03001)]. It is shown that P\(^{n+1}\)V and \(\text{Q} + \text{con}^{n}\)(Q) are mutually interpretable. This gives also an alternative proof of \textit{M. Ganea}'s result in [J. Symb. Log. 72, No.~2, 619--624 (2007; Zbl 1118.03050)] that PV (= P\(^{1}\)V) is mutually interpretable with Q. The main result implies also that the whole hierarchy taken together, P\(^{\omega}\)V, is not finitely axiomatizable; even more: no theory that is mutually locally interpretable with P\(^{\omega}\)V is finitely axiomatizable.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    predicative comprehension
    0 references
    Frege
    0 references
    interpretability
    0 references
    0 references