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)

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/bf02023010

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,286

External links

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

Through your library

My notes

Similar books and articles

Interpolation.Misha Gavrilovich - 1997 - Logic Journal of the IGPL 5 (3):11-16.
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.
Tautologies with a unique craig interpolant, uniform vs. nonuniform complexity.Daniele Mundici - 1984 - Annals of Pure and Applied Logic 27 (3):265-273.
List of participants 17 Robert K. Meyer (Camberra, Australia) Barbara Morawska (Gdansk, Poland) Daniele Mundici (Milan, Italy).Kazumi Nakamatsu, Marek Nasieniewski, Volodymyr Navrotskiy, Sergey Pavlovich Odintsov, Carlos Oiler, Mieczyslaw Omyla, Hiroakira Ono, Ewa Orlowska, Katarzyna Palasihska & Francesco Paoli - 2001 - Logic and Logical Philosophy 7:16.
Proof complexity of propositional default logic.Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas & Heribert Vollmer - 2011 - Archive for Mathematical Logic 50 (7-8):727-742.
Uniform Lyndon interpolation property in propositional modal logics.Taishi Kurahashi - 2020 - Archive for Mathematical Logic 59 (5):659-678.
Uniform interpolation and sequent calculi in modal logic.Rosalie Iemhoff - 2019 - Archive for Mathematical Logic 58 (1-2):155-181.
A Lower Complexity Bound for Propositional Dynamic Logic with Intersection.M. Lange - 1998 - In Marcus Kracht, Maarten de Rijke, Heinrich Wansing & Michael Zakharyaschev, 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, Advances in Modal Logic. CSLI Publications. pp. 133-147.
An upper bound for reduction sequences in the typed λ-calculus.Helmut Schwichtenberg - 1991 - Archive for Mathematical Logic 30 (5-6):405-408.

Analytics

Added to PP
2020-12-03

Downloads
12 (#1,500,759)

6 months
4 (#1,134,802)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.

Add more citations

References found in this work

No references found.

Add more references