Author:
Schöning Uwe,Pruim Randall
Publisher
Springer Berlin Heidelberg
Reference7 articles.
1. M. Garey, D. Johnson: Computers and Intractability - A Guide to the Theory of NP-Completeness, Freeman, 1979.
2. W. Craig: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory, Journal of Symbolic Logic 44 (1957) 36–50.
3. E. Dahlhaus, A. Israeli, J.A. Makowsky: On the existence of polynomial time algorithms for interpolation problems in propositional logic, Notre Dame Journal on Formal Logic 29 (1988), 497–509.
4. Y. Gurevich: Toward logic tailored for computational complexity, in M.M. Richter et al, Computation and Proof Theory, Lecture Notes in Mathematics 1104, Springer, 1984, 175-216.
5. D. Mundici: Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity, Annals of Pure and Applied Logic 27 (1984), 265–273.