Propositional proof systems, the consistency of first order theories and the complexity of computations (Q3472096): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q106785096, #quickstatements; #temporary_batch_1704767531357 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:20, 4 February 2024
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
