|
【答案】应助回帖
★ ★ ★ ★ ★ ★ ★ ★ ★ ★ 感谢参与,应助指数 +1 shumolynu: 金币+10, ★★★★★最佳答案, 非常谢谢 2012-09-17 22:34:03
把你查了,确定检索了
1. Accession number:
20122615179687
Title: Covering semantics of modal logic S4 and its completeness
Authors: Yu, Hai1 ; Zhan, Wan-Rong1 ; Zhang, Rui-Ling2
Author affiliation: 1 Academy of Mathematics and Science, Luoyang Normal College, Luoyang, Henan 471022, China
2 Academy of Information Technology, Luoyang Normal College, Luoyang, Henan 471022, China
Corresponding author: Zhang, R.-L. (ruilingzhang@163.com)
Source title: Tien Tzu Hsueh Pao/Acta Electronica Sinica
Abbreviated source title: Tien Tzu Hsueh Pao
Volume: 40
Issue: 4
Issue date: April 2012
Publication year: 2012
Pages: 745-750
Language: Chinese
ISSN: 03722112
CODEN: TTHPAG
Document type: Journal article (JA)
Publisher: Chinese Institute of Electronics, P.O. Box 165, Beijing, 100036, China
Abstract: Based on the sixth type of covering-based rough set model, covering semantics of modal logic S4 is proposed. The reliability and completeness theorems with respect to covering semantics are proved by means of the relationships between covering model and Kripke model. Moreover, the relationships between covering semantics and Alexandrov topological semantics are also discussed. It is proved that covering semantics and Alexandrov topological semantics are harmonious and consistent.
Number of references: 18
Main heading: Semantics
Controlled terms: Formal logic - Topology
Uncontrolled terms: Completeness - Completeness theorems - Covering model - Covering semsntics - Kripke model - Kripke semantics - Modal logic - Rough set models
Classification code: 721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 903.2 Information Dissemination - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory
DOI: 10.3969/j.issn.0372-2112.2012.04.020
Database: Compendex
Compilation and indexing terms, © 2012 Elsevier Inc. |
|