Recursion theory on weak fragments of Peano arithmetic: A study of definable cuts (Q2784778)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Recursion theory on weak fragments of Peano arithmetic: A study of definable cuts |
scientific article; zbMATH DE number 1732996
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recursion theory on weak fragments of Peano arithmetic: A study of definable cuts |
scientific article; zbMATH DE number 1732996 |
Statements
18 July 2002
0 references
survey
0 references
recursion theory on weak fragments of Peano arithmetic
0 references
Recursion theory on weak fragments of Peano arithmetic: A study of definable cuts (English)
0 references
The paper gives a survey of recursion theory on weak fragments of Peano arithmetic PA. In particular the recursion theory under the hypothesis of \(B \Sigma_{1}\) is considered and results which are provably equivalent to \(I \Sigma_{1}\) over this basis theory are discussed. Further the recursion theory under \(B \Sigma_{2}\) is studied. The paper contains also some open problems.NEWLINENEWLINEFor the entire collection see [Zbl 0970.00012].
0 references
