- Abstract:
-
Nominal logic is a variant of first-order logic equipped with a freshname quantifier $\new$ 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 $\new$ in these calculi involve complicated side-conditions, so using and proving properties of these calculi is difficult. This paper presents an improved sequent calculus $\NLseq$ for nominal logic. Basic results such as cut-elimination and conservativity with respect to nominal logic are proved. Also, $\NLseq$ is used to solve an open problem, namely relating nominal logics N-quantifier and the self-dual $\nabla$- quantifier of Miller and Tius $FO\lambda\nabla$.
- Links To Paper
- Springer official version
- Bibtex format
- @InProceedings{EDI-INF-RR-0319,
- author = {
James Cheney
},
- title = {A Simpler Proof Theory for Nominal Logic},
- book title = {Proc. FOSSACS 2005},
- year = 2005,
- month = {Apr},
- url = {http://springerlink.metapress.com/app/home/contribution.asp?wasp=ec26a698eaf14f24bcf39db01de0e2f6&referrer=parent&backto=issue,24,32;journal,160,2140;linkingpublicationresults,1:105633,1},
- }
|
