Logic in Computer Science (LICS 2004)

Paper: A Sequent Calculus for Nominal Logic (at LICS 2004)

Authors: Murdoch Gabbay James Cheney

Abstract

Nominal logic is a theory of names and binding based on the primitive concepts of freshness and swapping, with a self-dual И- (or "new")-quantifier, originally presented as a Hilbert-style axiom system extending first-order logic. We present a sequent calculus for nominal logic called Fresh Logic, or FL, admitting cut-elimination. We use FL to provide a proof-theoretic foundation for nominal logic programming and show how to interpret FOλ∇, another logic with a self-dual quantifier, within FL.

BibTeX

  @InProceedings{GabbayCheney-ASequentCalculusfor,
    author = 	 {Murdoch Gabbay and James Cheney},
    title = 	 {A Sequent Calculus for Nominal Logic},
    booktitle =  {Proceedings of the Nineteenth Annual IEEE Symp. on Logic in Computer Science, {LICS} 2004},
    year =	 2004,
    editor =	 {Harald Ganzinger},
    month =	 {July}, 
    pages =      {139--148},
    location =   {Turku, Finland}, 
    publisher =	 {IEEE Computer Society Press}
  }