Nonaxiomatizability of predicate logics of proofs (Q1406443)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1974899
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Nonaxiomatizability of predicate logics of proofs |
scientific article; zbMATH DE number 1974899 |
Statements
Nonaxiomatizability of predicate logics of proofs (English)
0 references
4 September 2003
0 references
The present paper deals with the problem of the possibility of the effective description of the predicate logics of proofs. The author shows that the predicate logics of proofs possess also a lower bound for complexity, namely the true predicate logic of proofs is \(\Pi_1^0(\text{TA})\)-complete, where TA is the set of true arithmetic propositions. Also, the logic of proofs restricted by the tools of formal arithmetics PA is \(\Pi_2^0\)-hard.
0 references
predicate logic of proofs
0 references
nonaxiomatizability
0 references
