Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Egon Börger, Decision problems in predicate logic, in: Logic Colloquium 82, Elsevier (North Holland) 1984, 263–301.
2. Egon Börger, Berechenbarkeit, Komplexität, Logik, Vieweg-Verlag, Wiesbaden 1985.
3. Kevin Compton and C. Ward Henson, A uniform method for proving lower bounds on the computational complexity of logical theories, to appear in Annals of Pure and Applied Logic.
4. Burton Dreben and Warren Goldfarb, The decision problem, Addison-Wesley, Reading (MA) 1979.
5. Warren Goldfarb, The unsolvability of the Gödel class with identity, J. Symbolic Logic 49 (1984), 1237–1252.