scientific article
From MaRDI portal
Publication:3880807
zbMath0439.03004MaRDI QIDQ3880807
Klaus Fleischmann, Dirk Siefkes, Bernd Mahr
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
THE RECOGNITION COMPLEXITY OF DECIDABLE THEORIES ⋮ Complexity of Boolean algebras ⋮ On time-space classes and their relation to the theory of real addition ⋮ The complexity of Presburger arithmetic with bounded quantifier alternation depth ⋮ A uniform method for proving lower bounds on the computational complexity of logical theories ⋮ Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories
