A Gödel Theorem on Network Complexity Lower Bounds
From MaRDI portal
Publication:3708019
DOI10.1002/malq.19860321912zbMath0583.03045OpenAlexW1978889713MaRDI QIDQ3708019
Publication date: 1986
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19860321912
Complexity of computation (including implicit computational complexity) (03D15) Complexity of proofs (03F20)
Related Items
The multiplicative complexity of quadratic boolean forms ⋮ New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems