A lower bound for the complexity of Craig's interpolants in sentential logic

Archive for Mathematical Logic 23 (1):27-36 (1983)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,322

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Interpolation.Misha Gavrilovich - 1997 - Logic Journal of the IGPL 5 (3):11-16.
Interpolation by a Game.Jan Kraíček - 1998 - Mathematical Logic Quarterly 44 (4):450-458.
A Lower Complexity Bound for Propositional Dynamic Logic with Intersection.M. Lange - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 133-147.
A Lower Complexity Bound for Propositional Dynamic Logic with Intersection.M. Lange - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev (eds.), Advances in Modal Logic. CSLI Publications. pp. 133-147.
Upper and lower Ramsey bounds in bounded arithmetic.Kerry Ojakian - 2005 - Annals of Pure and Applied Logic 135 (1-3):135-150.

Analytics

Added to PP
2020-12-03

Downloads
3 (#1,676,500)

6 months
3 (#1,002,198)

Historical graph of downloads
How can I increase my downloads?

References found in this work

No references found.

Add more references