@inproceedings{5bfc9483852e4e129806f6e027321009,

title = "A Simpler Proof Theory for Nominal Logic",

abstract = "Nominal logic is a variant of first-order logic equipped with a “fresh-name quantifier” И and other features useful for reasoning about languages with bound names. Its original presentation was as a Hilbert axiomatic theory, but several attempts have been made to provide more convenient Gentzen-style sequent or natural deduction calculi for nominal logic. Unfortunately, the rules for И in these calculi involve complicated side-conditions, so using and proving properties of these calculi is difficult. This paper presents an improved sequent calculus NL ⇒ for nominal logic. Basic results such as cut-elimination and conservativity with respect to nominal logic are proved. Also, NL ⇒ is used to solve an open problem, namely relating nominal logic{\textquoteright}s И-quantifier and the self-dual ∇-quantifier of Miller and Tiu{\textquoteright}s FOλ∇",

author = "James Cheney",

year = "2005",

doi = "10.1007/978-3-540-31982-5_24",

language = "English",

isbn = "978-3-540-25388-4",

volume = "3441",

series = "Lecture Notes in Computer Science",

publisher = "Springer Berlin Heidelberg",

pages = "379--394",

editor = "Vladimiro Sassone",

booktitle = "Foundations of Software Science and Computational Structures",

}