scientific article
From MaRDI portal
Publication:3698791
zbMath0577.03023MaRDI QIDQ3698791
No author found.
Publication date: 1985
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
exponential lower boundsexponential difficulty of Presburger arithmeticexponential inseparabilityundecidability of Peano arithmetic
Related Items (2)
A uniform method for proving lower bounds on the computational complexity of logical theories ⋮ Is independence an exception?
This page was built for publication:
