Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic. (Q3984439)
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: Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic. |
scientific article; zbMATH DE number 26216
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic. |
scientific article; zbMATH DE number 26216 |
Statements
Some properties of the syntactic p-recursion categories generated by consistent, recursively enumerable extensions of Peano arithmetic. (English)
0 references
27 June 1992
0 references
dominical categories
0 references
generalized first Gödel incompleteness theorem
0 references
\(p\)-recursion categories
0 references
recursively enumerable extensions of Peano arithmetic
0 references
formal provability
0 references
