Propositional proof systems, the consistency of first order theories and the complexity of computations (Q3472096)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Propositional proof systems, the consistency of first order theories and the complexity of computations |
scientific article |
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
