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)

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 104,583

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

Tableaux and Interpolation for Propositional Justification Logics.Meghdad Ghari - 2024 - Notre Dame Journal of Formal Logic 65 (1):81-112.
Weak Kleene and Other Weak Logics of Conditionals.Jeremiah Joven Joaquin - 2023 - Notre Dame Journal of Formal Logic 64 (3):281-290.
Some failures of interpolation in modal logic.George F. Schumm - 1986 - Notre Dame Journal of Formal Logic 27 (1):108-110.
The Craig interpolation lemma.Burton Dreben & Hilary Putnam - 1967 - Notre Dame Journal of Formal Logic 8 (3):229-233.
A unified approach to relative interpolation.Dennis Duchhart - 1988 - Notre Dame Journal of Formal Logic 29 (3):412-419.
Combinatory and propositional logic.David Meredith - 1974 - Notre Dame Journal of Formal Logic 15 (1):156-160.
Logic in Russell's Principles of Mathematics.Gregory Landini - 1996 - Notre Dame Journal of Formal Logic 37 (4):554-584.

Analytics

Added to PP
2010-08-24

Downloads
24 (#997,802)

6 months
5 (#855,288)

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