Incomplete Information: Structure, Inference, Complexity
Incomplete Information: Structure, Inference, Complexity
Double Residuated Lattices and Their Applications
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Substructural logics, combinatory logic, and lambda-calculus
Substructural logics, combinatory logic, and lambda-calculus
Discrete Duality and Its Applications to Reasoning with Incomplete Information
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Discrete Duality for Relation Algebras and Cylindric Algebras
RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Structures with Multirelations, their Discrete Dualities and Applications
Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa
| Hi-index | 0.00 |
Representation theorems for the algebras of substructural logics FL, FLe, FLc, and FLw are presented. The construction of the representation algebras is an extension of the constructions from Urquhart ([25]) and Allwein and Dunn ([1]). Namely, the representation algebras are built from the frames, which are appropriately associated to substructural logics. As a by–product we obtain a Kripke–style frame semantics for these logics.