Strict \({\varPi^1_1}\)-reflection in bounded arithmetic (Q2655140): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00153-009-0157-z / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2060030023 / rank | |||
Normal rank |
Revision as of 02:36, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Strict \({\varPi^1_1}\)-reflection in bounded arithmetic |
scientific article |
Statements
Strict \({\varPi^1_1}\)-reflection in bounded arithmetic (English)
0 references
22 January 2010
0 references
From the introduction [p.~19]: ``In the present paper we show [by model-theoretic means] that a generalization of Cantini's strict \(\Pi_1^1\)-reflection is \(\Pi_2^0\)-conservative over [Ferreira's] \(F\). [\dots] In the second part we describe a generalization of the bounded collection scheme and show that the generalization we propose is \(\Pi_1^1\)-conservative over this new scheme of bounded collection, which enlarges the scope of the ordinary bounded collection scheme to formulas mentioning bounded sets and binary sequences, and not just binary sequences.''
0 references
feasible arithmetic
0 references
feasible analysis
0 references