See this document in CiteSeerX!

Sahlqvist Formulas in Hybrid Polyadic Modal Logics (2000)  (Make Corrections)  
Valentin Goranko, Dimiter Vakarelov



  Home/Search   Context   Related

 
View or download:
general.rau.ac.za/maths/goran...sfh4.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  general.rau.ac.za/maths/go...publ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Building on a new approach to polyadic modal languages and Sahlqvist formulas introduced in [8] we de ne 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... (Update)

Similar documents (at the sentence level):
6.7%:   Sahlqvist Formulas Unleashed in Polyadic Modal Languages - Goranko, Vakarelov (2000)   (Correct)

Active bibliography (related documents):   More   All
1.4:   Sahlqvist Formulas in Hybrid Polyadic Modal Logics - Goranko, Vakarelov   (Correct)
0.3:   Optimizations of Rough Set Model - Stepaniuk (1998)   (Correct)
0.3:   Modal Definability in Languages with a Finite Number of.. - Vakarelov (2003)   (Correct)

Similar documents based on text:   More   All
0.7:   Simulating Polyadic Modal Logics by Monadic Ones - Goguadze, Piazza, Venema (2001)   (Correct)
0.7:   Hyperboolean Algebras and Hyperboolean Modal Logic - Goranko, Vakarelov   (Correct)
0.6:   On Calculi For Mobility And Trust - Carbone (2002)   (Correct)

BibTeX entry:   (Update)

@misc{ goranko-sahlqvist,
  author = "Valentin Goranko and Dimiter Vakarelov",
  title = "Sahlqvist Formulas in Hybrid Polyadic Modal Logics",
  url = "citeseer.ist.psu.edu/article/goranko00sahlqvist.html" }
Citations (may not include all citations):
62   An Essay in Combinatory Dynamic Logic (context) - Passy, Tinchev - 1991
61   Using the Universal Modality: Gains and Questions (context) - Goranko, Passy - 1992
52   Modal Logic with Names (context) - Gargov, Goranko - 1993
32   What are Hybrid Languages - Blackburn, Seligman - 1998
19   Derivation rules as anti-axioms in modal logic (context) - Venema - 1993
13   Hybrid Completeness - Blackburn, Tzakova - 1998
13   Sahlqvist's Theorem For Boolean Algebras with Operators with.. (context) - de Rijke, Venema - 1995
13   How completeness and correspondence theory got married (context) - Kracht - 1993
11   Internalizing Labeled Deduction (context) - Blackburn - 2000
7   Cambridge Univ (context) - Blackburn, de Rijke et al. - 2001
6   ILLC Dissertation Series (context) - de Rijke, Extending - 1993
4   Sahlqvist formulas Unleashed in Polyadic Modal Languages - Goranko, Vakarelov - 2000
3   Rough Polyadic Modal Logics (context) - Vakarelov - 1991
2   Sahlqvist formulas are not so elementary even above S (context) - Chagrov, Zakharyaschev - 1995

Documents on the same site (http://general.rau.ac.za/maths/goranko/publ.htm):   More
Hyperboolean Algebras and Hyperboolean Modal Logic - Goranko, Vakarelov   (Correct)
The Modal Logic of the Countable Random Frame - Goranko, Kapron (2000)   (Correct)
The Basic Algebra of Game Equivalences - Goranko (2000)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC