scientific article
From MaRDI portal
Publication:3949037
zbMath0488.03021MaRDI QIDQ3949037
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
upper bounddivisibilityspace complexitydecision proceduredeterministic Turing machinetheory of natural numbers
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Complexity of proofs (03F20)
Related Items (4)
On the complexity of decision using destinies in \(H\)-bounded structures ⋮ Complexity of logical theories involving coprimality ⋮ A list of arithmetical structures complete with respect to the first-order definability ⋮ Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories
This page was built for publication:
