A class of decidable information logics
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4014675 (Why is no real title available?)
- scientific article; zbMATH DE number 3974344 (Why is no real title available?)
- scientific article; zbMATH DE number 4033710 (Why is no real title available?)
- scientific article; zbMATH DE number 4049118 (Why is no real title available?)
- scientific article; zbMATH DE number 23768 (Why is no real title available?)
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 139624 (Why is no real title available?)
- scientific article; zbMATH DE number 3485746 (Why is no real title available?)
- scientific article; zbMATH DE number 589751 (Why is no real title available?)
- scientific article; zbMATH DE number 1028833 (Why is no real title available?)
- scientific article; zbMATH DE number 1114035 (Why is no real title available?)
- scientific article; zbMATH DE number 1114040 (Why is no real title available?)
- scientific article; zbMATH DE number 1761423 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 887302 (Why is no real title available?)
- scientific article; zbMATH DE number 3325547 (Why is no real title available?)
- A general filtration method for modal logics
- A guide to completeness and complexity for modal logics of knowledge and belief
- A logic for reasoning about relative similarity
- Consistency proofs for systems of multi-agent only knowing
- Corrigendum to: ``DAL -- a logic for data analysis
- Coverings by classes of permutable equivalence relations
- Decidability by filtrations for graded normal logics. (Graded modalities. V)
- Expressive power of knowledge representation systems
- Information systems theoretical foundations
- Logic For Reasoning About Knowledge
- Modal logics for knowledge representation systems
- On Some Completeness Theorems in Modal Logic
- On standard models of fuzzy modal logics
- Rough polyadic modal logics
- Rough sets
- Rough sets and fuzzy sets
- Similarity relations and fuzzy orderings
- Taming logic
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- The equational theory of CA3 is undecidable
Cited in
(5)- A polynomial space construction of tree-like models for logics with local chains of modal connectives
- scientific article; zbMATH DE number 935035 (Why is no real title available?)
- scientific article; zbMATH DE number 887303 (Why is no real title available?)
- Decidability by filtrations for graded normal logics. (Graded modalities. V)
- Relative nondeterministic information logic is EXPTIME-complete
This page was built for publication: A class of decidable information logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1128479)