Skip Navigation

Journal of Logic and Computation 2002 12(6):993-1016; doi:10.1093/logcom/12.6.993
© 2002 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Demri, S.
Right arrow Articles by Goré, R.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Article

Display Calculi for Nominal Tense Logics

Stéphane Demri1 and Rajeev Goré2

1 Lab. Spécification et Vérification, CNRS, UMR 8643, ENS de Cachan, 61, av. du Pdt Wilson, 94235 Cachan Cedex, France. E-mail: demri{at}lsv.ens-cachan.fr 2 Automated Reasoning Group and Department of Computer Science, Australian National University, Canberra ACT 0200, Australia. E-mail: rpg{at}arp.anu.edu.au

We define display calculi for nominal tense logics extending the minimal nominal tense logic (MNTL) by addition of primitive axioms. To do so, we use the natural translation ofMNTL into the minimal tense logic of inequality (L!=) which is known to be properly displayable by application of Kracht's results. The rules of the display calculus {delta}MNTL for MNTL mimic those of the display calculus {delta}L!= for L!=. We show that every MNTL-valid formula admits a cut-free derivation in {delta}MNTL. We also show that a restricted display calculus {delta}–MNTL, is not only complete for MNTL, but that it enjoys cut-elimination for arbitrary sequents. Finally, we give a weak Sahlqvist-type theorem for two semantically defined extensions of MNTL. Using Kracht's techniques we obtain sound and complete display calculi for these two extensions based upon {delta}MNTL and {delta}–MNTL respectively. The display calculi based upon {delta}MNTL enjoy cut-elimination for valid formulae only, but those based upon {delta}–MNTL enjoy cut-elimination for arbitrary sequents.

Keywords: Nominal tense logics; display logic; cut elimination theorem; strong normalisation; Sahlqvist tense formulae

Received 10 April 2000.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 J Logic ComputationHome page
R. Gore and A. Tiu
Classical Modal Display Logic in the Calculus of Structures and Minimal Cut-free Deep Inference Calculi for S5
J Logic Computation, August 6, 2007; (2007) exm026v1.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.