Studying Incompleteness of Information: A Class of Information Logics-Reference-Cited by-同舟云学术

Studying Incompleteness of Information: A Class of Information Logics

Published:1998 Issue: Volume: Page:283-300
ISSN:
Container-title:The Lvov-Warsaw School and Contemporary Philosophy
language:
Short-container-title:

Author:

Orłowska Ewa

Publisher

Springer Netherlands

Link

http://link.springer.com/content/pdf/10.1007/978-94-011-5108-5_23

Reference35 articles.

1. Balbiani, Ph.: 1997, ‘Axiomatization of logics based on Kripke models with relative accessibility relations’, in Orłowska, E. (ed.), Incomplete Information: Rough Set Analysis, Physica Verlag, Berlin, (forthcoming).

2. Demri, S.: 1996, private communication.

3. Demri, S.: 1996a, ‘The validity problem for logic DALLA is decidable’, Bulletin of the PAS, Mathematics 44, No. 1, pp. 79–86.

4. Demri, S.: 1996b, ‘A class of information logics with a decidable validity problem’, Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, Krakow, Poland, September 1996, Springer Lecture Notes in Computer Science, to appear.

5. Demri, S.: 1997, ‘A completeness proof for a logic with an alternative necessity operator’, Studia Logica, to appear.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A System of Relational Syllogistic Incorporating Full Boolean Reasoning;Journal of Logic, Language and Information;2012-08-25

2. Preimage Relations and Their Matrices;Rough Sets and Current Trends in Computing;1998

3. Relational Attribute Systems II: Reasoning with Relations in Information Structures;Transactions on Rough Sets VII