Propositional proof systems, the consistency of first order theories and the complexity of computations (Q3472096)
From MaRDI portal
!
WARNING
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 4139736
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Propositional proof systems, the consistency of first order theories and the complexity of computations |
scientific article; zbMATH DE number 4139736 |
Statements
Propositional proof systems, the consistency of first order theories and the complexity of computations (English)
0 references
1989
0 references
finitely axiomatized fragment of true arithmetic
0 references
finitely axiomatized theory
0 references
Turing machine
0 references
0.8301917314529419
0 references
0.8036717772483826
0 references
