Skip Navigation

Journal of Logic and Computation 2001 11(5):737-754; doi:10.1093/logcom/11.5.737
© 2001 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 (3)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Goranko, V.
Right arrow Articles by Vakarelov, D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Sahlqvist Formulas in Hybrid Polyadic Modal Logics

Valentin Goranko1 and Dimiter Vakarelov2

1 Department of Mathematics, Rand Afrikaans University, PO Box 524, Auckland Park 2006, Johannesburg, South Africa. E-mail: vfg@na.rau.ac.za 2 Faculty of Mathematics and Computer Science, Sofia University, blvd. James Bouchier 5, 1126 Sofia, Bulgaria. E-mail: dvak@fmi.uni-sofia.bg

Building on a new approach to polyadic modal languages and Sahlqvist formulas we define Sahlqvist formulas in hybrid polyadic modal languages containing nominals and universal modality or satisfaction operators. Particularly interesting is the case of reversive polyadic languages, closed under all ‘inverses’ of polyadic modalities because the minimal valuations arising in the computation of the first-order equivalents of polyadic Sahlqvist formulae are definable in such languages and that makes the proof of first-order definability and canonicity of these formulas a simple syntactic exercise. Furthermore, the first-order definability of Sahlqvist formulas immediately transfers to arbitrary polyadic languages, while the direct transfer of canonicity requires a more involved proof-theoretic analysis.

Keywords: Hybrid polyadic modal logics; Sahlqvist formulas; nominals; universal modality; satisfaction operator; first-; order definability; canonicity; completeness


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
W. Conradie, V. Goranko, and D. Vakarelov
Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA
J Logic Computation, October 1, 2006; 16(5): 579 - 612.
[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.