On the existence of polynomial time algorithms for interpolation problems in propositional logic

Notre Dame Journal of Formal Logic 29 (4):497-509 (1988)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



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

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

Constructive interpolation in hybrid logic.Patrick Blackburn & Maarten Marx - 2003 - Journal of Symbolic Logic 68 (2):463-480.
Complexity, Decidability and Completeness.Douglas Cenzer & Jeffrey B. Remmel - 2006 - Journal of Symbolic Logic 71 (2):399 - 424.
Polynomial time operations in explicit mathematics.Thomas Strahm - 1997 - Journal of Symbolic Logic 62 (2):575-594.
PDL has interpolation.Tomasz Kowalski - 2002 - Journal of Symbolic Logic 67 (3):933-946.
The cost of a cycle is a square.A. Carbone - 2002 - Journal of Symbolic Logic 67 (1):35-60.

Analytics

Added to PP
2010-08-24

Downloads
17 (#864,542)

6 months
1 (#1,462,504)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references