Interpolation in Fragments of Intuitionistic Propositional Logic

    Research output: Contribution to journalArticleAcademic

    266 Downloads (Pure)

    Abstract

    We show in this paper that all fragments of intuitionistic propositional logic based on a subset of the connective ∧, ∨, →, ¬ satisfy interpolation. Fragments containing ↔ or ¬¬ are briefly considered.
    Original languageEnglish
    Pages (from-to)1419-1430
    Number of pages12
    JournalJournal of Symbolic Logic
    Volume54
    Publication statusPublished - 1989

    Fingerprint

    Dive into the research topics of 'Interpolation in Fragments of Intuitionistic Propositional Logic'. Together they form a unique fingerprint.

    Cite this