Propositional proof systems, the consistency of first order theories and the complexity of computations (Q3472096): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.2307/2274765 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2171353564 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The relative efficiency of propositional proof systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the scheme of induction for bounded arithmetic formulas / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The intractability of resolution / rank | |||
Normal rank | |||
Latest revision as of 13:52, 20 June 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
