Publication:3852167

zbMath0419.03023MaRDI QIDQ3852167

Richard J. Lipton

Publication date: 1979

zbMATH Keywords

consistency; fragments of formal arithmetic; polynomial time computable predicate

Mathematics Subject Classification ID

03D15: Complexity of computation (including implicit computational complexity)

03B20: Subsystems of classical logic (including intuitionistic logic)

03D10: Turing machines and related notions

Related Items

Complex Boolean networks obtained by diagonalization, Ein Modell des P=NP-Problems mit einer positiven Lösung