Download PDFOpen PDF in browser

Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic

16 pagesPublished: October 23, 2018

Abstract

First-order interpolation properties are notoriously hard to determine, even for logics where propositional interpolation is more or less obvious. One of the most prominent examples is first-order G ̈odel logic. Lyndon interpolation is a strengthening of the interpolation property in the sense that propositional variables or predicate symbols are only allowed to occur positively (negatively) in the interpolant if they occur positively (negatively) on both sides of the implication. Note that Lyndon interpolation is difficult to establish for first-order logics as most proof-theoretic methods fail. In this paper we provide general derivability conditions for a first-order logic to admit Lyndon interpolation for the prenex ⊃ prenex fragment and apply the arguments to the prenex ⊃ prenex fragment of first-order Go ̈del logic.

Keyphrases: gödel logics, herbrand expansions, interpolation, lyndon interpolation, skolemization

In: Gilles Barthe, Geoff Sutcliffe and Margus Veanes (editors). LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 57, pages 95-110.

BibTeX entry
@inproceedings{LPAR-22:Lyndon_Interpolation_holds_Prenex,
  author    = {Matthias Baaz and Anela Lolic},
  title     = {Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic},
  booktitle = {LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Gilles Barthe and Geoff Sutcliffe and Margus Veanes},
  series    = {EPiC Series in Computing},
  volume    = {57},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/v6Sp},
  doi       = {10.29007/bmlf},
  pages     = {95-110},
  year      = {2018}}
Download PDFOpen PDF in browser