메뉴 건너뛰기




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;

EID: 0035484686     PISSN: 0955792X     EISSN: None     Source Type: Journal    
DOI: 10.1093/logcom/11.5.737     Document Type: Article
Times cited : (33)

References (14)


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.