scientific article
From MaRDI portal
Publication:3684112
zbMath0568.03019MaRDI QIDQ3684112
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
circuit depthproof lengthcomplexity of the decision problemnondeterministic Turing timesentential interpolantstautologies with one interpolant
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Structure of proofs (03F07) Interpolation, preservation, definability (03C40) Complexity of proofs (03F20) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
This page was built for publication:
