Theoretical Computer Science
Topology via logic
A relational algebra for complex objects based on partial information
MFDBS 91 Proceedings of the 3rd symposium on Mathematical fundamentals of database and knowledge base systems
Using powerdomains to generalize relational databases
Theoretical Computer Science
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Propositional Dynamic Logics of Programs: a Survey
Logic of Programs, Workshop
On the Duality of Dynamic Algebras and Kripke Models
Logic of Programs, Workshop
Some Applications of Topology to Program Semantics
Logic of Programs, Workshop
A Pure Logic-Algebraic Analysis of Rough Top and Rough Bottom Equalities
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Brouwer-Zadeh posets and three-valued Ł ukasiewicz posets
Fuzzy Sets and Systems
Treating incomplete knowledge in formal concept analysis
Formal Concept Analysis
| Hi-index | 0.00 |
Semantics connected to some information based metaphor are well-known in logic literature: a paradigmatic example is Kripke semantic for Intuitionistic Logic. In this paper we start from the concrete problem of providing suitable logic-algebraic models for the calculus of attribute dependencies in Formal Contexts with information gaps and we obtain an intuitive model based on the notion of ’’passage of information‘‘ showing that Kleene algebras, semi-simple Nelson algebras, three-valued Łukasiewicz algebras and Post algebras of order three are, in a sense, ’’naturally‘‘ and directly connected to partially defined information systems. In this way wecan provide for these logic-algebraic structures a ’’raison d‘êetre‘‘ different from the original motivations concerning, for instance, computability theory.