loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th Annual IEEE Symposium on Logic in Computer Science (LICS'04)
A Sequent Calculus for Nominal Logic
Turku, Finland
July 13-July 17
ISBN: 0-7695-2192-4
ASCII Text
x 
 
Murdoch Gabbay, James Cheney, "A Sequent Calculus for Nominal Logic," Logic in Computer Science, Symposium on, pp. 139-148, 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/LICS.2004.1319608,
author = {Murdoch Gabbay and James Cheney},
title = {A Sequent Calculus for Nominal Logic},
journal ={Logic in Computer Science, Symposium on},
volume = {0},
year = {2004},
issn = {1043-6871},
pages = {139-148},
doi = {http://doi.ieeecomputersociety.org/10.1109/LICS.2004.1319608},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Logic in Computer Science, Symposium on
TI - A Sequent Calculus for Nominal Logic
SN - 1043-6871
SP139
EP148
A1 - Murdoch Gabbay,
A1 - James Cheney,
PY - 2004
KW - null
VL - 0
JA - Logic in Computer Science, Symposium on
ER -
 
Murdoch Gabbay, LIX ?cole Polytechnique
James Cheney, Cornell University
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.
Citation:
Murdoch Gabbay, James Cheney, "A Sequent Calculus for Nominal Logic," lics, pp.139-148, 19th Annual IEEE Symposium on Logic in Computer Science (LICS'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.