This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Gabbay, D.M. & U. Reyle: N-Prolog. Part 1. Journal of Logic Programming 2 (1984) 319–355
Statman, R.: Intuitionistic logic is polynomial-space complete. Theoretical Computer Science 9 (1979), 67–72
Stockmeyer, L.J.: The polynomial time hierarchy. Theoretical Computer Science 3 (1976) 1–22
Babaev, A.A. & S.V. Soloviev: Coherence theorem for canonical morphisms in cartesian closed categories. Journal of Soviet Mathematics 20 (1982) 2263–2282
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag
About this paper
Cite this paper
Hudelmaier, J. (1996). On the computational complexity of propositional logic programs with nested implications. In: Dyckhoff, R., Herre, H., Schroeder-Heister, P. (eds) Extensions of Logic Programming. ELP 1996. Lecture Notes in Computer Science, vol 1050. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60983-0_10
Download citation
DOI: https://doi.org/10.1007/3-540-60983-0_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60983-4
Online ISBN: 978-3-540-49751-6
eBook Packages: Springer Book Archive