Skip Navigation



Journal of Logic and Computation Advance Access published online on May 5, 2008

Journal of Logic and Computation, doi:10.1093/logcom/exn016
This Article
Right arrow Full Text (PDF)
Right arrow References
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 Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Sherkhonov, E. Yu.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author, 2008. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Original Papers

Modal Operators over Constructive Logic

Evgeny Yu. Sherkhonov

Novosibirsk State University, Novosibirsk, Russia.

E-mail: e.sherkhonov{at}gmail.com


   Abstract

The article deals with modal extensions of Nelson's constructive logic with strong negation N4. Different logics are constructed with respect to the notions of semantical and formal dualities introduced in Odintsov and Wansing (2004, First-Order Logic Revisited, 269–286) and to a new notion of negative semantical duality. Soundness and completeness are proved for each logic. It is also shown that all the logics are conservative extensions of N4, and they possess the disjunction property and the constructible falsity property.

Keywords: Constructive modal logic; strong negation; Kripke semantics


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




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.