Relational Methods in Computer Science
From MaRDI portal
Publication:5899313
DOI10.1007/11734673zbMATH Open1185.03095OpenAlexW2482623798MaRDI QIDQ5899313FDOQ5899313
Authors: Jouni Järvinen, Ewa Orłowska 
Publication date: 2 May 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11734673
Recommendations
- Representation of lattices with modal operators in two-sorted frames
- Theory and Applications of Relational Structures as Knowledge Instruments
- scientific article; zbMATH DE number 5046779
- Modal-like operators in Boolean lattices, Galois connections and fixed points
- Stone duality for lattice expansions
Cited In (5)
- Subrecursive equivalence relations and (non-)closure under lattice operations
- Representation of lattices with modal operators in two-sorted frames
- Categories: how I learned to stop worrying and love two sorts
- Dual characterizations for finite lattices via correspondence theory for monotone modal logic
- Reasoning with incomplete information in generalized Galois logics without distribution: the case of negation and modal operators
This page was built for publication: Relational Methods in Computer Science
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5899313)
