Modal reduction principles: a parametric shift to graphs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A fresh perspective on canonical extensions for bounded lattices.
Algorithmic correspondence and canonicity for distributive modal logic
TiRS graphs and TiRS frames: a new setting for duals of canonical extensions
Algebraic structures in the vicinity of pre-rough algebra and their logics
A Sahlqvist theorem for distributive modal logic
Rudiments of rough sets
Fuzzy rough set theory for the interval-valued fuzzy information systems
Probabilistic rough set approximations
Constructive and axiomatic approaches of fuzzy approximation operators.
Algebraic structures in the vicinity of pre-rough algebra and their logics. II
On the connection of hypergraph theory with formal concept analysis and rough set theory
A logic for reasoning about probabilities
Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis
Modelling socio-political competition
A study of algebras and logics of rough sets based on classical and generalized approximation spaces
Integrating fuzzy formal concept analysis and rough set theory for the semantic web
Roughness in MV-algebras
Axiomatic systems for rough sets and fuzzy rough sets
Algorithmic correspondence and canonicity for non-distributive logics
Logics for rough concept analysis
Three-way granular computing, rough sets, and formal concept analysis
Modelling informational entropy
Proper multi-type display calculi for rough algebras
Algebraic modal correspondence: Sahlqvist and beyond
In so many possible worlds
Categories: How I Learned to Stop Worrying and Love Two Sorts
On Fuzzy Sets and Rough Sets from the Perspective of Indiscernibility
On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice
Algebras of Definable and Rough Sets in Quasi Order-based Approximation Spaces
ROUGH FUZZY SETS AND FUZZY ROUGH SETS*
Rough sets
Modal reduction principles
Unified correspondence as a proof-theoretic tool
ROUGH SET THEORY AND ITS APPLICATIONS TO DATA ANALYSIS
Unified Correspondence
Transactions on Rough Sets II
Transactions on Rough Sets II
Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
Rough Sets and Current Trends in Computing
Some theorems about the sentential calculi of Lewis and Heyting
Bounded lattice expansions
Rough concepts
Sequent Calculi for Varieties of Topological Quasi-Boolean Algebras
Labelled calculi for lattice-based modal logics
Labelled calculi for the logics of rough concepts

This page was built for publication: Modal reduction principles: a parametric shift to graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6497081)