|
Volumn 11, Issue 5, 2001, Pages 737-754
|
Sahlqvist formulas in hybrid polyadic modal logics
|
Author keywords
Canonicity; Completeness; First order definability; Hybrid polyadic modal logics; Nominals; Sahlqvist formulas; Satisfaction operator; Universal modality
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
FORMAL LANGUAGES;
MATHEMATICAL MODELS;
MATHEMATICAL OPERATORS;
MATHEMATICAL TRANSFORMATIONS;
SEMANTICS;
THEOREM PROVING;
CANONICITY;
COMPLETENESS;
FIRST ORDER DEFINABILITY;
HYBRID POYADIC MODAL LOGICS;
NOMINALS;
SAHLQVIST FORMULAS;
SATISFACTION OPERATOR;
UNIVERSAL MODALITY;
FORMAL LOGIC;
|
EID: 0035484686
PISSN: 0955792X
EISSN: None
Source Type: Journal
DOI: 10.1093/logcom/11.5.737 Document Type: Article |
Times cited : (33)
|
References (14)
|